./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix020_pso.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_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix020_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/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 78532c974a7a5f758fd4600acac66d58b0c04b4c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:39:54,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:39:54,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:39:54,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:39:54,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:39:54,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:39:54,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:39:54,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:39:54,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:39:54,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:39:54,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:39:54,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:39:54,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:39:54,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:39:54,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:39:54,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:39:54,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:39:54,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:39:54,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:39:54,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:39:54,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:39:54,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:39:54,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:39:54,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:39:54,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:39:54,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:39:54,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:39:54,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:39:54,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:39:54,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:39:54,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:39:54,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:39:54,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:39:54,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:39:54,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:39:54,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:39:54,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:39:54,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:39:54,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:39:54,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:39:54,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:39:54,618 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:39:54,627 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:39:54,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:39:54,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:39:54,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:39:54,628 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:39:54,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:39:54,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:39:54,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:39:54,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:39:54,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:39:54,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:39:54,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:39:54,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:39:54,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:39:54,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:39:54,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:39:54,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:39:54,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:39:54,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:39:54,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:39:54,631 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:39:54,631 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_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/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 -> 78532c974a7a5f758fd4600acac66d58b0c04b4c [2019-12-07 18:39:54,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:39:54,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:39:54,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:39:54,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:39:54,749 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:39:54,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix020_pso.opt.i [2019-12-07 18:39:54,792 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/data/e27f71dcb/a5ea6fde944a48fb983d42a6818e156a/FLAG7bd2d227e [2019-12-07 18:39:55,270 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:39:55,270 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/sv-benchmarks/c/pthread-wmm/mix020_pso.opt.i [2019-12-07 18:39:55,280 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/data/e27f71dcb/a5ea6fde944a48fb983d42a6818e156a/FLAG7bd2d227e [2019-12-07 18:39:55,290 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/data/e27f71dcb/a5ea6fde944a48fb983d42a6818e156a [2019-12-07 18:39:55,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:39:55,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:39:55,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:39:55,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:39:55,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:39:55,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cad387c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55, skipping insertion in model container [2019-12-07 18:39:55,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:39:55,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:39:55,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:39:55,591 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:39:55,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:39:55,683 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:39:55,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55 WrapperNode [2019-12-07 18:39:55,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:39:55,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:39:55,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:39:55,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:39:55,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:39:55,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:39:55,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:39:55,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:39:55,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... [2019-12-07 18:39:55,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:39:55,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:39:55,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:39:55,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:39:55,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/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 18:39:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:39:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:39:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:39:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:39:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:39:55,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:39:55,798 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:39:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:39:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:39:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:39:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:39:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:39:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:39:55,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:39:55,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:39:55,800 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 18:39:56,211 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:39:56,211 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:39:56,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:39:56 BoogieIcfgContainer [2019-12-07 18:39:56,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:39:56,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:39:56,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:39:56,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:39:56,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:39:55" (1/3) ... [2019-12-07 18:39:56,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ef39be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:39:56, skipping insertion in model container [2019-12-07 18:39:56,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:39:55" (2/3) ... [2019-12-07 18:39:56,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ef39be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:39:56, skipping insertion in model container [2019-12-07 18:39:56,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:39:56" (3/3) ... [2019-12-07 18:39:56,217 INFO L109 eAbstractionObserver]: Analyzing ICFG mix020_pso.opt.i [2019-12-07 18:39:56,223 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:39:56,223 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:39:56,228 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:39:56,228 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:39:56,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,256 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,256 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,257 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,258 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,258 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,266 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,267 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,269 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,269 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,269 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,270 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,270 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,273 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,274 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,277 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,278 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,279 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:39:56,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:39:56,312 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:39:56,312 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:39:56,312 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:39:56,312 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:39:56,312 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:39:56,313 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:39:56,313 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:39:56,313 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:39:56,324 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 18:39:56,325 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 18:39:56,404 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 18:39:56,404 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:39:56,416 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:39:56,439 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 18:39:56,480 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 18:39:56,480 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:39:56,489 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:39:56,515 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 18:39:56,516 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:40:00,173 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 18:40:00,471 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 18:40:00,583 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 18:40:00,583 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 18:40:00,585 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 18:40:08,969 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 18:40:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 18:40:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:40:08,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:08,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:40:08,976 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:40:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 18:40:08,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:08,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037894812] [2019-12-07 18:40:08,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:09,153 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 18:40:09,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037894812] [2019-12-07 18:40:09,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:09,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:40:09,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606889252] [2019-12-07 18:40:09,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:40:09,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:09,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:40:09,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:40:09,169 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 18:40:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:09,909 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 18:40:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:40:09,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 18:40:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:10,402 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 18:40:10,402 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 18:40:10,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 18:40:11,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 18:40:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 18:40:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 18:40:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 18:40:13,391 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 18:40:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:13,392 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 18:40:13,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:40:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 18:40:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:40:13,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:13,400 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:40:13,400 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:40:13,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 18:40:13,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:13,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971190895] [2019-12-07 18:40:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:13,470 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 18:40:13,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971190895] [2019-12-07 18:40:13,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:13,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:40:13,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031954546] [2019-12-07 18:40:13,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:40:13,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:13,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:40:13,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:40:13,472 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 18:40:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:15,909 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 18:40:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:40:15,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:40:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:16,276 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 18:40:16,276 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 18:40:16,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 18:40:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 18:40:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 18:40:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 18:40:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 18:40:20,206 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 18:40:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:20,206 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 18:40:20,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:40:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 18:40:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:40:20,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:20,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:40:20,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:40:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 18:40:20,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:20,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471726485] [2019-12-07 18:40:20,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:20,268 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 18:40:20,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471726485] [2019-12-07 18:40:20,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:20,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:40:20,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089695489] [2019-12-07 18:40:20,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:40:20,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:20,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:40:20,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:40:20,269 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 18:40:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:21,232 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 18:40:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:40:21,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:40:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:22,132 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 18:40:22,132 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 18:40:22,132 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 18:40:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 18:40:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 18:40:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 18:40:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 18:40:28,174 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 18:40:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:28,174 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 18:40:28,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:40:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 18:40:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:40:28,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:28,184 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 18:40:28,184 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:40:28,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 18:40:28,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:28,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856515682] [2019-12-07 18:40:28,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:28,213 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 18:40:28,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856515682] [2019-12-07 18:40:28,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:28,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:40:28,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416661830] [2019-12-07 18:40:28,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:40:28,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:28,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:40:28,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:40:28,215 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 18:40:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:29,857 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 18:40:29,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:40:29,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:40:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:30,560 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 18:40:30,561 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 18:40:30,561 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 18:40:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 18:40:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 18:40:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 18:40:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 18:40:39,616 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 18:40:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:39,616 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 18:40:39,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:40:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 18:40:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:40:39,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:39,631 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] [2019-12-07 18:40:39,631 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:40:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 18:40:39,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:39,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092279504] [2019-12-07 18:40:39,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:39,692 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 18:40:39,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092279504] [2019-12-07 18:40:39,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:39,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:40:39,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740449400] [2019-12-07 18:40:39,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:40:39,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:39,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:40:39,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:40:39,693 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 18:40:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:41,257 INFO L93 Difference]: Finished difference Result 329247 states and 1365659 transitions. [2019-12-07 18:40:41,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:40:41,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:40:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:42,173 INFO L225 Difference]: With dead ends: 329247 [2019-12-07 18:40:42,174 INFO L226 Difference]: Without dead ends: 328713 [2019-12-07 18:40:42,174 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 18:40:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328713 states. [2019-12-07 18:40:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328713 to 319924. [2019-12-07 18:40:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319924 states. [2019-12-07 18:40:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319924 states to 319924 states and 1338763 transitions. [2019-12-07 18:40:54,977 INFO L78 Accepts]: Start accepts. Automaton has 319924 states and 1338763 transitions. Word has length 20 [2019-12-07 18:40:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:54,978 INFO L462 AbstractCegarLoop]: Abstraction has 319924 states and 1338763 transitions. [2019-12-07 18:40:54,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:40:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 319924 states and 1338763 transitions. [2019-12-07 18:40:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:40:54,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:54,999 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] [2019-12-07 18:40:54,999 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:40:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1767153122, now seen corresponding path program 1 times [2019-12-07 18:40:54,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:54,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170260596] [2019-12-07 18:40:54,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:55,035 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 18:40:55,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170260596] [2019-12-07 18:40:55,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:55,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:40:55,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681497339] [2019-12-07 18:40:55,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:40:55,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:40:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:40:55,036 INFO L87 Difference]: Start difference. First operand 319924 states and 1338763 transitions. Second operand 3 states. [2019-12-07 18:40:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:57,095 INFO L93 Difference]: Finished difference Result 301787 states and 1246857 transitions. [2019-12-07 18:40:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:40:57,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 18:40:57,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:57,919 INFO L225 Difference]: With dead ends: 301787 [2019-12-07 18:40:57,919 INFO L226 Difference]: Without dead ends: 301787 [2019-12-07 18:40:57,919 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 18:41:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301787 states. [2019-12-07 18:41:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301787 to 298751. [2019-12-07 18:41:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298751 states. [2019-12-07 18:41:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298751 states to 298751 states and 1235515 transitions. [2019-12-07 18:41:08,969 INFO L78 Accepts]: Start accepts. Automaton has 298751 states and 1235515 transitions. Word has length 21 [2019-12-07 18:41:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:08,969 INFO L462 AbstractCegarLoop]: Abstraction has 298751 states and 1235515 transitions. [2019-12-07 18:41:08,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 298751 states and 1235515 transitions. [2019-12-07 18:41:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:41:09,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:09,430 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] [2019-12-07 18:41:09,430 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2098797643, now seen corresponding path program 1 times [2019-12-07 18:41:09,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:09,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869336821] [2019-12-07 18:41:09,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:09,493 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 18:41:09,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869336821] [2019-12-07 18:41:09,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:09,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:09,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789806641] [2019-12-07 18:41:09,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:09,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:09,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:09,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:09,495 INFO L87 Difference]: Start difference. First operand 298751 states and 1235515 transitions. Second operand 4 states. [2019-12-07 18:41:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:10,929 INFO L93 Difference]: Finished difference Result 307285 states and 1259609 transitions. [2019-12-07 18:41:10,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:10,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:41:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:11,781 INFO L225 Difference]: With dead ends: 307285 [2019-12-07 18:41:11,781 INFO L226 Difference]: Without dead ends: 307285 [2019-12-07 18:41:11,781 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 18:41:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307285 states. [2019-12-07 18:41:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307285 to 298624. [2019-12-07 18:41:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298624 states. [2019-12-07 18:41:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298624 states to 298624 states and 1234964 transitions. [2019-12-07 18:41:23,539 INFO L78 Accepts]: Start accepts. Automaton has 298624 states and 1234964 transitions. Word has length 21 [2019-12-07 18:41:23,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:23,540 INFO L462 AbstractCegarLoop]: Abstraction has 298624 states and 1234964 transitions. [2019-12-07 18:41:23,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 298624 states and 1234964 transitions. [2019-12-07 18:41:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:41:23,557 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:23,557 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] [2019-12-07 18:41:23,557 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:23,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 18:41:23,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:23,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007197654] [2019-12-07 18:41:23,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:23,602 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 18:41:23,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007197654] [2019-12-07 18:41:23,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:23,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:23,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227358035] [2019-12-07 18:41:23,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:23,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:23,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:23,603 INFO L87 Difference]: Start difference. First operand 298624 states and 1234964 transitions. Second operand 4 states. [2019-12-07 18:41:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:26,114 INFO L93 Difference]: Finished difference Result 371271 states and 1519073 transitions. [2019-12-07 18:41:26,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:41:26,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:41:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:27,145 INFO L225 Difference]: With dead ends: 371271 [2019-12-07 18:41:27,145 INFO L226 Difference]: Without dead ends: 371203 [2019-12-07 18:41:27,145 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 18:41:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371203 states. [2019-12-07 18:41:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371203 to 303340. [2019-12-07 18:41:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303340 states. [2019-12-07 18:41:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303340 states to 303340 states and 1254094 transitions. [2019-12-07 18:41:36,172 INFO L78 Accepts]: Start accepts. Automaton has 303340 states and 1254094 transitions. Word has length 21 [2019-12-07 18:41:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:36,172 INFO L462 AbstractCegarLoop]: Abstraction has 303340 states and 1254094 transitions. [2019-12-07 18:41:36,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 303340 states and 1254094 transitions. [2019-12-07 18:41:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:41:36,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:36,191 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] [2019-12-07 18:41:36,191 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:36,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash 771337547, now seen corresponding path program 1 times [2019-12-07 18:41:36,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:36,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675384788] [2019-12-07 18:41:36,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:36,237 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 18:41:36,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675384788] [2019-12-07 18:41:36,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:36,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:36,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290778582] [2019-12-07 18:41:36,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:36,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:36,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:36,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:36,238 INFO L87 Difference]: Start difference. First operand 303340 states and 1254094 transitions. Second operand 4 states. [2019-12-07 18:41:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:38,048 INFO L93 Difference]: Finished difference Result 293865 states and 1207834 transitions. [2019-12-07 18:41:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:38,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:41:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:38,875 INFO L225 Difference]: With dead ends: 293865 [2019-12-07 18:41:38,875 INFO L226 Difference]: Without dead ends: 293865 [2019-12-07 18:41:38,876 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 18:41:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293865 states. [2019-12-07 18:41:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293865 to 224990. [2019-12-07 18:41:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224990 states. [2019-12-07 18:41:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224990 states to 224990 states and 945652 transitions. [2019-12-07 18:41:49,133 INFO L78 Accepts]: Start accepts. Automaton has 224990 states and 945652 transitions. Word has length 21 [2019-12-07 18:41:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:49,133 INFO L462 AbstractCegarLoop]: Abstraction has 224990 states and 945652 transitions. [2019-12-07 18:41:49,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 224990 states and 945652 transitions. [2019-12-07 18:41:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:41:49,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:49,165 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] [2019-12-07 18:41:49,165 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:49,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-07 18:41:49,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:49,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267303007] [2019-12-07 18:41:49,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:49,210 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 18:41:49,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267303007] [2019-12-07 18:41:49,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:49,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:49,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663320017] [2019-12-07 18:41:49,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:49,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:49,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:49,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:49,211 INFO L87 Difference]: Start difference. First operand 224990 states and 945652 transitions. Second operand 4 states. [2019-12-07 18:41:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:50,454 INFO L93 Difference]: Finished difference Result 191986 states and 745665 transitions. [2019-12-07 18:41:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:50,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 18:41:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:50,863 INFO L225 Difference]: With dead ends: 191986 [2019-12-07 18:41:50,863 INFO L226 Difference]: Without dead ends: 177736 [2019-12-07 18:41:50,864 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 18:41:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177736 states. [2019-12-07 18:41:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177736 to 177736. [2019-12-07 18:41:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177736 states. [2019-12-07 18:41:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177736 states to 177736 states and 695326 transitions. [2019-12-07 18:41:55,435 INFO L78 Accepts]: Start accepts. Automaton has 177736 states and 695326 transitions. Word has length 24 [2019-12-07 18:41:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:55,435 INFO L462 AbstractCegarLoop]: Abstraction has 177736 states and 695326 transitions. [2019-12-07 18:41:55,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 177736 states and 695326 transitions. [2019-12-07 18:41:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:41:55,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:55,458 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] [2019-12-07 18:41:55,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:55,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:55,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1761806270, now seen corresponding path program 1 times [2019-12-07 18:41:55,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:55,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41479115] [2019-12-07 18:41:55,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:55,509 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 18:41:55,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41479115] [2019-12-07 18:41:55,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:55,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:55,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502669940] [2019-12-07 18:41:55,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:55,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:55,510 INFO L87 Difference]: Start difference. First operand 177736 states and 695326 transitions. Second operand 5 states. [2019-12-07 18:41:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:57,257 INFO L93 Difference]: Finished difference Result 250954 states and 963393 transitions. [2019-12-07 18:41:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:41:57,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 18:41:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:57,897 INFO L225 Difference]: With dead ends: 250954 [2019-12-07 18:41:57,897 INFO L226 Difference]: Without dead ends: 250911 [2019-12-07 18:41:57,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:42:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250911 states. [2019-12-07 18:42:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250911 to 193095. [2019-12-07 18:42:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193095 states. [2019-12-07 18:42:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193095 states to 193095 states and 753869 transitions. [2019-12-07 18:42:03,600 INFO L78 Accepts]: Start accepts. Automaton has 193095 states and 753869 transitions. Word has length 25 [2019-12-07 18:42:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:03,600 INFO L462 AbstractCegarLoop]: Abstraction has 193095 states and 753869 transitions. [2019-12-07 18:42:03,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:42:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 193095 states and 753869 transitions. [2019-12-07 18:42:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:42:03,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:03,644 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 18:42:03,644 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:03,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1396027996, now seen corresponding path program 1 times [2019-12-07 18:42:03,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:03,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323534358] [2019-12-07 18:42:03,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:03,694 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 18:42:03,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323534358] [2019-12-07 18:42:03,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:03,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:42:03,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560978080] [2019-12-07 18:42:03,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:42:03,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:03,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:42:03,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:42:03,696 INFO L87 Difference]: Start difference. First operand 193095 states and 753869 transitions. Second operand 5 states. [2019-12-07 18:42:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:04,419 INFO L93 Difference]: Finished difference Result 97411 states and 326895 transitions. [2019-12-07 18:42:04,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:42:04,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 18:42:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:04,559 INFO L225 Difference]: With dead ends: 97411 [2019-12-07 18:42:04,559 INFO L226 Difference]: Without dead ends: 83681 [2019-12-07 18:42:04,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:42:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83681 states. [2019-12-07 18:42:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83681 to 83491. [2019-12-07 18:42:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83491 states. [2019-12-07 18:42:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83491 states to 83491 states and 276822 transitions. [2019-12-07 18:42:06,161 INFO L78 Accepts]: Start accepts. Automaton has 83491 states and 276822 transitions. Word has length 28 [2019-12-07 18:42:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:06,162 INFO L462 AbstractCegarLoop]: Abstraction has 83491 states and 276822 transitions. [2019-12-07 18:42:06,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:42:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 83491 states and 276822 transitions. [2019-12-07 18:42:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:42:06,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:06,179 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] [2019-12-07 18:42:06,180 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1458765979, now seen corresponding path program 1 times [2019-12-07 18:42:06,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:06,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058087097] [2019-12-07 18:42:06,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:06,230 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 18:42:06,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058087097] [2019-12-07 18:42:06,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:06,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:42:06,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334951567] [2019-12-07 18:42:06,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:42:06,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:06,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:42:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:42:06,232 INFO L87 Difference]: Start difference. First operand 83491 states and 276822 transitions. Second operand 5 states. [2019-12-07 18:42:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:07,993 INFO L93 Difference]: Finished difference Result 108407 states and 352262 transitions. [2019-12-07 18:42:07,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:42:07,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 18:42:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:08,173 INFO L225 Difference]: With dead ends: 108407 [2019-12-07 18:42:08,174 INFO L226 Difference]: Without dead ends: 108377 [2019-12-07 18:42:08,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:42:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108377 states. [2019-12-07 18:42:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108377 to 77479. [2019-12-07 18:42:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77479 states. [2019-12-07 18:42:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77479 states to 77479 states and 256843 transitions. [2019-12-07 18:42:09,979 INFO L78 Accepts]: Start accepts. Automaton has 77479 states and 256843 transitions. Word has length 29 [2019-12-07 18:42:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:09,979 INFO L462 AbstractCegarLoop]: Abstraction has 77479 states and 256843 transitions. [2019-12-07 18:42:09,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:42:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 77479 states and 256843 transitions. [2019-12-07 18:42:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:42:10,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:10,024 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] [2019-12-07 18:42:10,024 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:10,024 INFO L82 PathProgramCache]: Analyzing trace with hash -506640382, now seen corresponding path program 1 times [2019-12-07 18:42:10,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:10,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293534626] [2019-12-07 18:42:10,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:10,077 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 18:42:10,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293534626] [2019-12-07 18:42:10,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:10,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:42:10,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642644297] [2019-12-07 18:42:10,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:42:10,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:10,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:42:10,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:42:10,079 INFO L87 Difference]: Start difference. First operand 77479 states and 256843 transitions. Second operand 4 states. [2019-12-07 18:42:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:10,637 INFO L93 Difference]: Finished difference Result 130662 states and 431470 transitions. [2019-12-07 18:42:10,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:42:10,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 18:42:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:10,739 INFO L225 Difference]: With dead ends: 130662 [2019-12-07 18:42:10,739 INFO L226 Difference]: Without dead ends: 64736 [2019-12-07 18:42:10,739 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 18:42:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64736 states. [2019-12-07 18:42:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64736 to 64474. [2019-12-07 18:42:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64474 states. [2019-12-07 18:42:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64474 states to 64474 states and 206891 transitions. [2019-12-07 18:42:12,011 INFO L78 Accepts]: Start accepts. Automaton has 64474 states and 206891 transitions. Word has length 37 [2019-12-07 18:42:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:12,011 INFO L462 AbstractCegarLoop]: Abstraction has 64474 states and 206891 transitions. [2019-12-07 18:42:12,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:42:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 64474 states and 206891 transitions. [2019-12-07 18:42:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:42:12,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:12,052 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] [2019-12-07 18:42:12,052 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1068803170, now seen corresponding path program 1 times [2019-12-07 18:42:12,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:12,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527823464] [2019-12-07 18:42:12,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:12,140 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 18:42:12,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527823464] [2019-12-07 18:42:12,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:12,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:42:12,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044715957] [2019-12-07 18:42:12,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:42:12,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:12,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:42:12,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:42:12,141 INFO L87 Difference]: Start difference. First operand 64474 states and 206891 transitions. Second operand 8 states. [2019-12-07 18:42:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:12,986 INFO L93 Difference]: Finished difference Result 119337 states and 387204 transitions. [2019-12-07 18:42:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 18:42:12,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-07 18:42:12,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:13,191 INFO L225 Difference]: With dead ends: 119337 [2019-12-07 18:42:13,191 INFO L226 Difference]: Without dead ends: 119337 [2019-12-07 18:42:13,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:42:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119337 states. [2019-12-07 18:42:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119337 to 100461. [2019-12-07 18:42:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100461 states. [2019-12-07 18:42:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100461 states to 100461 states and 327572 transitions. [2019-12-07 18:42:15,467 INFO L78 Accepts]: Start accepts. Automaton has 100461 states and 327572 transitions. Word has length 38 [2019-12-07 18:42:15,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:15,467 INFO L462 AbstractCegarLoop]: Abstraction has 100461 states and 327572 transitions. [2019-12-07 18:42:15,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:42:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 100461 states and 327572 transitions. [2019-12-07 18:42:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:42:15,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:15,545 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] [2019-12-07 18:42:15,546 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:15,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash 40188854, now seen corresponding path program 2 times [2019-12-07 18:42:15,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:15,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462454978] [2019-12-07 18:42:15,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:15,609 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 18:42:15,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462454978] [2019-12-07 18:42:15,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:15,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:42:15,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953234977] [2019-12-07 18:42:15,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:42:15,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:42:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:42:15,610 INFO L87 Difference]: Start difference. First operand 100461 states and 327572 transitions. Second operand 8 states. [2019-12-07 18:42:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:16,575 INFO L93 Difference]: Finished difference Result 178697 states and 580448 transitions. [2019-12-07 18:42:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:42:16,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-07 18:42:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:16,832 INFO L225 Difference]: With dead ends: 178697 [2019-12-07 18:42:16,832 INFO L226 Difference]: Without dead ends: 146406 [2019-12-07 18:42:16,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:42:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146406 states. [2019-12-07 18:42:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146406 to 115086. [2019-12-07 18:42:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115086 states. [2019-12-07 18:42:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115086 states to 115086 states and 376124 transitions. [2019-12-07 18:42:19,618 INFO L78 Accepts]: Start accepts. Automaton has 115086 states and 376124 transitions. Word has length 38 [2019-12-07 18:42:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:19,618 INFO L462 AbstractCegarLoop]: Abstraction has 115086 states and 376124 transitions. [2019-12-07 18:42:19,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:42:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 115086 states and 376124 transitions. [2019-12-07 18:42:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:42:19,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:19,711 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] [2019-12-07 18:42:19,711 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:19,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1474008868, now seen corresponding path program 3 times [2019-12-07 18:42:19,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:19,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129046839] [2019-12-07 18:42:19,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:19,796 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 18:42:19,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129046839] [2019-12-07 18:42:19,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:19,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:42:19,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298355652] [2019-12-07 18:42:19,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:42:19,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:42:19,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:42:19,797 INFO L87 Difference]: Start difference. First operand 115086 states and 376124 transitions. Second operand 10 states. [2019-12-07 18:42:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:20,891 INFO L93 Difference]: Finished difference Result 188245 states and 618167 transitions. [2019-12-07 18:42:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:42:20,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-07 18:42:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:21,210 INFO L225 Difference]: With dead ends: 188245 [2019-12-07 18:42:21,210 INFO L226 Difference]: Without dead ends: 179381 [2019-12-07 18:42:21,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:42:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179381 states. [2019-12-07 18:42:24,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179381 to 111094. [2019-12-07 18:42:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111094 states. [2019-12-07 18:42:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111094 states to 111094 states and 362226 transitions. [2019-12-07 18:42:24,253 INFO L78 Accepts]: Start accepts. Automaton has 111094 states and 362226 transitions. Word has length 38 [2019-12-07 18:42:24,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:24,254 INFO L462 AbstractCegarLoop]: Abstraction has 111094 states and 362226 transitions. [2019-12-07 18:42:24,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:42:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 111094 states and 362226 transitions. [2019-12-07 18:42:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:42:24,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:24,346 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] [2019-12-07 18:42:24,346 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 198649775, now seen corresponding path program 1 times [2019-12-07 18:42:24,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:24,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849271719] [2019-12-07 18:42:24,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:24,398 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 18:42:24,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849271719] [2019-12-07 18:42:24,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:24,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:42:24,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215709536] [2019-12-07 18:42:24,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:42:24,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:42:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:42:24,399 INFO L87 Difference]: Start difference. First operand 111094 states and 362226 transitions. Second operand 6 states. [2019-12-07 18:42:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:24,529 INFO L93 Difference]: Finished difference Result 27703 states and 81777 transitions. [2019-12-07 18:42:24,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:42:24,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 18:42:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:24,555 INFO L225 Difference]: With dead ends: 27703 [2019-12-07 18:42:24,556 INFO L226 Difference]: Without dead ends: 22113 [2019-12-07 18:42:24,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:42:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22113 states. [2019-12-07 18:42:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22113 to 20915. [2019-12-07 18:42:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20915 states. [2019-12-07 18:42:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20915 states to 20915 states and 59775 transitions. [2019-12-07 18:42:24,819 INFO L78 Accepts]: Start accepts. Automaton has 20915 states and 59775 transitions. Word has length 39 [2019-12-07 18:42:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:24,819 INFO L462 AbstractCegarLoop]: Abstraction has 20915 states and 59775 transitions. [2019-12-07 18:42:24,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:42:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 20915 states and 59775 transitions. [2019-12-07 18:42:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:42:24,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:24,840 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:42:24,840 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1535210011, now seen corresponding path program 1 times [2019-12-07 18:42:24,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:24,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100745316] [2019-12-07 18:42:24,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:24,879 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 18:42:24,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100745316] [2019-12-07 18:42:24,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:24,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:42:24,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528302147] [2019-12-07 18:42:24,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:42:24,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:24,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:42:24,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:42:24,881 INFO L87 Difference]: Start difference. First operand 20915 states and 59775 transitions. Second operand 4 states. [2019-12-07 18:42:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:24,964 INFO L93 Difference]: Finished difference Result 23389 states and 65345 transitions. [2019-12-07 18:42:24,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:42:24,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 18:42:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:24,983 INFO L225 Difference]: With dead ends: 23389 [2019-12-07 18:42:24,983 INFO L226 Difference]: Without dead ends: 16833 [2019-12-07 18:42:24,983 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 18:42:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16833 states. [2019-12-07 18:42:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16833 to 16813. [2019-12-07 18:42:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16813 states. [2019-12-07 18:42:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16813 states to 16813 states and 45855 transitions. [2019-12-07 18:42:25,218 INFO L78 Accepts]: Start accepts. Automaton has 16813 states and 45855 transitions. Word has length 50 [2019-12-07 18:42:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:25,219 INFO L462 AbstractCegarLoop]: Abstraction has 16813 states and 45855 transitions. [2019-12-07 18:42:25,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:42:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16813 states and 45855 transitions. [2019-12-07 18:42:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:42:25,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:25,232 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:42:25,232 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash 775370005, now seen corresponding path program 2 times [2019-12-07 18:42:25,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:25,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931237711] [2019-12-07 18:42:25,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:25,264 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 18:42:25,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931237711] [2019-12-07 18:42:25,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:25,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:42:25,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334562034] [2019-12-07 18:42:25,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:42:25,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:25,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:42:25,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:42:25,266 INFO L87 Difference]: Start difference. First operand 16813 states and 45855 transitions. Second operand 4 states. [2019-12-07 18:42:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:25,326 INFO L93 Difference]: Finished difference Result 22893 states and 60243 transitions. [2019-12-07 18:42:25,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:42:25,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 18:42:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:25,341 INFO L225 Difference]: With dead ends: 22893 [2019-12-07 18:42:25,341 INFO L226 Difference]: Without dead ends: 16174 [2019-12-07 18:42:25,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:42:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16174 states. [2019-12-07 18:42:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16174 to 16045. [2019-12-07 18:42:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16045 states. [2019-12-07 18:42:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16045 states to 16045 states and 39513 transitions. [2019-12-07 18:42:25,521 INFO L78 Accepts]: Start accepts. Automaton has 16045 states and 39513 transitions. Word has length 50 [2019-12-07 18:42:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:25,521 INFO L462 AbstractCegarLoop]: Abstraction has 16045 states and 39513 transitions. [2019-12-07 18:42:25,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:42:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 16045 states and 39513 transitions. [2019-12-07 18:42:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:42:25,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:25,534 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:42:25,534 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash -133447137, now seen corresponding path program 3 times [2019-12-07 18:42:25,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:25,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900392453] [2019-12-07 18:42:25,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:25,588 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 18:42:25,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900392453] [2019-12-07 18:42:25,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:25,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:42:25,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348071552] [2019-12-07 18:42:25,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:42:25,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:42:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:42:25,589 INFO L87 Difference]: Start difference. First operand 16045 states and 39513 transitions. Second operand 7 states. [2019-12-07 18:42:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:25,674 INFO L93 Difference]: Finished difference Result 14356 states and 35745 transitions. [2019-12-07 18:42:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:42:25,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 18:42:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:25,675 INFO L225 Difference]: With dead ends: 14356 [2019-12-07 18:42:25,675 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 18:42:25,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:42:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 18:42:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 18:42:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 18:42:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 18:42:25,680 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 50 [2019-12-07 18:42:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:25,680 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 18:42:25,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:42:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 18:42:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:42:25,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:25,681 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, 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 18:42:25,681 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:25,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:25,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 1 times [2019-12-07 18:42:25,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:25,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113613177] [2019-12-07 18:42:25,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:25,742 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 18:42:25,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113613177] [2019-12-07 18:42:25,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:25,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:42:25,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031073711] [2019-12-07 18:42:25,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:42:25,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:42:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:42:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:42:25,743 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 7 states. [2019-12-07 18:42:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:25,903 INFO L93 Difference]: Finished difference Result 1169 states and 2456 transitions. [2019-12-07 18:42:25,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:42:25,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 18:42:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:25,905 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 18:42:25,905 INFO L226 Difference]: Without dead ends: 854 [2019-12-07 18:42:25,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:42:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-12-07 18:42:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 638. [2019-12-07 18:42:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-07 18:42:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1324 transitions. [2019-12-07 18:42:25,911 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1324 transitions. Word has length 66 [2019-12-07 18:42:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:25,911 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1324 transitions. [2019-12-07 18:42:25,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:42:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1324 transitions. [2019-12-07 18:42:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:42:25,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:25,912 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, 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 18:42:25,912 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 2 times [2019-12-07 18:42:25,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:42:25,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543515211] [2019-12-07 18:42:25,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:42:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:42:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:42:25,994 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:42:25,994 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:42:25,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= v_~z$r_buff0_thd2~0_131 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t533~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t533~0.base_34|) |v_ULTIMATE.start_main_~#t533~0.offset_23| 0)) |v_#memory_int_25|) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t533~0.base_34| 4)) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= |v_ULTIMATE.start_main_~#t533~0.offset_23| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t533~0.base_34|) 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t533~0.base_34|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t533~0.base_34| 1)) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t534~0.offset=|v_ULTIMATE.start_main_~#t534~0.offset_24|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ULTIMATE.start_main_~#t534~0.base=|v_ULTIMATE.start_main_~#t534~0.base_36|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ULTIMATE.start_main_~#t536~0.offset=|v_ULTIMATE.start_main_~#t536~0.offset_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t533~0.base=|v_ULTIMATE.start_main_~#t533~0.base_34|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t535~0.offset=|v_ULTIMATE.start_main_~#t535~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t535~0.base=|v_ULTIMATE.start_main_~#t535~0.base_28|, ULTIMATE.start_main_~#t533~0.offset=|v_ULTIMATE.start_main_~#t533~0.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t536~0.base=|v_ULTIMATE.start_main_~#t536~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t534~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t534~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t536~0.offset, ~z$flush_delayed~0, ULTIMATE.start_main_~#t533~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t535~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t535~0.base, ULTIMATE.start_main_~#t533~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t536~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:42:25,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t534~0.base_11|) 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t534~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t534~0.base_11|) |v_ULTIMATE.start_main_~#t534~0.offset_10| 1)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t534~0.offset_10| 0) (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t534~0.base_11| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t534~0.base_11| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t534~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t534~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t534~0.offset=|v_ULTIMATE.start_main_~#t534~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t534~0.base=|v_ULTIMATE.start_main_~#t534~0.base_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t534~0.offset, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t534~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 18:42:25,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t535~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t535~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t535~0.base_11|) |v_ULTIMATE.start_main_~#t535~0.offset_11| 2))) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t535~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t535~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t535~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t535~0.base_11|)) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t535~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t535~0.offset=|v_ULTIMATE.start_main_~#t535~0.offset_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t535~0.base=|v_ULTIMATE.start_main_~#t535~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t535~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t535~0.base] because there is no mapped edge [2019-12-07 18:42:25,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t536~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t536~0.base_9|) |v_ULTIMATE.start_main_~#t536~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t536~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t536~0.base_9| 0)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t536~0.base_9|) 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t536~0.base_9| 1) |v_#valid_35|) (= 0 |v_ULTIMATE.start_main_~#t536~0.offset_8|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t536~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t536~0.base=|v_ULTIMATE.start_main_~#t536~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t536~0.offset=|v_ULTIMATE.start_main_~#t536~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t536~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t536~0.offset, #length] because there is no mapped edge [2019-12-07 18:42:25,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff0_thd4~0_In-1553338854 ~z$r_buff1_thd4~0_Out-1553338854) (= ~z$r_buff0_thd0~0_In-1553338854 ~z$r_buff1_thd0~0_Out-1553338854) (= ~z$r_buff1_thd2~0_Out-1553338854 ~z$r_buff0_thd2~0_In-1553338854) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1553338854)) (= ~z$r_buff0_thd1~0_In-1553338854 ~z$r_buff1_thd1~0_Out-1553338854) (= ~weak$$choice0~0_Out-1553338854 |P3Thread1of1ForFork2_#t~nondet26_In-1553338854|) (= ~z$r_buff1_thd3~0_Out-1553338854 ~z$r_buff0_thd3~0_In-1553338854) (= ~weak$$choice2~0_Out-1553338854 ~z$flush_delayed~0_Out-1553338854) (= |P3Thread1of1ForFork2_#t~nondet27_In-1553338854| ~weak$$choice2~0_Out-1553338854) (= ~z~0_In-1553338854 ~z$mem_tmp~0_Out-1553338854) (= 1 ~z$r_buff0_thd4~0_Out-1553338854)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-1553338854|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-1553338854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1553338854, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1553338854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1553338854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1553338854, ~z~0=~z~0_In-1553338854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1553338854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1553338854} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-1553338854|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-1553338854, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-1553338854|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1553338854, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1553338854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1553338854, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1553338854, ~z$flush_delayed~0=~z$flush_delayed~0_Out-1553338854, ~weak$$choice0~0=~weak$$choice0~0_Out-1553338854, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1553338854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1553338854, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1553338854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1553338854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1553338854, ~z~0=~z~0_In-1553338854, ~weak$$choice2~0=~weak$$choice2~0_Out-1553338854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1553338854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1553338854} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 18:42:26,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1785998514 256))) (.cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out1785998514| |P3Thread1of1ForFork2_#t~ite29_Out1785998514|)) (.cse0 (= (mod ~z$w_buff0_used~0_In1785998514 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out1785998514| ~z$w_buff1~0_In1785998514) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out1785998514| ~z$w_buff0~0_In1785998514) (not .cse1) .cse2 (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1785998514, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1785998514, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1785998514, ~z$w_buff1~0=~z$w_buff1~0_In1785998514} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1785998514|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1785998514|, ~z$w_buff0~0=~z$w_buff0~0_In1785998514, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1785998514, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1785998514, ~z$w_buff1~0=~z$w_buff1~0_In1785998514} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:42:26,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:42:26,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1631902718 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-1631902718| ~z$mem_tmp~0_In-1631902718)) (and (= ~z~0_In-1631902718 |P3Thread1of1ForFork2_#t~ite48_Out-1631902718|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1631902718, ~z$flush_delayed~0=~z$flush_delayed~0_In-1631902718, ~z~0=~z~0_In-1631902718} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1631902718, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1631902718|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1631902718, ~z~0=~z~0_In-1631902718} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:42:26,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 18:42:26,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:42:26,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In554878502 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In554878502 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out554878502| ~z$w_buff0_used~0_In554878502)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out554878502| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In554878502, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In554878502} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out554878502|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In554878502, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In554878502} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:42:26,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-81942248 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-81942248| ~z~0_In-81942248) .cse0) (and (= ~z$mem_tmp~0_In-81942248 |P2Thread1of1ForFork1_#t~ite25_Out-81942248|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-81942248, ~z$flush_delayed~0=~z$flush_delayed~0_In-81942248, ~z~0=~z~0_In-81942248} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-81942248, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-81942248|, ~z$flush_delayed~0=~z$flush_delayed~0_In-81942248, ~z~0=~z~0_In-81942248} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:42:26,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In873880831 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In873880831 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In873880831 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In873880831 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out873880831| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In873880831 |P3Thread1of1ForFork2_#t~ite52_Out873880831|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In873880831, ~z$w_buff0_used~0=~z$w_buff0_used~0_In873880831, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In873880831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In873880831} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out873880831|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In873880831, ~z$w_buff0_used~0=~z$w_buff0_used~0_In873880831, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In873880831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In873880831} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:42:26,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In673886822 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In673886822 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_In673886822 ~z$r_buff0_thd4~0_Out673886822))) (or (and (= 0 ~z$r_buff0_thd4~0_Out673886822) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In673886822, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In673886822} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out673886822|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In673886822, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out673886822} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:42:26,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In748944984 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In748944984 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In748944984 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In748944984 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out748944984| ~z$r_buff1_thd4~0_In748944984) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out748944984| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In748944984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In748944984, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In748944984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In748944984} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out748944984|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In748944984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In748944984, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In748944984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In748944984} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:42:26,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:42:26,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:42:26,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:42:26,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1515818523 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1515818523 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1515818523 |ULTIMATE.start_main_#t~ite59_Out1515818523|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1515818523| ~z~0_In1515818523)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1515818523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515818523, ~z$w_buff1~0=~z$w_buff1~0_In1515818523, ~z~0=~z~0_In1515818523} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1515818523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515818523, ~z$w_buff1~0=~z$w_buff1~0_In1515818523, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1515818523|, ~z~0=~z~0_In1515818523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:42:26,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 18:42:26,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1310996681 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1310996681 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1310996681| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1310996681| ~z$w_buff0_used~0_In-1310996681)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1310996681, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1310996681} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1310996681, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1310996681|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1310996681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:42:26,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In378680598 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In378680598 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In378680598 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In378680598 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out378680598| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out378680598| ~z$w_buff1_used~0_In378680598) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In378680598, ~z$w_buff0_used~0=~z$w_buff0_used~0_In378680598, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In378680598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In378680598} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out378680598|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In378680598, ~z$w_buff0_used~0=~z$w_buff0_used~0_In378680598, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In378680598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In378680598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:42:26,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In28775221 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In28775221 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out28775221| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In28775221 |ULTIMATE.start_main_#t~ite63_Out28775221|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In28775221, ~z$w_buff0_used~0=~z$w_buff0_used~0_In28775221} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out28775221|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In28775221, ~z$w_buff0_used~0=~z$w_buff0_used~0_In28775221} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:42:26,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1385311280 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1385311280 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1385311280 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1385311280 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite64_Out-1385311280| ~z$r_buff1_thd0~0_In-1385311280) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-1385311280|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1385311280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1385311280, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1385311280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1385311280} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1385311280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1385311280, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1385311280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1385311280, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1385311280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:42:26,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:42:26,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:42:26 BasicIcfg [2019-12-07 18:42:26,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:42:26,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:42:26,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:42:26,068 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:42:26,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:39:56" (3/4) ... [2019-12-07 18:42:26,069 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:42:26,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= v_~z$r_buff0_thd2~0_131 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t533~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t533~0.base_34|) |v_ULTIMATE.start_main_~#t533~0.offset_23| 0)) |v_#memory_int_25|) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t533~0.base_34| 4)) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= |v_ULTIMATE.start_main_~#t533~0.offset_23| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t533~0.base_34|) 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t533~0.base_34|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t533~0.base_34| 1)) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t534~0.offset=|v_ULTIMATE.start_main_~#t534~0.offset_24|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ULTIMATE.start_main_~#t534~0.base=|v_ULTIMATE.start_main_~#t534~0.base_36|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ULTIMATE.start_main_~#t536~0.offset=|v_ULTIMATE.start_main_~#t536~0.offset_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t533~0.base=|v_ULTIMATE.start_main_~#t533~0.base_34|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t535~0.offset=|v_ULTIMATE.start_main_~#t535~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t535~0.base=|v_ULTIMATE.start_main_~#t535~0.base_28|, ULTIMATE.start_main_~#t533~0.offset=|v_ULTIMATE.start_main_~#t533~0.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t536~0.base=|v_ULTIMATE.start_main_~#t536~0.base_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t534~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t534~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t536~0.offset, ~z$flush_delayed~0, ULTIMATE.start_main_~#t533~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t535~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t535~0.base, ULTIMATE.start_main_~#t533~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t536~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:42:26,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t534~0.base_11|) 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t534~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t534~0.base_11|) |v_ULTIMATE.start_main_~#t534~0.offset_10| 1)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t534~0.offset_10| 0) (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t534~0.base_11| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t534~0.base_11| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t534~0.base_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t534~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t534~0.offset=|v_ULTIMATE.start_main_~#t534~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, ULTIMATE.start_main_~#t534~0.base=|v_ULTIMATE.start_main_~#t534~0.base_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t534~0.offset, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t534~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 18:42:26,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t535~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t535~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t535~0.base_11|) |v_ULTIMATE.start_main_~#t535~0.offset_11| 2))) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t535~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t535~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t535~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t535~0.base_11|)) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t535~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t535~0.offset=|v_ULTIMATE.start_main_~#t535~0.offset_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_~#t535~0.base=|v_ULTIMATE.start_main_~#t535~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t535~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t535~0.base] because there is no mapped edge [2019-12-07 18:42:26,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t536~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t536~0.base_9|) |v_ULTIMATE.start_main_~#t536~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t536~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t536~0.base_9| 0)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t536~0.base_9|) 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t536~0.base_9| 1) |v_#valid_35|) (= 0 |v_ULTIMATE.start_main_~#t536~0.offset_8|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t536~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t536~0.base=|v_ULTIMATE.start_main_~#t536~0.base_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t536~0.offset=|v_ULTIMATE.start_main_~#t536~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t536~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t536~0.offset, #length] because there is no mapped edge [2019-12-07 18:42:26,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff0_thd4~0_In-1553338854 ~z$r_buff1_thd4~0_Out-1553338854) (= ~z$r_buff0_thd0~0_In-1553338854 ~z$r_buff1_thd0~0_Out-1553338854) (= ~z$r_buff1_thd2~0_Out-1553338854 ~z$r_buff0_thd2~0_In-1553338854) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1553338854)) (= ~z$r_buff0_thd1~0_In-1553338854 ~z$r_buff1_thd1~0_Out-1553338854) (= ~weak$$choice0~0_Out-1553338854 |P3Thread1of1ForFork2_#t~nondet26_In-1553338854|) (= ~z$r_buff1_thd3~0_Out-1553338854 ~z$r_buff0_thd3~0_In-1553338854) (= ~weak$$choice2~0_Out-1553338854 ~z$flush_delayed~0_Out-1553338854) (= |P3Thread1of1ForFork2_#t~nondet27_In-1553338854| ~weak$$choice2~0_Out-1553338854) (= ~z~0_In-1553338854 ~z$mem_tmp~0_Out-1553338854) (= 1 ~z$r_buff0_thd4~0_Out-1553338854)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-1553338854|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-1553338854|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1553338854, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1553338854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1553338854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1553338854, ~z~0=~z~0_In-1553338854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1553338854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1553338854} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-1553338854|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-1553338854, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-1553338854|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1553338854, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1553338854, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1553338854, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1553338854, ~z$flush_delayed~0=~z$flush_delayed~0_Out-1553338854, ~weak$$choice0~0=~weak$$choice0~0_Out-1553338854, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1553338854, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1553338854, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1553338854, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1553338854, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1553338854, ~z~0=~z~0_In-1553338854, ~weak$$choice2~0=~weak$$choice2~0_Out-1553338854, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1553338854, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1553338854} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 18:42:26,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1785998514 256))) (.cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out1785998514| |P3Thread1of1ForFork2_#t~ite29_Out1785998514|)) (.cse0 (= (mod ~z$w_buff0_used~0_In1785998514 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out1785998514| ~z$w_buff1~0_In1785998514) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out1785998514| ~z$w_buff0~0_In1785998514) (not .cse1) .cse2 (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1785998514, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1785998514, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1785998514, ~z$w_buff1~0=~z$w_buff1~0_In1785998514} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1785998514|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1785998514|, ~z$w_buff0~0=~z$w_buff0~0_In1785998514, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1785998514, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1785998514, ~z$w_buff1~0=~z$w_buff1~0_In1785998514} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:42:26,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:42:26,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1631902718 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-1631902718| ~z$mem_tmp~0_In-1631902718)) (and (= ~z~0_In-1631902718 |P3Thread1of1ForFork2_#t~ite48_Out-1631902718|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1631902718, ~z$flush_delayed~0=~z$flush_delayed~0_In-1631902718, ~z~0=~z~0_In-1631902718} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1631902718, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1631902718|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1631902718, ~z~0=~z~0_In-1631902718} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:42:26,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 18:42:26,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:42:26,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In554878502 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In554878502 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out554878502| ~z$w_buff0_used~0_In554878502)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out554878502| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In554878502, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In554878502} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out554878502|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In554878502, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In554878502} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:42:26,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-81942248 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-81942248| ~z~0_In-81942248) .cse0) (and (= ~z$mem_tmp~0_In-81942248 |P2Thread1of1ForFork1_#t~ite25_Out-81942248|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-81942248, ~z$flush_delayed~0=~z$flush_delayed~0_In-81942248, ~z~0=~z~0_In-81942248} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-81942248, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-81942248|, ~z$flush_delayed~0=~z$flush_delayed~0_In-81942248, ~z~0=~z~0_In-81942248} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:42:26,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In873880831 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In873880831 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In873880831 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In873880831 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out873880831| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In873880831 |P3Thread1of1ForFork2_#t~ite52_Out873880831|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In873880831, ~z$w_buff0_used~0=~z$w_buff0_used~0_In873880831, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In873880831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In873880831} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out873880831|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In873880831, ~z$w_buff0_used~0=~z$w_buff0_used~0_In873880831, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In873880831, ~z$w_buff1_used~0=~z$w_buff1_used~0_In873880831} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:42:26,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In673886822 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In673886822 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_In673886822 ~z$r_buff0_thd4~0_Out673886822))) (or (and (= 0 ~z$r_buff0_thd4~0_Out673886822) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In673886822, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In673886822} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out673886822|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In673886822, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out673886822} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:42:26,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In748944984 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In748944984 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In748944984 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In748944984 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out748944984| ~z$r_buff1_thd4~0_In748944984) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out748944984| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In748944984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In748944984, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In748944984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In748944984} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out748944984|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In748944984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In748944984, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In748944984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In748944984} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:42:26,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:42:26,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:42:26,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:42:26,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1515818523 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1515818523 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1515818523 |ULTIMATE.start_main_#t~ite59_Out1515818523|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1515818523| ~z~0_In1515818523)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1515818523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515818523, ~z$w_buff1~0=~z$w_buff1~0_In1515818523, ~z~0=~z~0_In1515818523} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1515818523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515818523, ~z$w_buff1~0=~z$w_buff1~0_In1515818523, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1515818523|, ~z~0=~z~0_In1515818523} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:42:26,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 18:42:26,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1310996681 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1310996681 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1310996681| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1310996681| ~z$w_buff0_used~0_In-1310996681)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1310996681, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1310996681} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1310996681, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1310996681|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1310996681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:42:26,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In378680598 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In378680598 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In378680598 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In378680598 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out378680598| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out378680598| ~z$w_buff1_used~0_In378680598) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In378680598, ~z$w_buff0_used~0=~z$w_buff0_used~0_In378680598, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In378680598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In378680598} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out378680598|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In378680598, ~z$w_buff0_used~0=~z$w_buff0_used~0_In378680598, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In378680598, ~z$w_buff1_used~0=~z$w_buff1_used~0_In378680598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:42:26,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In28775221 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In28775221 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out28775221| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In28775221 |ULTIMATE.start_main_#t~ite63_Out28775221|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In28775221, ~z$w_buff0_used~0=~z$w_buff0_used~0_In28775221} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out28775221|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In28775221, ~z$w_buff0_used~0=~z$w_buff0_used~0_In28775221} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:42:26,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1385311280 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1385311280 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1385311280 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1385311280 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite64_Out-1385311280| ~z$r_buff1_thd0~0_In-1385311280) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-1385311280|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1385311280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1385311280, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1385311280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1385311280} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1385311280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1385311280, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1385311280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1385311280, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1385311280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:42:26,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:42:26,144 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bcb0e33f-fd13-4cd9-aad1-7c5ca6a464d1/bin/uautomizer/witness.graphml [2019-12-07 18:42:26,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:42:26,145 INFO L168 Benchmark]: Toolchain (without parser) took 150851.94 ms. Allocated memory was 1.0 GB in the beginning and 7.9 GB in the end (delta: 6.9 GB). Free memory was 940.6 MB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 18:42:26,145 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:42:26,145 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -104.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:26,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:26,146 INFO L168 Benchmark]: Boogie Preprocessor took 28.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:26,146 INFO L168 Benchmark]: RCFGBuilder took 456.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 974.3 MB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:26,146 INFO L168 Benchmark]: TraceAbstraction took 149854.55 ms. Allocated memory was 1.1 GB in the beginning and 7.9 GB in the end (delta: 6.8 GB). Free memory was 974.3 MB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 18:42:26,147 INFO L168 Benchmark]: Witness Printer took 76.30 ms. Allocated memory is still 7.9 GB. Free memory was 6.6 GB in the beginning and 6.6 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:26,148 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -104.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 456.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 974.3 MB in the end (delta: 64.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149854.55 ms. Allocated memory was 1.1 GB in the beginning and 7.9 GB in the end (delta: 6.8 GB). Free memory was 974.3 MB in the beginning and 6.6 GB in the end (delta: -5.6 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 76.30 ms. Allocated memory is still 7.9 GB. Free memory was 6.6 GB in the beginning and 6.6 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11182 VarBasedMoverChecksPositive, 338 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 381 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t533, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t534, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t535, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t536, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=0, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 149.6s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 33.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5590 SDtfs, 7765 SDslu, 11759 SDs, 0 SdLazy, 3066 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319924occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 100.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 411296 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 743 NumberOfCodeBlocks, 743 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 128663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...