./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af66209bab14b4cf12f797bd2ba57b0a1312f2c5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:54,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:54,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:54,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:54,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:54,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:54,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:54,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:54,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:54,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:54,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:54,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:54,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:54,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:54,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:54,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:54,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:54,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:54,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:54,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:54,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:54,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:54,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:54,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:54,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:54,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:54,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:54,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:54,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:54,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:54,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:54,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:54,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:54,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:54,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:54,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:54,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:54,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:54,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:54,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:54,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:54,350 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:54,361 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:54,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:54,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:54,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:54,363 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:54,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:54,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:54,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:54,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:54,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:54,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:54,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:54,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:54,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:54,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:54,365 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:54,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:54,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:54,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:54,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:54,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:54,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:54,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:54,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:54,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:54,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:54,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:54,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:54,367 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:54,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af66209bab14b4cf12f797bd2ba57b0a1312f2c5 [2019-12-07 10:07:54,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:54,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:54,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:54,493 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:54,494 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:54,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_rmo.oepc.i [2019-12-07 10:07:54,535 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/data/5343aa73b/5f4dac2d5f924713a08471c7842300c7/FLAG7108e8e30 [2019-12-07 10:07:54,986 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:54,987 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/sv-benchmarks/c/pthread-wmm/rfi004_rmo.oepc.i [2019-12-07 10:07:54,997 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/data/5343aa73b/5f4dac2d5f924713a08471c7842300c7/FLAG7108e8e30 [2019-12-07 10:07:55,005 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/data/5343aa73b/5f4dac2d5f924713a08471c7842300c7 [2019-12-07 10:07:55,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:55,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:55,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:55,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:55,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:55,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55, skipping insertion in model container [2019-12-07 10:07:55,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:55,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:55,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:55,316 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:55,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:55,418 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:55,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55 WrapperNode [2019-12-07 10:07:55,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:55,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:55,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:55,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:55,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:55,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:55,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:55,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:55,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... [2019-12-07 10:07:55,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:55,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:55,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:55,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:55,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:07:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:07:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:07:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:07:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:07:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:07:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:55,520 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:07:55,829 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:55,829 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:07:55,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:55 BoogieIcfgContainer [2019-12-07 10:07:55,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:55,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:55,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:55,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:55,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:55" (1/3) ... [2019-12-07 10:07:55,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78767683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:55, skipping insertion in model container [2019-12-07 10:07:55,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:55" (2/3) ... [2019-12-07 10:07:55,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78767683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:55, skipping insertion in model container [2019-12-07 10:07:55,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:55" (3/3) ... [2019-12-07 10:07:55,835 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.oepc.i [2019-12-07 10:07:55,841 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:07:55,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:55,845 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:07:55,846 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:07:55,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,869 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,877 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,878 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,885 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,885 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:55,904 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:07:55,916 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:55,916 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:55,916 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:55,916 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:55,916 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:55,916 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:55,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:55,917 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:55,927 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-07 10:07:55,928 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-07 10:07:55,977 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-07 10:07:55,977 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:55,988 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 10:07:56,001 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-07 10:07:56,021 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-07 10:07:56,021 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:56,024 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 550 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 10:07:56,033 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 10:07:56,033 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:07:58,537 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 10:07:58,636 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-07 10:07:58,636 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-07 10:07:58,639 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-07 10:07:58,889 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-07 10:07:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-07 10:07:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:07:58,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:58,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:07:58,897 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-07 10:07:58,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:58,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836087997] [2019-12-07 10:07:58,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:59,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836087997] [2019-12-07 10:07:59,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:59,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:07:59,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640438989] [2019-12-07 10:07:59,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:59,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:59,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:59,091 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-07 10:07:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,258 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-07 10:07:59,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:59,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:07:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,309 INFO L225 Difference]: With dead ends: 6636 [2019-12-07 10:07:59,309 INFO L226 Difference]: Without dead ends: 6246 [2019-12-07 10:07:59,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-07 10:07:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-07 10:07:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-07 10:07:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-07 10:07:59,535 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-07 10:07:59,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:59,536 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-07 10:07:59,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-07 10:07:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:07:59,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:59,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:59,539 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:59,539 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-07 10:07:59,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:59,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436660182] [2019-12-07 10:07:59,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:59,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436660182] [2019-12-07 10:07:59,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:59,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:59,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753316783] [2019-12-07 10:07:59,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:59,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:59,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:59,603 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-07 10:07:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,829 INFO L93 Difference]: Finished difference Result 9424 states and 30254 transitions. [2019-12-07 10:07:59,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:59,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:07:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,883 INFO L225 Difference]: With dead ends: 9424 [2019-12-07 10:07:59,883 INFO L226 Difference]: Without dead ends: 9411 [2019-12-07 10:07:59,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-12-07 10:08:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 8307. [2019-12-07 10:08:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-12-07 10:08:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 27132 transitions. [2019-12-07 10:08:00,091 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 27132 transitions. Word has length 11 [2019-12-07 10:08:00,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,092 INFO L462 AbstractCegarLoop]: Abstraction has 8307 states and 27132 transitions. [2019-12-07 10:08:00,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 27132 transitions. [2019-12-07 10:08:00,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:08:00,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:00,095 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:00,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,096 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-07 10:08:00,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474763792] [2019-12-07 10:08:00,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:00,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474763792] [2019-12-07 10:08:00,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:00,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:00,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134704587] [2019-12-07 10:08:00,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:00,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:00,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:00,130 INFO L87 Difference]: Start difference. First operand 8307 states and 27132 transitions. Second operand 3 states. [2019-12-07 10:08:00,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:00,223 INFO L93 Difference]: Finished difference Result 11392 states and 37048 transitions. [2019-12-07 10:08:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:00,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 10:08:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:00,290 INFO L225 Difference]: With dead ends: 11392 [2019-12-07 10:08:00,290 INFO L226 Difference]: Without dead ends: 11392 [2019-12-07 10:08:00,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2019-12-07 10:08:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 10440. [2019-12-07 10:08:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10440 states. [2019-12-07 10:08:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10440 states to 10440 states and 34208 transitions. [2019-12-07 10:08:00,497 INFO L78 Accepts]: Start accepts. Automaton has 10440 states and 34208 transitions. Word has length 14 [2019-12-07 10:08:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,498 INFO L462 AbstractCegarLoop]: Abstraction has 10440 states and 34208 transitions. [2019-12-07 10:08:00,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10440 states and 34208 transitions. [2019-12-07 10:08:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:08:00,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,500 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:00,500 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:00,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,501 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-07 10:08:00,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830435715] [2019-12-07 10:08:00,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:00,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830435715] [2019-12-07 10:08:00,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:00,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:00,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861479502] [2019-12-07 10:08:00,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:00,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:00,546 INFO L87 Difference]: Start difference. First operand 10440 states and 34208 transitions. Second operand 4 states. [2019-12-07 10:08:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:00,683 INFO L93 Difference]: Finished difference Result 12648 states and 40515 transitions. [2019-12-07 10:08:00,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:00,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:08:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:00,711 INFO L225 Difference]: With dead ends: 12648 [2019-12-07 10:08:00,712 INFO L226 Difference]: Without dead ends: 12637 [2019-12-07 10:08:00,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2019-12-07 10:08:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 11272. [2019-12-07 10:08:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-12-07 10:08:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 36643 transitions. [2019-12-07 10:08:00,924 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 36643 transitions. Word has length 14 [2019-12-07 10:08:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,924 INFO L462 AbstractCegarLoop]: Abstraction has 11272 states and 36643 transitions. [2019-12-07 10:08:00,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 36643 transitions. [2019-12-07 10:08:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:08:00,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:00,927 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-07 10:08:00,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826472891] [2019-12-07 10:08:00,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:00,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826472891] [2019-12-07 10:08:00,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:00,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:00,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012188077] [2019-12-07 10:08:00,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:00,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:00,960 INFO L87 Difference]: Start difference. First operand 11272 states and 36643 transitions. Second operand 4 states. [2019-12-07 10:08:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:01,103 INFO L93 Difference]: Finished difference Result 13620 states and 43661 transitions. [2019-12-07 10:08:01,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:01,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:08:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:01,159 INFO L225 Difference]: With dead ends: 13620 [2019-12-07 10:08:01,159 INFO L226 Difference]: Without dead ends: 13607 [2019-12-07 10:08:01,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-07 10:08:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 11607. [2019-12-07 10:08:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-12-07 10:08:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 37707 transitions. [2019-12-07 10:08:01,340 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 37707 transitions. Word has length 14 [2019-12-07 10:08:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:01,340 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 37707 transitions. [2019-12-07 10:08:01,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 37707 transitions. [2019-12-07 10:08:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:08:01,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:01,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:01,344 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash 833908596, now seen corresponding path program 1 times [2019-12-07 10:08:01,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:01,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100742112] [2019-12-07 10:08:01,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:01,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100742112] [2019-12-07 10:08:01,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:01,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454253329] [2019-12-07 10:08:01,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:01,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:01,393 INFO L87 Difference]: Start difference. First operand 11607 states and 37707 transitions. Second operand 3 states. [2019-12-07 10:08:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:01,437 INFO L93 Difference]: Finished difference Result 11004 states and 35187 transitions. [2019-12-07 10:08:01,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:01,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:08:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:01,451 INFO L225 Difference]: With dead ends: 11004 [2019-12-07 10:08:01,451 INFO L226 Difference]: Without dead ends: 11004 [2019-12-07 10:08:01,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11004 states. [2019-12-07 10:08:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11004 to 10806. [2019-12-07 10:08:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10806 states. [2019-12-07 10:08:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10806 states to 10806 states and 34589 transitions. [2019-12-07 10:08:01,609 INFO L78 Accepts]: Start accepts. Automaton has 10806 states and 34589 transitions. Word has length 16 [2019-12-07 10:08:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:01,609 INFO L462 AbstractCegarLoop]: Abstraction has 10806 states and 34589 transitions. [2019-12-07 10:08:01,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 10806 states and 34589 transitions. [2019-12-07 10:08:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:08:01,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:01,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:01,612 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:01,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 568392815, now seen corresponding path program 1 times [2019-12-07 10:08:01,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:01,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156407772] [2019-12-07 10:08:01,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:01,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156407772] [2019-12-07 10:08:01,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:01,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102914491] [2019-12-07 10:08:01,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:01,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:01,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:01,655 INFO L87 Difference]: Start difference. First operand 10806 states and 34589 transitions. Second operand 4 states. [2019-12-07 10:08:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:01,683 INFO L93 Difference]: Finished difference Result 2214 states and 5802 transitions. [2019-12-07 10:08:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:08:01,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:08:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:01,685 INFO L225 Difference]: With dead ends: 2214 [2019-12-07 10:08:01,685 INFO L226 Difference]: Without dead ends: 1582 [2019-12-07 10:08:01,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2019-12-07 10:08:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2019-12-07 10:08:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2019-12-07 10:08:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 3772 transitions. [2019-12-07 10:08:01,702 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 3772 transitions. Word has length 16 [2019-12-07 10:08:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:01,702 INFO L462 AbstractCegarLoop]: Abstraction has 1582 states and 3772 transitions. [2019-12-07 10:08:01,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 3772 transitions. [2019-12-07 10:08:01,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:08:01,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:01,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:01,704 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:01,704 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-07 10:08:01,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:01,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338734441] [2019-12-07 10:08:01,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:01,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338734441] [2019-12-07 10:08:01,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:01,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780076056] [2019-12-07 10:08:01,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:01,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:01,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:01,750 INFO L87 Difference]: Start difference. First operand 1582 states and 3772 transitions. Second operand 5 states. [2019-12-07 10:08:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:01,897 INFO L93 Difference]: Finished difference Result 2197 states and 5190 transitions. [2019-12-07 10:08:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:08:01,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 10:08:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:01,899 INFO L225 Difference]: With dead ends: 2197 [2019-12-07 10:08:01,899 INFO L226 Difference]: Without dead ends: 2195 [2019-12-07 10:08:01,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-12-07 10:08:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1696. [2019-12-07 10:08:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2019-12-07 10:08:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 4041 transitions. [2019-12-07 10:08:01,918 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 4041 transitions. Word has length 26 [2019-12-07 10:08:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:01,918 INFO L462 AbstractCegarLoop]: Abstraction has 1696 states and 4041 transitions. [2019-12-07 10:08:01,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 4041 transitions. [2019-12-07 10:08:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:08:01,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:01,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:01,921 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:01,921 INFO L82 PathProgramCache]: Analyzing trace with hash 427469221, now seen corresponding path program 1 times [2019-12-07 10:08:01,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:01,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450213517] [2019-12-07 10:08:01,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:01,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450213517] [2019-12-07 10:08:01,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:08:01,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900668481] [2019-12-07 10:08:01,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:01,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:01,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:01,978 INFO L87 Difference]: Start difference. First operand 1696 states and 4041 transitions. Second operand 5 states. [2019-12-07 10:08:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:02,105 INFO L93 Difference]: Finished difference Result 2166 states and 5108 transitions. [2019-12-07 10:08:02,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:08:02,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 10:08:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:02,107 INFO L225 Difference]: With dead ends: 2166 [2019-12-07 10:08:02,108 INFO L226 Difference]: Without dead ends: 2164 [2019-12-07 10:08:02,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-12-07 10:08:02,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 1602. [2019-12-07 10:08:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2019-12-07 10:08:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 3822 transitions. [2019-12-07 10:08:02,124 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 3822 transitions. Word has length 27 [2019-12-07 10:08:02,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:02,124 INFO L462 AbstractCegarLoop]: Abstraction has 1602 states and 3822 transitions. [2019-12-07 10:08:02,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 3822 transitions. [2019-12-07 10:08:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:08:02,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:02,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:02,126 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash 225506980, now seen corresponding path program 1 times [2019-12-07 10:08:02,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:02,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117561540] [2019-12-07 10:08:02,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:02,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117561540] [2019-12-07 10:08:02,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:02,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:02,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962591461] [2019-12-07 10:08:02,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:02,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:02,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:02,178 INFO L87 Difference]: Start difference. First operand 1602 states and 3822 transitions. Second operand 5 states. [2019-12-07 10:08:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:02,206 INFO L93 Difference]: Finished difference Result 791 states and 1818 transitions. [2019-12-07 10:08:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:02,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 10:08:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:02,207 INFO L225 Difference]: With dead ends: 791 [2019-12-07 10:08:02,207 INFO L226 Difference]: Without dead ends: 716 [2019-12-07 10:08:02,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-12-07 10:08:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-12-07 10:08:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-12-07 10:08:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1637 transitions. [2019-12-07 10:08:02,213 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1637 transitions. Word has length 27 [2019-12-07 10:08:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:02,214 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1637 transitions. [2019-12-07 10:08:02,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1637 transitions. [2019-12-07 10:08:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:08:02,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:02,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:02,215 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:02,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:02,215 INFO L82 PathProgramCache]: Analyzing trace with hash 394366268, now seen corresponding path program 1 times [2019-12-07 10:08:02,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:02,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491094223] [2019-12-07 10:08:02,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:02,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491094223] [2019-12-07 10:08:02,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:02,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:02,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849871998] [2019-12-07 10:08:02,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:02,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:02,288 INFO L87 Difference]: Start difference. First operand 716 states and 1637 transitions. Second operand 6 states. [2019-12-07 10:08:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:02,432 INFO L93 Difference]: Finished difference Result 1836 states and 4152 transitions. [2019-12-07 10:08:02,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:08:02,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 10:08:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:02,433 INFO L225 Difference]: With dead ends: 1836 [2019-12-07 10:08:02,434 INFO L226 Difference]: Without dead ends: 1248 [2019-12-07 10:08:02,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:08:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-07 10:08:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 788. [2019-12-07 10:08:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-07 10:08:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1805 transitions. [2019-12-07 10:08:02,442 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1805 transitions. Word has length 42 [2019-12-07 10:08:02,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:02,442 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1805 transitions. [2019-12-07 10:08:02,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1805 transitions. [2019-12-07 10:08:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:08:02,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:02,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:02,443 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:02,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:02,443 INFO L82 PathProgramCache]: Analyzing trace with hash -186633826, now seen corresponding path program 2 times [2019-12-07 10:08:02,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:02,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359049470] [2019-12-07 10:08:02,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:02,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359049470] [2019-12-07 10:08:02,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:02,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:02,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266955259] [2019-12-07 10:08:02,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:02,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:02,514 INFO L87 Difference]: Start difference. First operand 788 states and 1805 transitions. Second operand 5 states. [2019-12-07 10:08:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:02,539 INFO L93 Difference]: Finished difference Result 1266 states and 2914 transitions. [2019-12-07 10:08:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:08:02,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 10:08:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:02,540 INFO L225 Difference]: With dead ends: 1266 [2019-12-07 10:08:02,540 INFO L226 Difference]: Without dead ends: 498 [2019-12-07 10:08:02,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-12-07 10:08:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2019-12-07 10:08:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-07 10:08:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1142 transitions. [2019-12-07 10:08:02,545 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1142 transitions. Word has length 42 [2019-12-07 10:08:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:02,545 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1142 transitions. [2019-12-07 10:08:02,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1142 transitions. [2019-12-07 10:08:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:08:02,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:02,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:02,546 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:02,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash 380081836, now seen corresponding path program 3 times [2019-12-07 10:08:02,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:02,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153028901] [2019-12-07 10:08:02,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:02,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153028901] [2019-12-07 10:08:02,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:02,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:08:02,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471106986] [2019-12-07 10:08:02,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:08:02,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:08:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:08:02,725 INFO L87 Difference]: Start difference. First operand 498 states and 1142 transitions. Second operand 12 states. [2019-12-07 10:08:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:03,087 INFO L93 Difference]: Finished difference Result 870 states and 1951 transitions. [2019-12-07 10:08:03,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:08:03,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-12-07 10:08:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:03,088 INFO L225 Difference]: With dead ends: 870 [2019-12-07 10:08:03,088 INFO L226 Difference]: Without dead ends: 626 [2019-12-07 10:08:03,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-12-07 10:08:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-12-07 10:08:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 562. [2019-12-07 10:08:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-12-07 10:08:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1286 transitions. [2019-12-07 10:08:03,094 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1286 transitions. Word has length 42 [2019-12-07 10:08:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:03,094 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 1286 transitions. [2019-12-07 10:08:03,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:08:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1286 transitions. [2019-12-07 10:08:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:08:03,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:03,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:03,096 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1232492420, now seen corresponding path program 4 times [2019-12-07 10:08:03,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:03,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140540309] [2019-12-07 10:08:03,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:08:03,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140540309] [2019-12-07 10:08:03,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:03,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:08:03,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595647105] [2019-12-07 10:08:03,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:08:03,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:08:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:03,171 INFO L87 Difference]: Start difference. First operand 562 states and 1286 transitions. Second operand 7 states. [2019-12-07 10:08:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:03,302 INFO L93 Difference]: Finished difference Result 922 states and 2073 transitions. [2019-12-07 10:08:03,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:08:03,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 10:08:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:03,303 INFO L225 Difference]: With dead ends: 922 [2019-12-07 10:08:03,303 INFO L226 Difference]: Without dead ends: 588 [2019-12-07 10:08:03,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:08:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-12-07 10:08:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 514. [2019-12-07 10:08:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-07 10:08:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1172 transitions. [2019-12-07 10:08:03,307 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1172 transitions. Word has length 42 [2019-12-07 10:08:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:03,307 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1172 transitions. [2019-12-07 10:08:03,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:08:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1172 transitions. [2019-12-07 10:08:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:08:03,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:03,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:03,308 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 5 times [2019-12-07 10:08:03,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:03,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799612526] [2019-12-07 10:08:03,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:03,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:08:03,385 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:08:03,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1657~0.base_19| 4)) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1657~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1657~0.base_19|) |v_ULTIMATE.start_main_~#t1657~0.offset_17| 0)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1657~0.base_19|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= 0 |v_ULTIMATE.start_main_~#t1657~0.offset_17|) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t1657~0.base_19| 1)) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= (select .cse0 |v_ULTIMATE.start_main_~#t1657~0.base_19|) 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1657~0.offset=|v_ULTIMATE.start_main_~#t1657~0.offset_17|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_~#t1657~0.base=|v_ULTIMATE.start_main_~#t1657~0.base_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ULTIMATE.start_main_~#t1658~0.offset=|v_ULTIMATE.start_main_~#t1658~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1658~0.base=|v_ULTIMATE.start_main_~#t1658~0.base_22|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1657~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1657~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1658~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1658~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:08:03,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1658~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1658~0.base_9|)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1658~0.base_9|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1658~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1658~0.offset_8| 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1658~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1658~0.base_9|) |v_ULTIMATE.start_main_~#t1658~0.offset_8| 1)) |v_#memory_int_7|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1658~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1658~0.base=|v_ULTIMATE.start_main_~#t1658~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1658~0.offset=|v_ULTIMATE.start_main_~#t1658~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1658~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1658~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:08:03,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:08:03,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2131157185 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2131157185 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2131157185| ~y$w_buff0_used~0_In-2131157185) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-2131157185|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131157185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2131157185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131157185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2131157185, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2131157185|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:08:03,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In2125083723 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2125083723 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2125083723 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2125083723 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2125083723 |P1Thread1of1ForFork0_#t~ite29_Out2125083723|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out2125083723|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2125083723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2125083723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2125083723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2125083723} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2125083723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2125083723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2125083723, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2125083723|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2125083723} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:08:03,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In612146484 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_Out612146484 ~y$r_buff0_thd2~0_In612146484)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In612146484 256)))) (or (and (= ~y$r_buff0_thd2~0_Out612146484 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In612146484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In612146484} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In612146484, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out612146484|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out612146484} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:08:03,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-982836702 256) 0))) (or (and (= ~y$w_buff1_used~0_In-982836702 |P0Thread1of1ForFork1_#t~ite17_Out-982836702|) .cse0 (= |P0Thread1of1ForFork1_#t~ite18_Out-982836702| |P0Thread1of1ForFork1_#t~ite17_Out-982836702|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-982836702 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-982836702 256)) (and (= (mod ~y$r_buff1_thd1~0_In-982836702 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In-982836702 256) 0))))) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite18_Out-982836702| ~y$w_buff1_used~0_In-982836702) (= |P0Thread1of1ForFork1_#t~ite17_In-982836702| |P0Thread1of1ForFork1_#t~ite17_Out-982836702|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-982836702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-982836702, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-982836702, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-982836702|, ~weak$$choice2~0=~weak$$choice2~0_In-982836702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-982836702} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-982836702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-982836702, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-982836702, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-982836702|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-982836702|, ~weak$$choice2~0=~weak$$choice2~0_In-982836702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-982836702} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 10:08:03,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:08:03,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:08:03,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In577502012 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In577502012 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In577502012 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In577502012 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out577502012| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out577502012| ~y$r_buff1_thd2~0_In577502012) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In577502012, ~y$w_buff0_used~0=~y$w_buff0_used~0_In577502012, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In577502012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In577502012} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In577502012, ~y$w_buff0_used~0=~y$w_buff0_used~0_In577502012, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out577502012|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In577502012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In577502012} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:08:03,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 10:08:03,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:08:03,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In185211934 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In185211934 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out185211934| ~y$w_buff1~0_In185211934) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In185211934 |ULTIMATE.start_main_#t~ite34_Out185211934|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In185211934, ~y~0=~y~0_In185211934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185211934, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185211934} OutVars{~y$w_buff1~0=~y$w_buff1~0_In185211934, ~y~0=~y~0_In185211934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185211934, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out185211934|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185211934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 10:08:03,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 10:08:03,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1951541189 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1951541189 256)))) (or (and (= ~y$w_buff0_used~0_In1951541189 |ULTIMATE.start_main_#t~ite36_Out1951541189|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite36_Out1951541189|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1951541189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1951541189} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1951541189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1951541189, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1951541189|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 10:08:03,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1962667545 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1962667545 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1962667545 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1962667545 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out-1962667545| ~y$w_buff1_used~0_In-1962667545)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1962667545| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1962667545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1962667545, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1962667545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1962667545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1962667545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1962667545, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1962667545|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1962667545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1962667545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:08:03,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1292969160 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1292969160 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1292969160| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out1292969160| ~y$r_buff0_thd0~0_In1292969160) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1292969160, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1292969160} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1292969160, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1292969160, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1292969160|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:08:03,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1285574868 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1285574868 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1285574868 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1285574868 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1285574868 |ULTIMATE.start_main_#t~ite39_Out1285574868|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1285574868|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1285574868, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1285574868, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1285574868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285574868} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1285574868, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1285574868|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1285574868, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1285574868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285574868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:08:03,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:08:03,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:03 BasicIcfg [2019-12-07 10:08:03,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:08:03,445 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:08:03,445 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:08:03,445 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:08:03,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:55" (3/4) ... [2019-12-07 10:08:03,447 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:08:03,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1657~0.base_19| 4)) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1657~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1657~0.base_19|) |v_ULTIMATE.start_main_~#t1657~0.offset_17| 0)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1657~0.base_19|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= 0 |v_ULTIMATE.start_main_~#t1657~0.offset_17|) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= |v_#valid_38| (store .cse0 |v_ULTIMATE.start_main_~#t1657~0.base_19| 1)) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= (select .cse0 |v_ULTIMATE.start_main_~#t1657~0.base_19|) 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1657~0.offset=|v_ULTIMATE.start_main_~#t1657~0.offset_17|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_~#t1657~0.base=|v_ULTIMATE.start_main_~#t1657~0.base_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ULTIMATE.start_main_~#t1658~0.offset=|v_ULTIMATE.start_main_~#t1658~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1658~0.base=|v_ULTIMATE.start_main_~#t1658~0.base_22|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1657~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1657~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1658~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1658~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:08:03,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1658~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1658~0.base_9|)) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1658~0.base_9|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1658~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1658~0.offset_8| 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1658~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1658~0.base_9|) |v_ULTIMATE.start_main_~#t1658~0.offset_8| 1)) |v_#memory_int_7|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1658~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1658~0.base=|v_ULTIMATE.start_main_~#t1658~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1658~0.offset=|v_ULTIMATE.start_main_~#t1658~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1658~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1658~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:08:03,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:08:03,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2131157185 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2131157185 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-2131157185| ~y$w_buff0_used~0_In-2131157185) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-2131157185|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131157185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2131157185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131157185, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2131157185, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2131157185|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 10:08:03,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In2125083723 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2125083723 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In2125083723 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2125083723 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2125083723 |P1Thread1of1ForFork0_#t~ite29_Out2125083723|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out2125083723|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2125083723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2125083723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2125083723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2125083723} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2125083723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2125083723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2125083723, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out2125083723|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2125083723} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:08:03,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In612146484 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_Out612146484 ~y$r_buff0_thd2~0_In612146484)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In612146484 256)))) (or (and (= ~y$r_buff0_thd2~0_Out612146484 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In612146484, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In612146484} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In612146484, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out612146484|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out612146484} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:08:03,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-982836702 256) 0))) (or (and (= ~y$w_buff1_used~0_In-982836702 |P0Thread1of1ForFork1_#t~ite17_Out-982836702|) .cse0 (= |P0Thread1of1ForFork1_#t~ite18_Out-982836702| |P0Thread1of1ForFork1_#t~ite17_Out-982836702|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-982836702 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-982836702 256)) (and (= (mod ~y$r_buff1_thd1~0_In-982836702 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In-982836702 256) 0))))) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite18_Out-982836702| ~y$w_buff1_used~0_In-982836702) (= |P0Thread1of1ForFork1_#t~ite17_In-982836702| |P0Thread1of1ForFork1_#t~ite17_Out-982836702|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-982836702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-982836702, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-982836702, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-982836702|, ~weak$$choice2~0=~weak$$choice2~0_In-982836702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-982836702} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-982836702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-982836702, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-982836702, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-982836702|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-982836702|, ~weak$$choice2~0=~weak$$choice2~0_In-982836702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-982836702} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 10:08:03,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_5|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:08:03,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_9|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:08:03,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In577502012 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In577502012 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In577502012 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In577502012 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out577502012| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out577502012| ~y$r_buff1_thd2~0_In577502012) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In577502012, ~y$w_buff0_used~0=~y$w_buff0_used~0_In577502012, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In577502012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In577502012} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In577502012, ~y$w_buff0_used~0=~y$w_buff0_used~0_In577502012, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out577502012|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In577502012, ~y$w_buff1_used~0=~y$w_buff1_used~0_In577502012} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 10:08:03,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_32| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 10:08:03,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:08:03,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In185211934 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In185211934 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out185211934| ~y$w_buff1~0_In185211934) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In185211934 |ULTIMATE.start_main_#t~ite34_Out185211934|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In185211934, ~y~0=~y~0_In185211934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185211934, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185211934} OutVars{~y$w_buff1~0=~y$w_buff1~0_In185211934, ~y~0=~y~0_In185211934, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In185211934, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out185211934|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185211934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 10:08:03,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 10:08:03,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1951541189 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1951541189 256)))) (or (and (= ~y$w_buff0_used~0_In1951541189 |ULTIMATE.start_main_#t~ite36_Out1951541189|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite36_Out1951541189|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1951541189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1951541189} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1951541189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1951541189, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1951541189|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 10:08:03,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1962667545 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1962667545 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1962667545 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1962667545 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out-1962667545| ~y$w_buff1_used~0_In-1962667545)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1962667545| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1962667545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1962667545, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1962667545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1962667545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1962667545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1962667545, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1962667545|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1962667545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1962667545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:08:03,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1292969160 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1292969160 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1292969160| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out1292969160| ~y$r_buff0_thd0~0_In1292969160) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1292969160, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1292969160} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1292969160, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1292969160, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1292969160|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:08:03,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1285574868 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1285574868 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1285574868 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1285574868 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1285574868 |ULTIMATE.start_main_#t~ite39_Out1285574868|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1285574868|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1285574868, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1285574868, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1285574868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285574868} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1285574868, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1285574868|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1285574868, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1285574868, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285574868} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:08:03,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:08:03,517 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0b27b37f-5f03-401b-a929-8ca49c98dfcc/bin/uautomizer/witness.graphml [2019-12-07 10:08:03,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:08:03,519 INFO L168 Benchmark]: Toolchain (without parser) took 8510.67 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 421.5 MB). Free memory was 934.0 MB in the beginning and 923.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 431.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:03,520 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:08:03,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -115.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:03,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:03,521 INFO L168 Benchmark]: Boogie Preprocessor took 22.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:08:03,521 INFO L168 Benchmark]: RCFGBuilder took 352.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 998.0 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:03,522 INFO L168 Benchmark]: TraceAbstraction took 7613.51 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 992.7 MB in the beginning and 939.1 MB in the end (delta: 53.6 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:03,522 INFO L168 Benchmark]: Witness Printer took 73.08 ms. Allocated memory is still 1.5 GB. Free memory was 939.1 MB in the beginning and 923.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:03,524 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 409.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 934.0 MB in the beginning and 1.0 GB in the end (delta: -115.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 352.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 998.0 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7613.51 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 339.7 MB). Free memory was 992.7 MB in the beginning and 939.1 MB in the end (delta: 53.6 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. * Witness Printer took 73.08 ms. Allocated memory is still 1.5 GB. Free memory was 939.1 MB in the beginning and 923.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1647 SDtfs, 1780 SDslu, 3513 SDs, 0 SdLazy, 1432 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11607occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 7278 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 66467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...