./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_tso.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_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/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 62c0dd59c00b45603da82019c180716ac53b1b47 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:25:53,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:25:53,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:25:53,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:25:53,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:25:53,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:25:53,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:25:53,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:25:53,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:25:53,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:25:53,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:25:53,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:25:53,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:25:53,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:25:53,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:25:53,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:25:53,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:25:53,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:25:53,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:25:53,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:25:53,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:25:53,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:25:53,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:25:53,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:25:53,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:25:53,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:25:53,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:25:53,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:25:53,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:25:53,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:25:53,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:25:53,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:25:53,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:25:53,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:25:53,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:25:53,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:25:53,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:25:53,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:25:53,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:25:53,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:25:53,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:25:53,558 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:25:53,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:25:53,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:25:53,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:25:53,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:25:53,568 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:25:53,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:25:53,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:25:53,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:25:53,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:25:53,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:25:53,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:25:53,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:25:53,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:25:53,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:25:53,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:25:53,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:25:53,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:25:53,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:25:53,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:25:53,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:25:53,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:25:53,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:25:53,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:25:53,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:25:53,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:25:53,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:25:53,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:25:53,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:25:53,571 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:25:53,571 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_daefe951-2179-4763-a5ab-39e6d68a8784/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 -> 62c0dd59c00b45603da82019c180716ac53b1b47 [2019-12-07 14:25:53,672 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:25:53,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:25:53,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:25:53,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:25:53,685 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:25:53,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_tso.opt.i [2019-12-07 14:25:53,732 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/data/8f4d17171/84a0598d57cc4d4288c6a13ad9b3bd3c/FLAGb933c030b [2019-12-07 14:25:54,185 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:25:54,186 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/sv-benchmarks/c/pthread-wmm/mix022_tso.opt.i [2019-12-07 14:25:54,195 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/data/8f4d17171/84a0598d57cc4d4288c6a13ad9b3bd3c/FLAGb933c030b [2019-12-07 14:25:54,205 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/data/8f4d17171/84a0598d57cc4d4288c6a13ad9b3bd3c [2019-12-07 14:25:54,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:25:54,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:25:54,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:25:54,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:25:54,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:25:54,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184d1a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54, skipping insertion in model container [2019-12-07 14:25:54,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:25:54,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:25:54,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:25:54,522 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:25:54,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:25:54,616 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:25:54,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54 WrapperNode [2019-12-07 14:25:54,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:25:54,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:25:54,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:25:54,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:25:54,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:25:54,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:25:54,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:25:54,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:25:54,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... [2019-12-07 14:25:54,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:25:54,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:25:54,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:25:54,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:25:54,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/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 14:25:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:25:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:25:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:25:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:25:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:25:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:25:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:25:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:25:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:25:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:25:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:25:54,735 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 14:25:55,139 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:25:55,140 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:25:55,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:55 BoogieIcfgContainer [2019-12-07 14:25:55,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:25:55,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:25:55,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:25:55,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:25:55,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:25:54" (1/3) ... [2019-12-07 14:25:55,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756b8592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:25:55, skipping insertion in model container [2019-12-07 14:25:55,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:25:54" (2/3) ... [2019-12-07 14:25:55,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756b8592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:25:55, skipping insertion in model container [2019-12-07 14:25:55,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:55" (3/3) ... [2019-12-07 14:25:55,147 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.opt.i [2019-12-07 14:25:55,155 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:25:55,155 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:25:55,161 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:25:55,162 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:25:55,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,189 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,191 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,192 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,194 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:25:55,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:25:55,231 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:25:55,231 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:25:55,232 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:25:55,232 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:25:55,232 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:25:55,232 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:25:55,232 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:25:55,232 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:25:55,243 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-07 14:25:55,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-07 14:25:55,305 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-07 14:25:55,305 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:25:55,318 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 868 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 14:25:55,339 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-07 14:25:55,375 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-07 14:25:55,375 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:25:55,384 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 868 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 14:25:55,407 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-07 14:25:55,408 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:25:58,503 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 14:25:58,595 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142941 [2019-12-07 14:25:58,596 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-07 14:25:58,598 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-07 14:25:59,867 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-07 14:25:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-07 14:25:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:25:59,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:59,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:25:59,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:59,877 INFO L82 PathProgramCache]: Analyzing trace with hash 980256966, now seen corresponding path program 1 times [2019-12-07 14:25:59,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:25:59,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723380554] [2019-12-07 14:25:59,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:00,013 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 14:26:00,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723380554] [2019-12-07 14:26:00,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:00,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:26:00,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973469024] [2019-12-07 14:26:00,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:26:00,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:00,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:26:00,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:26:00,028 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-07 14:26:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:00,342 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-07 14:26:00,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:26:00,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:26:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:00,537 INFO L225 Difference]: With dead ends: 27436 [2019-12-07 14:26:00,537 INFO L226 Difference]: Without dead ends: 26890 [2019-12-07 14:26:00,538 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 14:26:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-07 14:26:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-07 14:26:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-07 14:26:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-07 14:26:01,520 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-07 14:26:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:01,521 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-07 14:26:01,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:26:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-07 14:26:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:26:01,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:01,523 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:01,523 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:01,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:01,523 INFO L82 PathProgramCache]: Analyzing trace with hash -661538299, now seen corresponding path program 1 times [2019-12-07 14:26:01,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:01,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424989771] [2019-12-07 14:26:01,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:01,580 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 14:26:01,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424989771] [2019-12-07 14:26:01,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:01,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:26:01,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647163833] [2019-12-07 14:26:01,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:26:01,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:01,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:26:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:01,582 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-12-07 14:26:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:01,992 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-07 14:26:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:26:01,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:26:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:02,100 INFO L225 Difference]: With dead ends: 43282 [2019-12-07 14:26:02,100 INFO L226 Difference]: Without dead ends: 43275 [2019-12-07 14:26:02,100 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 14:26:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-07 14:26:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-07 14:26:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-07 14:26:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-07 14:26:03,248 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-07 14:26:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:03,248 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-07 14:26:03,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:26:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-07 14:26:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:26:03,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:03,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:03,250 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:03,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2102667274, now seen corresponding path program 1 times [2019-12-07 14:26:03,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:03,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405074109] [2019-12-07 14:26:03,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:03,295 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 14:26:03,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405074109] [2019-12-07 14:26:03,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:03,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:26:03,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960416329] [2019-12-07 14:26:03,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:26:03,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:03,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:26:03,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:03,297 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-07 14:26:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:03,601 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-07 14:26:03,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:26:03,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:26:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:03,702 INFO L225 Difference]: With dead ends: 53078 [2019-12-07 14:26:03,702 INFO L226 Difference]: Without dead ends: 53078 [2019-12-07 14:26:03,703 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 14:26:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-07 14:26:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-07 14:26:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-07 14:26:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-07 14:26:04,885 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-07 14:26:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:04,885 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-07 14:26:04,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:26:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-07 14:26:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:26:04,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:04,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:26:04,889 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash -710819149, now seen corresponding path program 1 times [2019-12-07 14:26:04,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:04,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861879466] [2019-12-07 14:26:04,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:04,941 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 14:26:04,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861879466] [2019-12-07 14:26:04,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:04,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:26:04,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263099500] [2019-12-07 14:26:04,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:26:04,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:04,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:26:04,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:26:04,943 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-12-07 14:26:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:05,604 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-12-07 14:26:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:26:05,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 14:26:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:05,709 INFO L225 Difference]: With dead ends: 63010 [2019-12-07 14:26:05,709 INFO L226 Difference]: Without dead ends: 63003 [2019-12-07 14:26:05,709 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 14:26:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-12-07 14:26:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-12-07 14:26:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-07 14:26:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-07 14:26:06,946 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-07 14:26:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:06,946 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-07 14:26:06,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:26:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-07 14:26:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:26:06,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:06,961 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 14:26:06,962 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1473983183, now seen corresponding path program 1 times [2019-12-07 14:26:06,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:06,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987519801] [2019-12-07 14:26:06,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:07,009 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 14:26:07,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987519801] [2019-12-07 14:26:07,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:07,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:26:07,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235582645] [2019-12-07 14:26:07,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:26:07,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:07,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:26:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:26:07,010 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-07 14:26:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:07,040 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-07 14:26:07,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:26:07,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 14:26:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:07,047 INFO L225 Difference]: With dead ends: 5620 [2019-12-07 14:26:07,047 INFO L226 Difference]: Without dead ends: 4725 [2019-12-07 14:26:07,047 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 14:26:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-07 14:26:07,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-07 14:26:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-07 14:26:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-07 14:26:07,103 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-07 14:26:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:07,103 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-07 14:26:07,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:26:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-07 14:26:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 14:26:07,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:07,106 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 14:26:07,106 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:07,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash 14742150, now seen corresponding path program 1 times [2019-12-07 14:26:07,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:07,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335179889] [2019-12-07 14:26:07,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:26:07,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335179889] [2019-12-07 14:26:07,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:07,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:26:07,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258078024] [2019-12-07 14:26:07,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:26:07,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:26:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:26:07,171 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-12-07 14:26:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:07,202 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-07 14:26:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:26:07,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 14:26:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:07,203 INFO L225 Difference]: With dead ends: 1095 [2019-12-07 14:26:07,203 INFO L226 Difference]: Without dead ends: 991 [2019-12-07 14:26:07,204 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 14:26:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-07 14:26:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-07 14:26:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-07 14:26:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-07 14:26:07,214 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-07 14:26:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:07,214 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-07 14:26:07,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:26:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-07 14:26:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 14:26:07,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:07,216 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, 1, 1] [2019-12-07 14:26:07,216 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash -436222142, now seen corresponding path program 1 times [2019-12-07 14:26:07,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:07,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772673320] [2019-12-07 14:26:07,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:07,308 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 14:26:07,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772673320] [2019-12-07 14:26:07,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:07,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:26:07,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136801624] [2019-12-07 14:26:07,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:26:07,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:26:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:26:07,309 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-07 14:26:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:07,673 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-07 14:26:07,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:26:07,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-07 14:26:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:07,674 INFO L225 Difference]: With dead ends: 1405 [2019-12-07 14:26:07,674 INFO L226 Difference]: Without dead ends: 1405 [2019-12-07 14:26:07,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:26:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-07 14:26:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-07 14:26:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-07 14:26:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-07 14:26:07,684 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-07 14:26:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:07,684 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-07 14:26:07,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:26:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-07 14:26:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 14:26:07,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:07,685 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, 1, 1] [2019-12-07 14:26:07,685 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:07,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:07,686 INFO L82 PathProgramCache]: Analyzing trace with hash 859631310, now seen corresponding path program 2 times [2019-12-07 14:26:07,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:07,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741716491] [2019-12-07 14:26:07,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:07,740 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 14:26:07,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741716491] [2019-12-07 14:26:07,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:07,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:26:07,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063615818] [2019-12-07 14:26:07,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:26:07,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:07,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:26:07,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:26:07,742 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 3 states. [2019-12-07 14:26:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:07,752 INFO L93 Difference]: Finished difference Result 963 states and 2007 transitions. [2019-12-07 14:26:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:26:07,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 14:26:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:07,754 INFO L225 Difference]: With dead ends: 963 [2019-12-07 14:26:07,754 INFO L226 Difference]: Without dead ends: 963 [2019-12-07 14:26:07,754 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 14:26:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-07 14:26:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2019-12-07 14:26:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 14:26:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2007 transitions. [2019-12-07 14:26:07,765 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2007 transitions. Word has length 68 [2019-12-07 14:26:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:07,765 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2007 transitions. [2019-12-07 14:26:07,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:26:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2007 transitions. [2019-12-07 14:26:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:26:07,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:07,767 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, 1, 1, 1] [2019-12-07 14:26:07,767 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:07,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1270284952, now seen corresponding path program 1 times [2019-12-07 14:26:07,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:07,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102748848] [2019-12-07 14:26:07,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:07,828 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 14:26:07,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102748848] [2019-12-07 14:26:07,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:07,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:26:07,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659421773] [2019-12-07 14:26:07,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:26:07,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:26:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:26:07,829 INFO L87 Difference]: Start difference. First operand 963 states and 2007 transitions. Second operand 5 states. [2019-12-07 14:26:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:07,976 INFO L93 Difference]: Finished difference Result 1101 states and 2255 transitions. [2019-12-07 14:26:07,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:26:07,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-07 14:26:07,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:07,977 INFO L225 Difference]: With dead ends: 1101 [2019-12-07 14:26:07,977 INFO L226 Difference]: Without dead ends: 1101 [2019-12-07 14:26:07,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:26:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-07 14:26:07,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2019-12-07 14:26:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-07 14:26:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2161 transitions. [2019-12-07 14:26:07,986 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2161 transitions. Word has length 69 [2019-12-07 14:26:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:07,986 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2161 transitions. [2019-12-07 14:26:07,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:26:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2161 transitions. [2019-12-07 14:26:07,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 14:26:07,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:07,988 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, 1, 1, 1] [2019-12-07 14:26:07,988 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash 25568500, now seen corresponding path program 2 times [2019-12-07 14:26:07,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:07,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57848404] [2019-12-07 14:26:07,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:08,033 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 14:26:08,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57848404] [2019-12-07 14:26:08,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:08,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:26:08,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106620097] [2019-12-07 14:26:08,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:26:08,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:08,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:26:08,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:26:08,034 INFO L87 Difference]: Start difference. First operand 1048 states and 2161 transitions. Second operand 3 states. [2019-12-07 14:26:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:08,062 INFO L93 Difference]: Finished difference Result 1047 states and 2159 transitions. [2019-12-07 14:26:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:26:08,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 14:26:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:08,063 INFO L225 Difference]: With dead ends: 1047 [2019-12-07 14:26:08,063 INFO L226 Difference]: Without dead ends: 1047 [2019-12-07 14:26:08,064 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 14:26:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-12-07 14:26:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 962. [2019-12-07 14:26:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-12-07 14:26:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2005 transitions. [2019-12-07 14:26:08,075 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2005 transitions. Word has length 69 [2019-12-07 14:26:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:08,076 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 2005 transitions. [2019-12-07 14:26:08,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:26:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2005 transitions. [2019-12-07 14:26:08,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 14:26:08,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:08,078 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, 1, 1, 1, 1] [2019-12-07 14:26:08,078 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1502663669, now seen corresponding path program 1 times [2019-12-07 14:26:08,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:08,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133569161] [2019-12-07 14:26:08,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:08,260 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 14:26:08,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133569161] [2019-12-07 14:26:08,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:08,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:26:08,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490577559] [2019-12-07 14:26:08,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:26:08,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:08,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:26:08,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:26:08,261 INFO L87 Difference]: Start difference. First operand 962 states and 2005 transitions. Second operand 10 states. [2019-12-07 14:26:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:08,895 INFO L93 Difference]: Finished difference Result 2230 states and 4662 transitions. [2019-12-07 14:26:08,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 14:26:08,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-07 14:26:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:08,897 INFO L225 Difference]: With dead ends: 2230 [2019-12-07 14:26:08,897 INFO L226 Difference]: Without dead ends: 2230 [2019-12-07 14:26:08,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2019-12-07 14:26:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2019-12-07 14:26:08,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1270. [2019-12-07 14:26:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-12-07 14:26:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2659 transitions. [2019-12-07 14:26:08,910 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2659 transitions. Word has length 70 [2019-12-07 14:26:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:08,911 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 2659 transitions. [2019-12-07 14:26:08,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:26:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2659 transitions. [2019-12-07 14:26:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 14:26:08,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:08,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, 1, 1, 1, 1, 1] [2019-12-07 14:26:08,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1449413602, now seen corresponding path program 1 times [2019-12-07 14:26:08,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:08,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904316509] [2019-12-07 14:26:08,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:09,040 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 14:26:09,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904316509] [2019-12-07 14:26:09,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:09,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 14:26:09,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960117281] [2019-12-07 14:26:09,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:26:09,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:26:09,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:26:09,041 INFO L87 Difference]: Start difference. First operand 1270 states and 2659 transitions. Second operand 8 states. [2019-12-07 14:26:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:09,436 INFO L93 Difference]: Finished difference Result 2427 states and 5088 transitions. [2019-12-07 14:26:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:26:09,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-07 14:26:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:09,438 INFO L225 Difference]: With dead ends: 2427 [2019-12-07 14:26:09,438 INFO L226 Difference]: Without dead ends: 2427 [2019-12-07 14:26:09,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:26:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2019-12-07 14:26:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1558. [2019-12-07 14:26:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-12-07 14:26:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 3263 transitions. [2019-12-07 14:26:09,453 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 3263 transitions. Word has length 71 [2019-12-07 14:26:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:09,453 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 3263 transitions. [2019-12-07 14:26:09,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:26:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 3263 transitions. [2019-12-07 14:26:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 14:26:09,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:09,455 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, 1, 1, 1, 1, 1] [2019-12-07 14:26:09,455 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2069710509, now seen corresponding path program 1 times [2019-12-07 14:26:09,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:09,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801628968] [2019-12-07 14:26:09,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:26:09,619 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 14:26:09,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801628968] [2019-12-07 14:26:09,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:26:09,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 14:26:09,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837482196] [2019-12-07 14:26:09,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:26:09,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:26:09,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:26:09,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:26:09,620 INFO L87 Difference]: Start difference. First operand 1558 states and 3263 transitions. Second operand 12 states. [2019-12-07 14:26:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:26:10,281 INFO L93 Difference]: Finished difference Result 2894 states and 5917 transitions. [2019-12-07 14:26:10,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 14:26:10,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-12-07 14:26:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:26:10,283 INFO L225 Difference]: With dead ends: 2894 [2019-12-07 14:26:10,283 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 14:26:10,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:26:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 14:26:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-12-07 14:26:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 14:26:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 433 transitions. [2019-12-07 14:26:10,289 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 433 transitions. Word has length 71 [2019-12-07 14:26:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:26:10,289 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 433 transitions. [2019-12-07 14:26:10,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:26:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 433 transitions. [2019-12-07 14:26:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 14:26:10,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:26:10,290 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, 1, 1, 1, 1, 1] [2019-12-07 14:26:10,290 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:26:10,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:26:10,291 INFO L82 PathProgramCache]: Analyzing trace with hash 915841789, now seen corresponding path program 2 times [2019-12-07 14:26:10,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:26:10,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136564994] [2019-12-07 14:26:10,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:26:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:26:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:26:10,378 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:26:10,378 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:26:10,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29|) 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 |v_ULTIMATE.start_main_~#t599~0.offset_21|) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t599~0.base_29|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29|) |v_ULTIMATE.start_main_~#t599~0.offset_21| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t599~0.base_29| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_29|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t599~0.base=|v_ULTIMATE.start_main_~#t599~0.base_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ULTIMATE.start_main_~#t599~0.offset=|v_ULTIMATE.start_main_~#t599~0.offset_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t600~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t600~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t599~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t599~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:26:10,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t600~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t600~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t600~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13|) |v_ULTIMATE.start_main_~#t600~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t600~0.offset_11| 0) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13| 1)) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t600~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t600~0.base, #length] because there is no mapped edge [2019-12-07 14:26:10,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 2 v_~x$w_buff0~0_34) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_155 256))) (not (= 0 (mod v_~x$w_buff1_used~0_77 256))))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 14:26:10,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-733740119 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-733740119 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite12_Out-733740119| |P1Thread1of1ForFork1_#t~ite11_Out-733740119|))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff0~0_In-733740119 |P1Thread1of1ForFork1_#t~ite11_Out-733740119|) .cse2) (and (or .cse0 .cse1) (= ~x$w_buff1~0_In-733740119 |P1Thread1of1ForFork1_#t~ite11_Out-733740119|) .cse2))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-733740119, ~x$w_buff1~0=~x$w_buff1~0_In-733740119, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-733740119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-733740119} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-733740119, ~x$w_buff1~0=~x$w_buff1~0_In-733740119, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-733740119|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-733740119|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-733740119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-733740119} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 14:26:10,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 14:26:10,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In319046368 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out319046368| ~x~0_In319046368) .cse0) (and (not .cse0) (= ~x$mem_tmp~0_In319046368 |P1Thread1of1ForFork1_#t~ite31_Out319046368|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In319046368, ~x$mem_tmp~0=~x$mem_tmp~0_In319046368, ~x~0=~x~0_In319046368} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In319046368, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out319046368|, ~x$mem_tmp~0=~x$mem_tmp~0_In319046368, ~x~0=~x~0_In319046368} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:26:10,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-186261158| |P0Thread1of1ForFork0_#t~ite4_Out-186261158|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-186261158 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-186261158 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-186261158| ~x~0_In-186261158) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-186261158| ~x$w_buff1~0_In-186261158)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-186261158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-186261158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-186261158, ~x~0=~x~0_In-186261158} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-186261158|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-186261158|, ~x$w_buff1~0=~x$w_buff1~0_In-186261158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-186261158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-186261158, ~x~0=~x~0_In-186261158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 14:26:10,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-168691993 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-168691993 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-168691993| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-168691993 |P0Thread1of1ForFork0_#t~ite5_Out-168691993|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-168691993, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168691993} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-168691993|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-168691993, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168691993} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:26:10,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2123063064 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2123063064 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-2123063064| ~x$w_buff0_used~0_In-2123063064)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-2123063064| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2123063064, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2123063064} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2123063064|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2123063064, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2123063064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:26:10,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2039955990 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2039955990 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-2039955990 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2039955990 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2039955990| ~x$w_buff1_used~0_In-2039955990) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2039955990| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2039955990, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2039955990, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2039955990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2039955990} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2039955990, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2039955990, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2039955990|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2039955990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2039955990} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:26:10,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In415054985 256))) (.cse2 (= ~x$r_buff0_thd2~0_In415054985 ~x$r_buff0_thd2~0_Out415054985)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In415054985 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out415054985) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In415054985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In415054985} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out415054985, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out415054985|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In415054985} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:26:10,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-204110507 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-204110507 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-204110507 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-204110507 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-204110507| ~x$r_buff1_thd2~0_In-204110507)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-204110507|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-204110507, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-204110507, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-204110507, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-204110507} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-204110507, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-204110507, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-204110507, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-204110507|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-204110507} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:26:10,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_20|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:26:10,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1508777779 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1508777779 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1508777779 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1508777779 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1508777779| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1508777779 |P0Thread1of1ForFork0_#t~ite6_Out1508777779|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508777779, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1508777779, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1508777779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508777779} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1508777779|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508777779, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1508777779, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1508777779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508777779} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:26:10,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-798940780 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-798940780 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-798940780|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-798940780 |P0Thread1of1ForFork0_#t~ite7_Out-798940780|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-798940780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798940780} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-798940780, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-798940780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798940780} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 14:26:10,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-753717524 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-753717524 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-753717524 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-753717524 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-753717524| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-753717524| ~x$r_buff1_thd1~0_In-753717524) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-753717524, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-753717524, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-753717524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-753717524} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-753717524, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-753717524|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-753717524, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-753717524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-753717524} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:26:10,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 14:26:10,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:26:10,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1034458110 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1034458110 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1034458110 |ULTIMATE.start_main_#t~ite40_Out-1034458110|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1034458110| ~x~0_In-1034458110)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1034458110, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1034458110, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1034458110, ~x~0=~x~0_In-1034458110} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1034458110|, ~x$w_buff1~0=~x$w_buff1~0_In-1034458110, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1034458110, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1034458110, ~x~0=~x~0_In-1034458110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:26:10,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 14:26:10,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2055776063 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2055776063 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-2055776063| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-2055776063| ~x$w_buff0_used~0_In-2055776063)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2055776063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2055776063} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2055776063, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2055776063|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2055776063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 14:26:10,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1297953546 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1297953546 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1297953546 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1297953546 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1297953546| ~x$w_buff1_used~0_In-1297953546) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out-1297953546| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1297953546, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1297953546, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1297953546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1297953546} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1297953546, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1297953546, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1297953546|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1297953546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1297953546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:26:10,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2042370414 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2042370414 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-2042370414|)) (and (= ~x$r_buff0_thd0~0_In-2042370414 |ULTIMATE.start_main_#t~ite44_Out-2042370414|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2042370414, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2042370414} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2042370414, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2042370414|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2042370414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:26:10,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1503867930 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1503867930 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1503867930 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1503867930 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1503867930| ~x$r_buff1_thd0~0_In-1503867930) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1503867930| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1503867930, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1503867930, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1503867930, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1503867930} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1503867930, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1503867930, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1503867930, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1503867930|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1503867930} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:26:10,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1674402883 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-1674402883| ~x$mem_tmp~0_In-1674402883)) (and .cse0 (= |ULTIMATE.start_main_#t~ite68_Out-1674402883| ~x~0_In-1674402883)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1674402883, ~x$mem_tmp~0=~x$mem_tmp~0_In-1674402883, ~x~0=~x~0_In-1674402883} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1674402883, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1674402883|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1674402883, ~x~0=~x~0_In-1674402883} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 14:26:10,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:26:10,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:26:10 BasicIcfg [2019-12-07 14:26:10,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:26:10,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:26:10,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:26:10,450 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:26:10,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:25:55" (3/4) ... [2019-12-07 14:26:10,452 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:26:10,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29|) 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 |v_ULTIMATE.start_main_~#t599~0.offset_21|) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t599~0.base_29|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29|) |v_ULTIMATE.start_main_~#t599~0.offset_21| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t599~0.base_29| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_29|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t599~0.base=|v_ULTIMATE.start_main_~#t599~0.base_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ULTIMATE.start_main_~#t599~0.offset=|v_ULTIMATE.start_main_~#t599~0.offset_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t600~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t600~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t599~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t599~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 14:26:10,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t600~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t600~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t600~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13|) |v_ULTIMATE.start_main_~#t600~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t600~0.offset_11| 0) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13| 1)) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t600~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t600~0.base, #length] because there is no mapped edge [2019-12-07 14:26:10,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 2 v_~x$w_buff0~0_34) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_155 256))) (not (= 0 (mod v_~x$w_buff1_used~0_77 256))))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 14:26:10,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-733740119 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-733740119 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite12_Out-733740119| |P1Thread1of1ForFork1_#t~ite11_Out-733740119|))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff0~0_In-733740119 |P1Thread1of1ForFork1_#t~ite11_Out-733740119|) .cse2) (and (or .cse0 .cse1) (= ~x$w_buff1~0_In-733740119 |P1Thread1of1ForFork1_#t~ite11_Out-733740119|) .cse2))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-733740119, ~x$w_buff1~0=~x$w_buff1~0_In-733740119, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-733740119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-733740119} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-733740119, ~x$w_buff1~0=~x$w_buff1~0_In-733740119, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-733740119|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-733740119|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-733740119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-733740119} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 14:26:10,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 14:26:10,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In319046368 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out319046368| ~x~0_In319046368) .cse0) (and (not .cse0) (= ~x$mem_tmp~0_In319046368 |P1Thread1of1ForFork1_#t~ite31_Out319046368|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In319046368, ~x$mem_tmp~0=~x$mem_tmp~0_In319046368, ~x~0=~x~0_In319046368} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In319046368, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out319046368|, ~x$mem_tmp~0=~x$mem_tmp~0_In319046368, ~x~0=~x~0_In319046368} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 14:26:10,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-186261158| |P0Thread1of1ForFork0_#t~ite4_Out-186261158|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-186261158 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-186261158 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-186261158| ~x~0_In-186261158) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-186261158| ~x$w_buff1~0_In-186261158)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-186261158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-186261158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-186261158, ~x~0=~x~0_In-186261158} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-186261158|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-186261158|, ~x$w_buff1~0=~x$w_buff1~0_In-186261158, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-186261158, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-186261158, ~x~0=~x~0_In-186261158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 14:26:10,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-168691993 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-168691993 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-168691993| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-168691993 |P0Thread1of1ForFork0_#t~ite5_Out-168691993|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-168691993, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168691993} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-168691993|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-168691993, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168691993} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:26:10,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2123063064 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2123063064 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-2123063064| ~x$w_buff0_used~0_In-2123063064)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-2123063064| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2123063064, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2123063064} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2123063064|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2123063064, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2123063064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:26:10,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2039955990 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2039955990 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-2039955990 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2039955990 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2039955990| ~x$w_buff1_used~0_In-2039955990) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-2039955990| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2039955990, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2039955990, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2039955990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2039955990} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2039955990, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2039955990, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2039955990|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2039955990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2039955990} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:26:10,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In415054985 256))) (.cse2 (= ~x$r_buff0_thd2~0_In415054985 ~x$r_buff0_thd2~0_Out415054985)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In415054985 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out415054985) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In415054985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In415054985} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out415054985, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out415054985|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In415054985} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:26:10,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-204110507 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-204110507 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-204110507 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-204110507 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-204110507| ~x$r_buff1_thd2~0_In-204110507)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-204110507|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-204110507, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-204110507, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-204110507, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-204110507} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-204110507, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-204110507, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-204110507, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-204110507|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-204110507} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:26:10,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_20|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:26:10,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1508777779 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1508777779 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1508777779 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1508777779 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1508777779| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1508777779 |P0Thread1of1ForFork0_#t~ite6_Out1508777779|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508777779, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1508777779, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1508777779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508777779} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1508777779|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1508777779, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1508777779, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1508777779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1508777779} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:26:10,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-798940780 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-798940780 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-798940780|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-798940780 |P0Thread1of1ForFork0_#t~ite7_Out-798940780|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-798940780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798940780} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-798940780, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-798940780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798940780} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 14:26:10,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-753717524 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-753717524 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-753717524 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-753717524 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-753717524| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-753717524| ~x$r_buff1_thd1~0_In-753717524) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-753717524, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-753717524, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-753717524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-753717524} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-753717524, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-753717524|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-753717524, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-753717524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-753717524} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:26:10,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 14:26:10,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:26:10,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1034458110 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1034458110 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1034458110 |ULTIMATE.start_main_#t~ite40_Out-1034458110|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1034458110| ~x~0_In-1034458110)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1034458110, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1034458110, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1034458110, ~x~0=~x~0_In-1034458110} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1034458110|, ~x$w_buff1~0=~x$w_buff1~0_In-1034458110, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1034458110, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1034458110, ~x~0=~x~0_In-1034458110} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:26:10,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 14:26:10,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2055776063 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2055776063 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-2055776063| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-2055776063| ~x$w_buff0_used~0_In-2055776063)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2055776063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2055776063} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2055776063, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2055776063|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2055776063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 14:26:10,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1297953546 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1297953546 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1297953546 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1297953546 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1297953546| ~x$w_buff1_used~0_In-1297953546) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out-1297953546| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1297953546, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1297953546, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1297953546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1297953546} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1297953546, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1297953546, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1297953546|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1297953546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1297953546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:26:10,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2042370414 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-2042370414 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-2042370414|)) (and (= ~x$r_buff0_thd0~0_In-2042370414 |ULTIMATE.start_main_#t~ite44_Out-2042370414|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2042370414, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2042370414} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2042370414, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2042370414|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2042370414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:26:10,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1503867930 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1503867930 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1503867930 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1503867930 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1503867930| ~x$r_buff1_thd0~0_In-1503867930) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1503867930| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1503867930, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1503867930, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1503867930, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1503867930} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1503867930, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1503867930, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1503867930, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1503867930|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1503867930} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:26:10,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1674402883 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-1674402883| ~x$mem_tmp~0_In-1674402883)) (and .cse0 (= |ULTIMATE.start_main_#t~ite68_Out-1674402883| ~x~0_In-1674402883)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1674402883, ~x$mem_tmp~0=~x$mem_tmp~0_In-1674402883, ~x~0=~x~0_In-1674402883} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1674402883, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1674402883|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1674402883, ~x~0=~x~0_In-1674402883} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 14:26:10,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:26:10,526 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_daefe951-2179-4763-a5ab-39e6d68a8784/bin/uautomizer/witness.graphml [2019-12-07 14:26:10,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:26:10,527 INFO L168 Benchmark]: Toolchain (without parser) took 16319.44 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 934.0 MB in the beginning and 1.3 GB in the end (delta: -335.6 MB). Peak memory consumption was 683.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:10,527 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:26:10,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:10,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:10,528 INFO L168 Benchmark]: Boogie Preprocessor took 32.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:10,528 INFO L168 Benchmark]: RCFGBuilder took 450.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:10,528 INFO L168 Benchmark]: TraceAbstraction took 15307.77 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 923.8 MB). Free memory was 988.7 MB in the beginning and 1.3 GB in the end (delta: -323.3 MB). Peak memory consumption was 600.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:10,528 INFO L168 Benchmark]: Witness Printer took 76.20 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:26:10,530 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.7 MB in the end (delta: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15307.77 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 923.8 MB). Free memory was 988.7 MB in the beginning and 1.3 GB in the end (delta: -323.3 MB). Peak memory consumption was 600.5 MB. Max. memory is 11.5 GB. * Witness Printer took 76.20 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 10285 VarBasedMoverChecksPositive, 306 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 142941 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 x$flush_delayed = weak$$choice2 [L758] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L760] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x = x$flush_delayed ? x$mem_tmp : x [L768] 2 x$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 y = 1 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 x$flush_delayed = weak$$choice2 [L815] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L817] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L818] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L819] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2709 SDtfs, 2934 SDslu, 5717 SDs, 0 SdLazy, 3625 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 26 SyntacticMatches, 14 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 24489 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 113709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...