./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.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_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/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 31ae382edabe17ce34422996f792882116394642 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 17:24:06,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:24:06,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:24:06,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:24:06,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:24:06,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:24:06,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:24:06,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:24:06,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:24:06,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:24:06,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:24:06,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:24:06,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:24:06,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:24:06,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:24:06,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:24:06,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:24:06,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:24:06,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:24:06,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:24:06,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:24:06,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:24:06,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:24:06,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:24:06,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:24:06,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:24:06,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:24:06,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:24:06,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:24:06,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:24:06,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:24:06,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:24:06,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:24:06,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:24:06,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:24:06,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:24:06,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:24:06,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:24:06,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:24:06,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:24:06,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:24:06,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:24:06,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:24:06,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:24:06,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:24:06,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:24:06,454 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:24:06,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:24:06,454 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:24:06,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:24:06,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:24:06,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:24:06,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:24:06,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:24:06,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:24:06,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:24:06,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:24:06,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:24:06,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:24:06,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:24:06,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:24:06,457 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:24:06,457 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_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/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 -> 31ae382edabe17ce34422996f792882116394642 [2019-12-07 17:24:06,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:24:06,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:24:06,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:24:06,569 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:24:06,570 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:24:06,570 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i [2019-12-07 17:24:06,612 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/data/650467099/6062ef46b0e14f2398fbf1bfb7620655/FLAGa2a1fc233 [2019-12-07 17:24:07,080 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:24:07,081 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i [2019-12-07 17:24:07,091 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/data/650467099/6062ef46b0e14f2398fbf1bfb7620655/FLAGa2a1fc233 [2019-12-07 17:24:07,102 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/data/650467099/6062ef46b0e14f2398fbf1bfb7620655 [2019-12-07 17:24:07,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:24:07,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:24:07,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:24:07,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:24:07,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:24:07,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07, skipping insertion in model container [2019-12-07 17:24:07,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:24:07,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:24:07,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:24:07,409 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:24:07,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:24:07,491 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:24:07,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07 WrapperNode [2019-12-07 17:24:07,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:24:07,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:24:07,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:24:07,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:24:07,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:24:07,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:24:07,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:24:07,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:24:07,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... [2019-12-07 17:24:07,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:24:07,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:24:07,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:24:07,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:24:07,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/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 17:24:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:24:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:24:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:24:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:24:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:24:07,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:24:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:24:07,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:24:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:24:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:24:07,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:24:07,597 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 17:24:07,926 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:24:07,927 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:24:07,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:07 BoogieIcfgContainer [2019-12-07 17:24:07,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:24:07,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:24:07,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:24:07,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:24:07,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:24:07" (1/3) ... [2019-12-07 17:24:07,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe7e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:24:07, skipping insertion in model container [2019-12-07 17:24:07,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:07" (2/3) ... [2019-12-07 17:24:07,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe7e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:24:07, skipping insertion in model container [2019-12-07 17:24:07,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:07" (3/3) ... [2019-12-07 17:24:07,932 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-12-07 17:24:07,938 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:24:07,938 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:24:07,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:24:07,943 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:24:07,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,965 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,965 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:07,997 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:24:08,009 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:24:08,010 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:24:08,010 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:24:08,010 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:24:08,010 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:24:08,010 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:24:08,010 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:24:08,010 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:24:08,020 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-12-07 17:24:08,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 17:24:08,063 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 17:24:08,064 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:24:08,071 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 17:24:08,081 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-12-07 17:24:08,102 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-12-07 17:24:08,103 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:24:08,105 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 17:24:08,114 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 17:24:08,115 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:24:10,630 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 17:24:10,720 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-12-07 17:24:10,720 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-07 17:24:10,723 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-12-07 17:24:10,938 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-12-07 17:24:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-12-07 17:24:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 17:24:10,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:10,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 17:24:10,944 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-12-07 17:24:10,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:10,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890190627] [2019-12-07 17:24:10,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:11,090 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 17:24:11,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890190627] [2019-12-07 17:24:11,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:11,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:24:11,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893338392] [2019-12-07 17:24:11,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:11,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:11,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:11,106 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-12-07 17:24:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:11,289 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-12-07 17:24:11,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:11,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 17:24:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:11,373 INFO L225 Difference]: With dead ends: 5990 [2019-12-07 17:24:11,373 INFO L226 Difference]: Without dead ends: 5642 [2019-12-07 17:24:11,374 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 17:24:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-12-07 17:24:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-12-07 17:24:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-12-07 17:24:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-12-07 17:24:11,575 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-12-07 17:24:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:11,576 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-12-07 17:24:11,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-12-07 17:24:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:24:11,578 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:11,578 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:11,578 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-12-07 17:24:11,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:11,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690939071] [2019-12-07 17:24:11,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:11,641 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 17:24:11,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690939071] [2019-12-07 17:24:11,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:11,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:11,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976579451] [2019-12-07 17:24:11,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:11,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:11,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:11,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:11,643 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-12-07 17:24:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:11,878 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-12-07 17:24:11,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:24:11,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:24:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:11,935 INFO L225 Difference]: With dead ends: 8500 [2019-12-07 17:24:11,935 INFO L226 Difference]: Without dead ends: 8487 [2019-12-07 17:24:11,936 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 17:24:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-12-07 17:24:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-12-07 17:24:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-12-07 17:24:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-12-07 17:24:12,120 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-12-07 17:24:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:12,120 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-12-07 17:24:12,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-12-07 17:24:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:24:12,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:12,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:12,127 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-12-07 17:24:12,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:12,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905232035] [2019-12-07 17:24:12,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:12,166 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 17:24:12,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905232035] [2019-12-07 17:24:12,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:12,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:12,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087634919] [2019-12-07 17:24:12,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:12,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:12,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:12,167 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-12-07 17:24:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:12,233 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-12-07 17:24:12,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:12,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:24:12,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:12,261 INFO L225 Difference]: With dead ends: 10006 [2019-12-07 17:24:12,261 INFO L226 Difference]: Without dead ends: 10006 [2019-12-07 17:24:12,261 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 17:24:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-12-07 17:24:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-12-07 17:24:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-12-07 17:24:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-12-07 17:24:12,476 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-12-07 17:24:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:12,477 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-12-07 17:24:12,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-12-07 17:24:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:24:12,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:12,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:12,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-12-07 17:24:12,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:12,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947910580] [2019-12-07 17:24:12,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:12,522 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 17:24:12,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947910580] [2019-12-07 17:24:12,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:12,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:12,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66580574] [2019-12-07 17:24:12,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:12,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:12,524 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-12-07 17:24:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:12,654 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-12-07 17:24:12,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:24:12,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:24:12,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:12,675 INFO L225 Difference]: With dead ends: 10925 [2019-12-07 17:24:12,675 INFO L226 Difference]: Without dead ends: 10913 [2019-12-07 17:24:12,675 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 17:24:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-12-07 17:24:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-12-07 17:24:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-12-07 17:24:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-12-07 17:24:12,861 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-12-07 17:24:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:12,861 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-12-07 17:24:12,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-12-07 17:24:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:24:12,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:12,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:12,863 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:12,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-12-07 17:24:12,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:12,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9381027] [2019-12-07 17:24:12,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:12,897 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 17:24:12,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9381027] [2019-12-07 17:24:12,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:12,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:12,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089441499] [2019-12-07 17:24:12,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:12,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:12,899 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-12-07 17:24:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:13,018 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-12-07 17:24:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:24:13,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:24:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:13,035 INFO L225 Difference]: With dead ends: 11905 [2019-12-07 17:24:13,035 INFO L226 Difference]: Without dead ends: 11891 [2019-12-07 17:24:13,035 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 17:24:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-12-07 17:24:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-12-07 17:24:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-12-07 17:24:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-12-07 17:24:13,250 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-12-07 17:24:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:13,250 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-12-07 17:24:13,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-12-07 17:24:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:24:13,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:13,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:13,254 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-12-07 17:24:13,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:13,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237916193] [2019-12-07 17:24:13,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:13,321 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 17:24:13,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237916193] [2019-12-07 17:24:13,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:13,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:24:13,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443555098] [2019-12-07 17:24:13,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:13,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:13,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:13,323 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-12-07 17:24:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:13,375 INFO L93 Difference]: Finished difference Result 16550 states and 54111 transitions. [2019-12-07 17:24:13,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:13,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:24:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:13,402 INFO L225 Difference]: With dead ends: 16550 [2019-12-07 17:24:13,403 INFO L226 Difference]: Without dead ends: 15886 [2019-12-07 17:24:13,403 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 17:24:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15886 states. [2019-12-07 17:24:13,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15886 to 15319. [2019-12-07 17:24:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15319 states. [2019-12-07 17:24:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 50702 transitions. [2019-12-07 17:24:13,638 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 50702 transitions. Word has length 16 [2019-12-07 17:24:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:13,639 INFO L462 AbstractCegarLoop]: Abstraction has 15319 states and 50702 transitions. [2019-12-07 17:24:13,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 50702 transitions. [2019-12-07 17:24:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:24:13,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:13,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:13,644 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:13,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1927848057, now seen corresponding path program 1 times [2019-12-07 17:24:13,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:13,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065367650] [2019-12-07 17:24:13,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:13,676 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 17:24:13,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065367650] [2019-12-07 17:24:13,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:13,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:13,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794760466] [2019-12-07 17:24:13,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:13,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:13,678 INFO L87 Difference]: Start difference. First operand 15319 states and 50702 transitions. Second operand 3 states. [2019-12-07 17:24:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:13,724 INFO L93 Difference]: Finished difference Result 14507 states and 47200 transitions. [2019-12-07 17:24:13,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:13,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:24:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:13,742 INFO L225 Difference]: With dead ends: 14507 [2019-12-07 17:24:13,743 INFO L226 Difference]: Without dead ends: 14507 [2019-12-07 17:24:13,743 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 17:24:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14507 states. [2019-12-07 17:24:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14507 to 14339. [2019-12-07 17:24:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14339 states. [2019-12-07 17:24:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14339 states to 14339 states and 46700 transitions. [2019-12-07 17:24:13,969 INFO L78 Accepts]: Start accepts. Automaton has 14339 states and 46700 transitions. Word has length 17 [2019-12-07 17:24:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:13,969 INFO L462 AbstractCegarLoop]: Abstraction has 14339 states and 46700 transitions. [2019-12-07 17:24:13,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 14339 states and 46700 transitions. [2019-12-07 17:24:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:24:13,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:13,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:13,973 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1236852315, now seen corresponding path program 1 times [2019-12-07 17:24:13,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:13,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894768086] [2019-12-07 17:24:13,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:14,031 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 17:24:14,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894768086] [2019-12-07 17:24:14,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:14,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:14,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319177345] [2019-12-07 17:24:14,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:14,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:14,033 INFO L87 Difference]: Start difference. First operand 14339 states and 46700 transitions. Second operand 4 states. [2019-12-07 17:24:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:14,086 INFO L93 Difference]: Finished difference Result 14188 states and 46235 transitions. [2019-12-07 17:24:14,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:14,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 17:24:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:14,105 INFO L225 Difference]: With dead ends: 14188 [2019-12-07 17:24:14,105 INFO L226 Difference]: Without dead ends: 14084 [2019-12-07 17:24:14,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14084 states. [2019-12-07 17:24:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14084 to 14084. [2019-12-07 17:24:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14084 states. [2019-12-07 17:24:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14084 states to 14084 states and 45897 transitions. [2019-12-07 17:24:14,315 INFO L78 Accepts]: Start accepts. Automaton has 14084 states and 45897 transitions. Word has length 17 [2019-12-07 17:24:14,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:14,315 INFO L462 AbstractCegarLoop]: Abstraction has 14084 states and 45897 transitions. [2019-12-07 17:24:14,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand 14084 states and 45897 transitions. [2019-12-07 17:24:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:24:14,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:14,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:14,320 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:14,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2069901673, now seen corresponding path program 1 times [2019-12-07 17:24:14,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:14,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91440110] [2019-12-07 17:24:14,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:14,343 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 17:24:14,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91440110] [2019-12-07 17:24:14,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:14,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:14,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3541765] [2019-12-07 17:24:14,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:14,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:14,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:14,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:14,345 INFO L87 Difference]: Start difference. First operand 14084 states and 45897 transitions. Second operand 3 states. [2019-12-07 17:24:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:14,355 INFO L93 Difference]: Finished difference Result 1973 states and 4784 transitions. [2019-12-07 17:24:14,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:14,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:24:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:14,356 INFO L225 Difference]: With dead ends: 1973 [2019-12-07 17:24:14,357 INFO L226 Difference]: Without dead ends: 1973 [2019-12-07 17:24:14,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 17:24:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2019-12-07 17:24:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1973. [2019-12-07 17:24:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-12-07 17:24:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 4784 transitions. [2019-12-07 17:24:14,375 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 4784 transitions. Word has length 19 [2019-12-07 17:24:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:14,376 INFO L462 AbstractCegarLoop]: Abstraction has 1973 states and 4784 transitions. [2019-12-07 17:24:14,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 4784 transitions. [2019-12-07 17:24:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:24:14,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:14,377 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 17:24:14,377 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:14,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-12-07 17:24:14,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:14,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010630548] [2019-12-07 17:24:14,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:14,411 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 17:24:14,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010630548] [2019-12-07 17:24:14,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:14,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:14,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610661740] [2019-12-07 17:24:14,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:24:14,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:24:14,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:14,413 INFO L87 Difference]: Start difference. First operand 1973 states and 4784 transitions. Second operand 5 states. [2019-12-07 17:24:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:14,549 INFO L93 Difference]: Finished difference Result 2552 states and 6074 transitions. [2019-12-07 17:24:14,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:24:14,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 17:24:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:14,551 INFO L225 Difference]: With dead ends: 2552 [2019-12-07 17:24:14,551 INFO L226 Difference]: Without dead ends: 2516 [2019-12-07 17:24:14,551 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 17:24:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-12-07 17:24:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2056. [2019-12-07 17:24:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-12-07 17:24:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 4961 transitions. [2019-12-07 17:24:14,571 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 4961 transitions. Word has length 26 [2019-12-07 17:24:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:14,571 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 4961 transitions. [2019-12-07 17:24:14,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:24:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 4961 transitions. [2019-12-07 17:24:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:24:14,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:14,573 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 17:24:14,573 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-12-07 17:24:14,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:14,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71636105] [2019-12-07 17:24:14,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:14,626 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 17:24:14,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71636105] [2019-12-07 17:24:14,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:14,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:24:14,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988578144] [2019-12-07 17:24:14,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:24:14,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:24:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:14,627 INFO L87 Difference]: Start difference. First operand 2056 states and 4961 transitions. Second operand 5 states. [2019-12-07 17:24:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:14,743 INFO L93 Difference]: Finished difference Result 2314 states and 5527 transitions. [2019-12-07 17:24:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:24:14,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:24:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:14,746 INFO L225 Difference]: With dead ends: 2314 [2019-12-07 17:24:14,746 INFO L226 Difference]: Without dead ends: 2314 [2019-12-07 17:24:14,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:14,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-12-07 17:24:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2115. [2019-12-07 17:24:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-12-07 17:24:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 5071 transitions. [2019-12-07 17:24:14,772 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 5071 transitions. Word has length 27 [2019-12-07 17:24:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:14,773 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 5071 transitions. [2019-12-07 17:24:14,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:24:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 5071 transitions. [2019-12-07 17:24:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:24:14,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:14,775 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 17:24:14,776 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:14,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-12-07 17:24:14,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:14,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962166325] [2019-12-07 17:24:14,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:14,822 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 17:24:14,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962166325] [2019-12-07 17:24:14,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:14,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:14,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703471234] [2019-12-07 17:24:14,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:24:14,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:14,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:24:14,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:14,823 INFO L87 Difference]: Start difference. First operand 2115 states and 5071 transitions. Second operand 5 states. [2019-12-07 17:24:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:14,941 INFO L93 Difference]: Finished difference Result 2498 states and 5944 transitions. [2019-12-07 17:24:14,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:24:14,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:24:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:14,943 INFO L225 Difference]: With dead ends: 2498 [2019-12-07 17:24:14,943 INFO L226 Difference]: Without dead ends: 2462 [2019-12-07 17:24:14,943 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 17:24:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-12-07 17:24:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2055. [2019-12-07 17:24:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-12-07 17:24:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4955 transitions. [2019-12-07 17:24:14,969 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4955 transitions. Word has length 27 [2019-12-07 17:24:14,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:14,969 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 4955 transitions. [2019-12-07 17:24:14,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:24:14,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4955 transitions. [2019-12-07 17:24:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:24:14,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:14,972 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] [2019-12-07 17:24:14,972 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:14,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:14,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-12-07 17:24:14,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:14,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281151244] [2019-12-07 17:24:14,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:15,016 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 17:24:15,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281151244] [2019-12-07 17:24:15,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:15,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:15,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512656038] [2019-12-07 17:24:15,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:15,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:15,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:15,018 INFO L87 Difference]: Start difference. First operand 2055 states and 4955 transitions. Second operand 4 states. [2019-12-07 17:24:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:15,034 INFO L93 Difference]: Finished difference Result 966 states and 2264 transitions. [2019-12-07 17:24:15,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:15,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 17:24:15,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:15,036 INFO L225 Difference]: With dead ends: 966 [2019-12-07 17:24:15,036 INFO L226 Difference]: Without dead ends: 966 [2019-12-07 17:24:15,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-12-07 17:24:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 658. [2019-12-07 17:24:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-12-07 17:24:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1494 transitions. [2019-12-07 17:24:15,049 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1494 transitions. Word has length 28 [2019-12-07 17:24:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:15,049 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1494 transitions. [2019-12-07 17:24:15,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1494 transitions. [2019-12-07 17:24:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:24:15,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:15,051 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 17:24:15,051 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1254925043, now seen corresponding path program 1 times [2019-12-07 17:24:15,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:15,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032006866] [2019-12-07 17:24:15,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:15,263 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 17:24:15,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032006866] [2019-12-07 17:24:15,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:15,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:24:15,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685956261] [2019-12-07 17:24:15,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:24:15,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:24:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:24:15,264 INFO L87 Difference]: Start difference. First operand 658 states and 1494 transitions. Second operand 11 states. [2019-12-07 17:24:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:16,714 INFO L93 Difference]: Finished difference Result 2669 states and 5959 transitions. [2019-12-07 17:24:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 17:24:16,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-12-07 17:24:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:16,716 INFO L225 Difference]: With dead ends: 2669 [2019-12-07 17:24:16,716 INFO L226 Difference]: Without dead ends: 1496 [2019-12-07 17:24:16,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2019-12-07 17:24:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-12-07 17:24:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 747. [2019-12-07 17:24:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-12-07 17:24:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1700 transitions. [2019-12-07 17:24:16,725 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1700 transitions. Word has length 42 [2019-12-07 17:24:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:16,725 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1700 transitions. [2019-12-07 17:24:16,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:24:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1700 transitions. [2019-12-07 17:24:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:24:16,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:16,726 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 17:24:16,726 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:16,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1487589225, now seen corresponding path program 2 times [2019-12-07 17:24:16,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:16,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668564693] [2019-12-07 17:24:16,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:16,789 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 17:24:16,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668564693] [2019-12-07 17:24:16,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:16,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:16,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61089922] [2019-12-07 17:24:16,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:16,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:16,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:16,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:16,790 INFO L87 Difference]: Start difference. First operand 747 states and 1700 transitions. Second operand 4 states. [2019-12-07 17:24:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:16,801 INFO L93 Difference]: Finished difference Result 1146 states and 2637 transitions. [2019-12-07 17:24:16,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:16,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 17:24:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:16,802 INFO L225 Difference]: With dead ends: 1146 [2019-12-07 17:24:16,802 INFO L226 Difference]: Without dead ends: 427 [2019-12-07 17:24:16,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-12-07 17:24:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2019-12-07 17:24:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-12-07 17:24:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 985 transitions. [2019-12-07 17:24:16,806 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 985 transitions. Word has length 42 [2019-12-07 17:24:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:16,806 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 985 transitions. [2019-12-07 17:24:16,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 985 transitions. [2019-12-07 17:24:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:24:16,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:16,806 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 17:24:16,807 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:16,807 INFO L82 PathProgramCache]: Analyzing trace with hash 988579599, now seen corresponding path program 3 times [2019-12-07 17:24:16,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:16,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547916205] [2019-12-07 17:24:16,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:16,848 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 17:24:16,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547916205] [2019-12-07 17:24:16,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:16,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:24:16,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929506877] [2019-12-07 17:24:16,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:24:16,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:24:16,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:16,849 INFO L87 Difference]: Start difference. First operand 427 states and 985 transitions. Second operand 6 states. [2019-12-07 17:24:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:16,916 INFO L93 Difference]: Finished difference Result 638 states and 1419 transitions. [2019-12-07 17:24:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:24:16,916 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 17:24:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:16,917 INFO L225 Difference]: With dead ends: 638 [2019-12-07 17:24:16,917 INFO L226 Difference]: Without dead ends: 496 [2019-12-07 17:24:16,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:24:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-12-07 17:24:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 438. [2019-12-07 17:24:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-07 17:24:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1001 transitions. [2019-12-07 17:24:16,921 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1001 transitions. Word has length 42 [2019-12-07 17:24:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:16,921 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1001 transitions. [2019-12-07 17:24:16,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:24:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1001 transitions. [2019-12-07 17:24:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:24:16,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:16,922 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 17:24:16,922 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 4 times [2019-12-07 17:24:16,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:16,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457064902] [2019-12-07 17:24:16,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:24:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:24:16,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:24:16,975 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:24:16,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| 4) |v_#length_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1635~0.base_35|) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35|) |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35| 1)) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_35|, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1635~0.offset=|v_ULTIMATE.start_main_~#t1635~0.offset_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ULTIMATE.start_main_~#t1635~0.base=|v_ULTIMATE.start_main_~#t1635~0.base_35|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1636~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1635~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1635~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:24:16,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1636~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1636~0.base_10|) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10| 1) |v_#valid_25|) (not (= 0 |v_ULTIMATE.start_main_~#t1636~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10|) |v_ULTIMATE.start_main_~#t1636~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1636~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, #length] because there is no mapped edge [2019-12-07 17:24:16,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~x$r_buff1_thd0~0_Out-1299309941 ~x$r_buff0_thd0~0_In-1299309941) (= ~x$r_buff1_thd2~0_Out-1299309941 ~x$r_buff0_thd2~0_In-1299309941) (= ~x$r_buff0_thd2~0_Out-1299309941 1) (= ~x$r_buff0_thd1~0_In-1299309941 ~x$r_buff1_thd1~0_Out-1299309941) (= ~y~0_Out-1299309941 ~__unbuffered_p1_EBX~0_Out-1299309941) (= ~__unbuffered_p1_EAX~0_Out-1299309941 ~y~0_Out-1299309941) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1299309941)) (= ~y~0_Out-1299309941 1)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1299309941, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1299309941, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1299309941, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1299309941} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1299309941, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1299309941, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1299309941, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1299309941, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1299309941, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1299309941, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1299309941, ~y~0=~y~0_Out-1299309941, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1299309941, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1299309941} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:24:16,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 17:24:16,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1501412230 256)))) (or (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In-1501412230 256) 0)))) (and (= |P0Thread1of1ForFork1_#t~ite24_Out-1501412230| |P0Thread1of1ForFork1_#t~ite23_Out-1501412230|) .cse0 (= |P0Thread1of1ForFork1_#t~ite23_Out-1501412230| |P0Thread1of1ForFork1_#t~ite22_Out-1501412230|) (or (not (= (mod ~x$r_buff1_thd1~0_In-1501412230 256) 0)) .cse1) (not (= 0 (mod ~x$w_buff0_used~0_In-1501412230 256))) (or (not (= 0 (mod ~x$w_buff1_used~0_In-1501412230 256))) .cse1) (= |P0Thread1of1ForFork1_#t~ite22_Out-1501412230| 0))) (and (= |P0Thread1of1ForFork1_#t~ite22_In-1501412230| |P0Thread1of1ForFork1_#t~ite22_Out-1501412230|) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite24_Out-1501412230| ~x$r_buff1_thd1~0_In-1501412230) (= |P0Thread1of1ForFork1_#t~ite23_In-1501412230| |P0Thread1of1ForFork1_#t~ite23_Out-1501412230|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1501412230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1501412230, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1501412230, ~weak$$choice2~0=~weak$$choice2~0_In-1501412230, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-1501412230|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1501412230, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-1501412230|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1501412230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1501412230, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1501412230, ~weak$$choice2~0=~weak$$choice2~0_In-1501412230, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-1501412230|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-1501412230|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-1501412230|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1501412230} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:24:16,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:24:16,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1384429289 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1384429289 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1384429289| ~x$w_buff0_used~0_In-1384429289)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1384429289|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1384429289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1384429289} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1384429289, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1384429289|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1384429289} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:24:16,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In994636793 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In994636793 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In994636793 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In994636793 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out994636793| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out994636793| ~x$w_buff1_used~0_In994636793)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In994636793, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In994636793, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In994636793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In994636793} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In994636793, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In994636793, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In994636793, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out994636793|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In994636793} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:24:16,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In970971278 ~x$r_buff0_thd2~0_Out970971278)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In970971278 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In970971278 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out970971278) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In970971278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In970971278} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out970971278|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out970971278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In970971278} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:24:16,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1645983005 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1645983005 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1645983005 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1645983005 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1645983005| ~x$r_buff1_thd2~0_In1645983005) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1645983005|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1645983005, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1645983005, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1645983005, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1645983005} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1645983005|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1645983005, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1645983005, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1645983005, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1645983005} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:24:16,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:24:16,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:24:16,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In945519529 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In945519529 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In945519529 |ULTIMATE.start_main_#t~ite34_Out945519529|)) (and (not .cse0) (= ~x$w_buff1~0_In945519529 |ULTIMATE.start_main_#t~ite34_Out945519529|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In945519529, ~x$w_buff1_used~0=~x$w_buff1_used~0_In945519529, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In945519529, ~x~0=~x~0_In945519529} OutVars{~x$w_buff1~0=~x$w_buff1~0_In945519529, ~x$w_buff1_used~0=~x$w_buff1_used~0_In945519529, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In945519529, ~x~0=~x~0_In945519529, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out945519529|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 17:24:16,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 17:24:16,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1791240640 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1791240640 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1791240640| ~x$w_buff0_used~0_In-1791240640)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1791240640| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1791240640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1791240640} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1791240640, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1791240640|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1791240640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 17:24:16,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1330579752 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1330579752 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1330579752 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1330579752 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-1330579752| 0)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1330579752| ~x$w_buff1_used~0_In-1330579752) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1330579752, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1330579752, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1330579752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1330579752} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1330579752, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1330579752, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1330579752|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1330579752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1330579752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 17:24:16,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1555889330 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1555889330 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1555889330| ~x$r_buff0_thd0~0_In-1555889330) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1555889330| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1555889330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1555889330} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1555889330, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1555889330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1555889330} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 17:24:16,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1616055211 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1616055211 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1616055211 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1616055211 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1616055211| ~x$r_buff1_thd0~0_In-1616055211) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-1616055211| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1616055211, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1616055211, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1616055211, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616055211} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1616055211, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1616055211|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1616055211, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1616055211, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616055211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 17:24:16,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:24:17,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:24:17 BasicIcfg [2019-12-07 17:24:17,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:24:17,035 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:24:17,035 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:24:17,035 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:24:17,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:07" (3/4) ... [2019-12-07 17:24:17,037 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:24:17,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| 4) |v_#length_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1635~0.base_35|) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35|) |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35| 1)) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_35|, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1635~0.offset=|v_ULTIMATE.start_main_~#t1635~0.offset_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ULTIMATE.start_main_~#t1635~0.base=|v_ULTIMATE.start_main_~#t1635~0.base_35|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1636~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1635~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1635~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:24:17,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1636~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1636~0.base_10|) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10| 1) |v_#valid_25|) (not (= 0 |v_ULTIMATE.start_main_~#t1636~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10|) |v_ULTIMATE.start_main_~#t1636~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1636~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, #length] because there is no mapped edge [2019-12-07 17:24:17,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~x$r_buff1_thd0~0_Out-1299309941 ~x$r_buff0_thd0~0_In-1299309941) (= ~x$r_buff1_thd2~0_Out-1299309941 ~x$r_buff0_thd2~0_In-1299309941) (= ~x$r_buff0_thd2~0_Out-1299309941 1) (= ~x$r_buff0_thd1~0_In-1299309941 ~x$r_buff1_thd1~0_Out-1299309941) (= ~y~0_Out-1299309941 ~__unbuffered_p1_EBX~0_Out-1299309941) (= ~__unbuffered_p1_EAX~0_Out-1299309941 ~y~0_Out-1299309941) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1299309941)) (= ~y~0_Out-1299309941 1)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1299309941, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1299309941, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1299309941, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1299309941} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1299309941, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1299309941, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1299309941, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-1299309941, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1299309941, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1299309941, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1299309941, ~y~0=~y~0_Out-1299309941, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1299309941, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1299309941} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:24:17,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 17:24:17,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1501412230 256)))) (or (let ((.cse1 (not (= (mod ~x$r_buff0_thd1~0_In-1501412230 256) 0)))) (and (= |P0Thread1of1ForFork1_#t~ite24_Out-1501412230| |P0Thread1of1ForFork1_#t~ite23_Out-1501412230|) .cse0 (= |P0Thread1of1ForFork1_#t~ite23_Out-1501412230| |P0Thread1of1ForFork1_#t~ite22_Out-1501412230|) (or (not (= (mod ~x$r_buff1_thd1~0_In-1501412230 256) 0)) .cse1) (not (= 0 (mod ~x$w_buff0_used~0_In-1501412230 256))) (or (not (= 0 (mod ~x$w_buff1_used~0_In-1501412230 256))) .cse1) (= |P0Thread1of1ForFork1_#t~ite22_Out-1501412230| 0))) (and (= |P0Thread1of1ForFork1_#t~ite22_In-1501412230| |P0Thread1of1ForFork1_#t~ite22_Out-1501412230|) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite24_Out-1501412230| ~x$r_buff1_thd1~0_In-1501412230) (= |P0Thread1of1ForFork1_#t~ite23_In-1501412230| |P0Thread1of1ForFork1_#t~ite23_Out-1501412230|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1501412230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1501412230, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1501412230, ~weak$$choice2~0=~weak$$choice2~0_In-1501412230, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-1501412230|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1501412230, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-1501412230|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1501412230, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1501412230, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1501412230, ~weak$$choice2~0=~weak$$choice2~0_In-1501412230, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-1501412230|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-1501412230|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-1501412230|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1501412230} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:24:17,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 17:24:17,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1384429289 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1384429289 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1384429289| ~x$w_buff0_used~0_In-1384429289)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1384429289|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1384429289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1384429289} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1384429289, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1384429289|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1384429289} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:24:17,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In994636793 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In994636793 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In994636793 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In994636793 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out994636793| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out994636793| ~x$w_buff1_used~0_In994636793)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In994636793, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In994636793, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In994636793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In994636793} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In994636793, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In994636793, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In994636793, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out994636793|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In994636793} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 17:24:17,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_In970971278 ~x$r_buff0_thd2~0_Out970971278)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In970971278 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In970971278 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out970971278) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In970971278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In970971278} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out970971278|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out970971278, ~x$w_buff0_used~0=~x$w_buff0_used~0_In970971278} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 17:24:17,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1645983005 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1645983005 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1645983005 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1645983005 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out1645983005| ~x$r_buff1_thd2~0_In1645983005) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1645983005|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1645983005, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1645983005, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1645983005, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1645983005} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1645983005|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1645983005, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1645983005, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1645983005, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1645983005} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:24:17,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:24:17,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:24:17,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In945519529 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In945519529 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In945519529 |ULTIMATE.start_main_#t~ite34_Out945519529|)) (and (not .cse0) (= ~x$w_buff1~0_In945519529 |ULTIMATE.start_main_#t~ite34_Out945519529|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In945519529, ~x$w_buff1_used~0=~x$w_buff1_used~0_In945519529, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In945519529, ~x~0=~x~0_In945519529} OutVars{~x$w_buff1~0=~x$w_buff1~0_In945519529, ~x$w_buff1_used~0=~x$w_buff1_used~0_In945519529, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In945519529, ~x~0=~x~0_In945519529, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out945519529|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 17:24:17,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 17:24:17,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1791240640 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1791240640 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1791240640| ~x$w_buff0_used~0_In-1791240640)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1791240640| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1791240640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1791240640} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1791240640, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1791240640|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1791240640} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 17:24:17,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1330579752 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1330579752 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-1330579752 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1330579752 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-1330579752| 0)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1330579752| ~x$w_buff1_used~0_In-1330579752) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1330579752, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1330579752, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1330579752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1330579752} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1330579752, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1330579752, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1330579752|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1330579752, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1330579752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 17:24:17,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1555889330 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1555889330 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1555889330| ~x$r_buff0_thd0~0_In-1555889330) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1555889330| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1555889330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1555889330} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1555889330, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1555889330|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1555889330} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 17:24:17,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1616055211 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-1616055211 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1616055211 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1616055211 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1616055211| ~x$r_buff1_thd0~0_In-1616055211) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-1616055211| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1616055211, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1616055211, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1616055211, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616055211} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1616055211, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1616055211|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1616055211, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1616055211, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1616055211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 17:24:17,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:24:17,102 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aba9751c-1f8b-405a-b37a-bda08cf8a9b5/bin/uautomizer/witness.graphml [2019-12-07 17:24:17,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:24:17,103 INFO L168 Benchmark]: Toolchain (without parser) took 9998.26 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 454.0 MB). Free memory was 934.0 MB in the beginning and 966.9 MB in the end (delta: -32.9 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:17,104 INFO L168 Benchmark]: CDTParser took 0.22 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 17:24:17,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:17,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:17,105 INFO L168 Benchmark]: Boogie Preprocessor took 24.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:24:17,105 INFO L168 Benchmark]: RCFGBuilder took 372.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:17,106 INFO L168 Benchmark]: TraceAbstraction took 9106.18 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.9 MB). Free memory was 1.0 GB in the beginning and 981.9 MB in the end (delta: 33.5 MB). Peak memory consumption was 388.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:17,106 INFO L168 Benchmark]: Witness Printer took 67.47 ms. Allocated memory is still 1.5 GB. Free memory was 981.9 MB in the beginning and 966.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:17,108 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.22 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 385.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 372.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9106.18 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 354.9 MB). Free memory was 1.0 GB in the beginning and 981.9 MB in the end (delta: 33.5 MB). Peak memory consumption was 388.4 MB. Max. memory is 11.5 GB. * Witness Printer took 67.47 ms. Allocated memory is still 1.5 GB. Free memory was 981.9 MB in the beginning and 966.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1635, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1636, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1743 SDtfs, 1763 SDslu, 3084 SDs, 0 SdLazy, 2451 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15319occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 8825 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 53395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...