./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/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 94642e44943c2d0baa9ed6d5be6510be0c52488d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:54:17,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:54:17,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:54:17,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:54:17,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:54:17,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:54:17,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:54:17,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:54:17,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:54:17,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:54:17,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:54:17,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:54:17,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:54:17,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:54:17,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:54:17,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:54:17,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:54:17,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:54:17,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:54:17,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:54:17,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:54:17,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:54:17,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:54:17,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:54:17,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:54:17,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:54:17,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:54:17,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:54:17,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:54:17,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:54:17,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:54:17,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:54:17,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:54:17,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:54:17,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:54:17,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:54:17,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:54:17,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:54:17,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:54:17,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:54:17,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:54:17,672 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:54:17,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:54:17,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:54:17,683 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:54:17,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:54:17,684 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:54:17,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:54:17,684 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:54:17,684 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:54:17,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:54:17,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:54:17,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:54:17,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:54:17,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:54:17,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:54:17,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:54:17,686 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:54:17,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:54:17,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:54:17,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:54:17,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:54:17,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:54:17,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:54:17,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:54:17,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:54:17,688 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:54:17,688 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:54:17,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:54:17,688 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:54:17,688 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:54:17,689 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_4216cb53-4034-41e9-8ced-ce19881c3fdf/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 -> 94642e44943c2d0baa9ed6d5be6510be0c52488d [2019-12-07 18:54:17,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:54:17,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:54:17,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:54:17,813 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:54:17,813 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:54:17,813 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi009_tso.oepc.i [2019-12-07 18:54:17,854 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/data/db3c3245f/0f0ed6a5e7614e2ea94e93f470708bd4/FLAGa0661028a [2019-12-07 18:54:18,320 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:54:18,320 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/sv-benchmarks/c/pthread-wmm/rfi009_tso.oepc.i [2019-12-07 18:54:18,330 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/data/db3c3245f/0f0ed6a5e7614e2ea94e93f470708bd4/FLAGa0661028a [2019-12-07 18:54:18,642 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/data/db3c3245f/0f0ed6a5e7614e2ea94e93f470708bd4 [2019-12-07 18:54:18,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:54:18,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:54:18,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:54:18,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:54:18,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:54:18,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:54:18" (1/1) ... [2019-12-07 18:54:18,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375546ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:18, skipping insertion in model container [2019-12-07 18:54:18,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:54:18" (1/1) ... [2019-12-07 18:54:18,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:54:18,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:54:18,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:54:18,959 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:54:19,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:54:19,047 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:54:19,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19 WrapperNode [2019-12-07 18:54:19,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:54:19,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:54:19,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:54:19,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:54:19,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:54:19,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:54:19,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:54:19,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:54:19,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... [2019-12-07 18:54:19,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:54:19,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:54:19,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:54:19,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:54:19,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:54:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:54:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:54:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:54:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:54:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:54:19,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:54:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:54:19,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:54:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:54:19,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:54:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:54:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:54:19,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:54:19,168 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:54:19,588 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:54:19,588 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:54:19,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:54:19 BoogieIcfgContainer [2019-12-07 18:54:19,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:54:19,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:54:19,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:54:19,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:54:19,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:54:18" (1/3) ... [2019-12-07 18:54:19,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611d243f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:54:19, skipping insertion in model container [2019-12-07 18:54:19,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:54:19" (2/3) ... [2019-12-07 18:54:19,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611d243f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:54:19, skipping insertion in model container [2019-12-07 18:54:19,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:54:19" (3/3) ... [2019-12-07 18:54:19,594 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi009_tso.oepc.i [2019-12-07 18:54:19,600 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:54:19,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:54:19,605 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:54:19,606 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:54:19,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,634 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,645 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,645 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,645 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,645 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:54:19,671 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:54:19,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:54:19,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:54:19,683 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:54:19,683 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:54:19,683 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:54:19,683 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:54:19,683 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:54:19,683 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:54:19,694 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 258 transitions [2019-12-07 18:54:19,695 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 206 places, 258 transitions [2019-12-07 18:54:19,763 INFO L134 PetriNetUnfolder]: 62/255 cut-off events. [2019-12-07 18:54:19,763 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:54:19,775 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 255 events. 62/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1110 event pairs. 9/200 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-07 18:54:19,803 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 206 places, 258 transitions [2019-12-07 18:54:19,844 INFO L134 PetriNetUnfolder]: 62/255 cut-off events. [2019-12-07 18:54:19,844 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:54:19,855 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 255 events. 62/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1110 event pairs. 9/200 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-07 18:54:19,885 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 32698 [2019-12-07 18:54:19,886 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:54:23,466 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 18:54:23,634 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 18:54:23,737 INFO L206 etLargeBlockEncoding]: Checked pairs total: 172435 [2019-12-07 18:54:23,737 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-07 18:54:23,740 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 140 transitions [2019-12-07 18:56:13,861 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 326552 states. [2019-12-07 18:56:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 326552 states. [2019-12-07 18:56:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 18:56:13,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:56:13,867 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 18:56:13,867 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:56:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:56:13,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1079128557, now seen corresponding path program 1 times [2019-12-07 18:56:13,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:56:13,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913974398] [2019-12-07 18:56:13,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:56:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:56:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:56:14,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913974398] [2019-12-07 18:56:14,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:56:14,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:56:14,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720050059] [2019-12-07 18:56:14,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:56:14,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:56:14,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:56:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:56:14,038 INFO L87 Difference]: Start difference. First operand 326552 states. Second operand 3 states. [2019-12-07 18:56:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:56:16,256 INFO L93 Difference]: Finished difference Result 325136 states and 1487916 transitions. [2019-12-07 18:56:16,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:56:16,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 18:56:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:56:17,275 INFO L225 Difference]: With dead ends: 325136 [2019-12-07 18:56:17,276 INFO L226 Difference]: Without dead ends: 304556 [2019-12-07 18:56:17,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:56:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304556 states. [2019-12-07 18:56:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304556 to 304556. [2019-12-07 18:56:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304556 states. [2019-12-07 18:57:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304556 states to 304556 states and 1392758 transitions. [2019-12-07 18:57:01,228 INFO L78 Accepts]: Start accepts. Automaton has 304556 states and 1392758 transitions. Word has length 5 [2019-12-07 18:57:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:01,229 INFO L462 AbstractCegarLoop]: Abstraction has 304556 states and 1392758 transitions. [2019-12-07 18:57:01,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:57:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 304556 states and 1392758 transitions. [2019-12-07 18:57:01,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:57:01,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:01,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:01,235 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:01,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:01,236 INFO L82 PathProgramCache]: Analyzing trace with hash -201706173, now seen corresponding path program 1 times [2019-12-07 18:57:01,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:01,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523403981] [2019-12-07 18:57:01,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:57:01,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523403981] [2019-12-07 18:57:01,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:57:01,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:57:01,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924776392] [2019-12-07 18:57:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:57:01,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:01,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:57:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:01,314 INFO L87 Difference]: Start difference. First operand 304556 states and 1392758 transitions. Second operand 4 states. [2019-12-07 18:57:04,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:04,076 INFO L93 Difference]: Finished difference Result 474194 states and 2086526 transitions. [2019-12-07 18:57:04,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:57:04,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:57:04,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:10,395 INFO L225 Difference]: With dead ends: 474194 [2019-12-07 18:57:10,395 INFO L226 Difference]: Without dead ends: 474082 [2019-12-07 18:57:10,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:57:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474082 states. [2019-12-07 18:57:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474082 to 458686. [2019-12-07 18:57:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458686 states. [2019-12-07 18:57:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458686 states to 458686 states and 2030109 transitions. [2019-12-07 18:57:58,323 INFO L78 Accepts]: Start accepts. Automaton has 458686 states and 2030109 transitions. Word has length 13 [2019-12-07 18:57:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:57:58,323 INFO L462 AbstractCegarLoop]: Abstraction has 458686 states and 2030109 transitions. [2019-12-07 18:57:58,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:57:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 458686 states and 2030109 transitions. [2019-12-07 18:57:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:57:58,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:57:58,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:57:58,326 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:57:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:57:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1643785693, now seen corresponding path program 1 times [2019-12-07 18:57:58,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:57:58,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423118441] [2019-12-07 18:57:58,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:57:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:57:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:57:58,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423118441] [2019-12-07 18:57:58,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:57:58,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:57:58,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46862008] [2019-12-07 18:57:58,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:57:58,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:57:58,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:57:58,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:57:58,393 INFO L87 Difference]: Start difference. First operand 458686 states and 2030109 transitions. Second operand 4 states. [2019-12-07 18:57:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:57:58,901 INFO L93 Difference]: Finished difference Result 115019 states and 428115 transitions. [2019-12-07 18:57:58,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:57:58,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:57:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:57:59,092 INFO L225 Difference]: With dead ends: 115019 [2019-12-07 18:57:59,093 INFO L226 Difference]: Without dead ends: 82567 [2019-12-07 18:57:59,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:57:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82567 states. [2019-12-07 18:58:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82567 to 82495. [2019-12-07 18:58:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82495 states. [2019-12-07 18:58:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82495 states to 82495 states and 287763 transitions. [2019-12-07 18:58:01,545 INFO L78 Accepts]: Start accepts. Automaton has 82495 states and 287763 transitions. Word has length 13 [2019-12-07 18:58:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:01,545 INFO L462 AbstractCegarLoop]: Abstraction has 82495 states and 287763 transitions. [2019-12-07 18:58:01,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 82495 states and 287763 transitions. [2019-12-07 18:58:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:58:01,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:01,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:01,548 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:01,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:01,548 INFO L82 PathProgramCache]: Analyzing trace with hash 29254760, now seen corresponding path program 1 times [2019-12-07 18:58:01,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:01,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987563208] [2019-12-07 18:58:01,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:01,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987563208] [2019-12-07 18:58:01,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:01,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:58:01,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957234732] [2019-12-07 18:58:01,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:01,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:01,590 INFO L87 Difference]: Start difference. First operand 82495 states and 287763 transitions. Second operand 4 states. [2019-12-07 18:58:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:02,132 INFO L93 Difference]: Finished difference Result 108159 states and 370529 transitions. [2019-12-07 18:58:02,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:58:02,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:58:02,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:02,343 INFO L225 Difference]: With dead ends: 108159 [2019-12-07 18:58:02,343 INFO L226 Difference]: Without dead ends: 108025 [2019-12-07 18:58:02,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108025 states. [2019-12-07 18:58:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108025 to 96538. [2019-12-07 18:58:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96538 states. [2019-12-07 18:58:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96538 states to 96538 states and 333789 transitions. [2019-12-07 18:58:05,136 INFO L78 Accepts]: Start accepts. Automaton has 96538 states and 333789 transitions. Word has length 14 [2019-12-07 18:58:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:05,136 INFO L462 AbstractCegarLoop]: Abstraction has 96538 states and 333789 transitions. [2019-12-07 18:58:05,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 96538 states and 333789 transitions. [2019-12-07 18:58:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:58:05,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:05,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:05,138 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash 906926037, now seen corresponding path program 1 times [2019-12-07 18:58:05,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:05,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611117205] [2019-12-07 18:58:05,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:05,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611117205] [2019-12-07 18:58:05,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:05,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:05,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753331085] [2019-12-07 18:58:05,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:58:05,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:05,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:58:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:58:05,161 INFO L87 Difference]: Start difference. First operand 96538 states and 333789 transitions. Second operand 3 states. [2019-12-07 18:58:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:05,795 INFO L93 Difference]: Finished difference Result 169674 states and 562322 transitions. [2019-12-07 18:58:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:58:05,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 18:58:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:06,710 INFO L225 Difference]: With dead ends: 169674 [2019-12-07 18:58:06,710 INFO L226 Difference]: Without dead ends: 169674 [2019-12-07 18:58:06,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:58:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169674 states. [2019-12-07 18:58:11,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169674 to 152576. [2019-12-07 18:58:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152576 states. [2019-12-07 18:58:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152576 states to 152576 states and 511923 transitions. [2019-12-07 18:58:12,039 INFO L78 Accepts]: Start accepts. Automaton has 152576 states and 511923 transitions. Word has length 15 [2019-12-07 18:58:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:12,039 INFO L462 AbstractCegarLoop]: Abstraction has 152576 states and 511923 transitions. [2019-12-07 18:58:12,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:58:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 152576 states and 511923 transitions. [2019-12-07 18:58:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:58:12,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:12,045 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 18:58:12,045 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2045798406, now seen corresponding path program 1 times [2019-12-07 18:58:12,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:12,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996070611] [2019-12-07 18:58:12,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:12,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996070611] [2019-12-07 18:58:12,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:12,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:58:12,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676650859] [2019-12-07 18:58:12,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:12,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:12,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:12,086 INFO L87 Difference]: Start difference. First operand 152576 states and 511923 transitions. Second operand 4 states. [2019-12-07 18:58:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:12,976 INFO L93 Difference]: Finished difference Result 190212 states and 629311 transitions. [2019-12-07 18:58:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:58:12,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 18:58:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:13,335 INFO L225 Difference]: With dead ends: 190212 [2019-12-07 18:58:13,335 INFO L226 Difference]: Without dead ends: 190051 [2019-12-07 18:58:13,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190051 states. [2019-12-07 18:58:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190051 to 154722. [2019-12-07 18:58:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154722 states. [2019-12-07 18:58:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154722 states to 154722 states and 518709 transitions. [2019-12-07 18:58:17,199 INFO L78 Accepts]: Start accepts. Automaton has 154722 states and 518709 transitions. Word has length 17 [2019-12-07 18:58:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:17,199 INFO L462 AbstractCegarLoop]: Abstraction has 154722 states and 518709 transitions. [2019-12-07 18:58:17,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 154722 states and 518709 transitions. [2019-12-07 18:58:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:58:17,212 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:17,212 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] [2019-12-07 18:58:17,213 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:17,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:17,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1582777682, now seen corresponding path program 1 times [2019-12-07 18:58:17,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:17,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900880744] [2019-12-07 18:58:17,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:17,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900880744] [2019-12-07 18:58:17,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:17,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:17,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040681066] [2019-12-07 18:58:17,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:58:17,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:17,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:58:17,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:17,266 INFO L87 Difference]: Start difference. First operand 154722 states and 518709 transitions. Second operand 5 states. [2019-12-07 18:58:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:18,527 INFO L93 Difference]: Finished difference Result 222114 states and 728738 transitions. [2019-12-07 18:58:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:58:18,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:58:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:18,968 INFO L225 Difference]: With dead ends: 222114 [2019-12-07 18:58:18,969 INFO L226 Difference]: Without dead ends: 221918 [2019-12-07 18:58:18,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221918 states. [2019-12-07 18:58:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221918 to 164758. [2019-12-07 18:58:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164758 states. [2019-12-07 18:58:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164758 states to 164758 states and 550520 transitions. [2019-12-07 18:58:23,347 INFO L78 Accepts]: Start accepts. Automaton has 164758 states and 550520 transitions. Word has length 22 [2019-12-07 18:58:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:23,347 INFO L462 AbstractCegarLoop]: Abstraction has 164758 states and 550520 transitions. [2019-12-07 18:58:23,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:58:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 164758 states and 550520 transitions. [2019-12-07 18:58:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:58:23,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:23,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:23,369 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:23,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash 682956496, now seen corresponding path program 1 times [2019-12-07 18:58:23,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:23,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449019034] [2019-12-07 18:58:23,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:23,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449019034] [2019-12-07 18:58:23,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:23,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:23,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318733224] [2019-12-07 18:58:23,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:58:23,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:58:23,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:23,428 INFO L87 Difference]: Start difference. First operand 164758 states and 550520 transitions. Second operand 5 states. [2019-12-07 18:58:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:24,721 INFO L93 Difference]: Finished difference Result 229808 states and 752837 transitions. [2019-12-07 18:58:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:58:24,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 18:58:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:25,489 INFO L225 Difference]: With dead ends: 229808 [2019-12-07 18:58:25,489 INFO L226 Difference]: Without dead ends: 229409 [2019-12-07 18:58:25,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229409 states. [2019-12-07 18:58:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229409 to 154602. [2019-12-07 18:58:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154602 states. [2019-12-07 18:58:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154602 states to 154602 states and 518065 transitions. [2019-12-07 18:58:31,433 INFO L78 Accepts]: Start accepts. Automaton has 154602 states and 518065 transitions. Word has length 25 [2019-12-07 18:58:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:31,434 INFO L462 AbstractCegarLoop]: Abstraction has 154602 states and 518065 transitions. [2019-12-07 18:58:31,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:58:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 154602 states and 518065 transitions. [2019-12-07 18:58:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:58:31,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:31,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:31,457 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:31,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:31,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1129174222, now seen corresponding path program 1 times [2019-12-07 18:58:31,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:31,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382635045] [2019-12-07 18:58:31,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:31,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382635045] [2019-12-07 18:58:31,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:31,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:31,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309483220] [2019-12-07 18:58:31,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:58:31,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:58:31,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:31,512 INFO L87 Difference]: Start difference. First operand 154602 states and 518065 transitions. Second operand 5 states. [2019-12-07 18:58:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:31,808 INFO L93 Difference]: Finished difference Result 82515 states and 267742 transitions. [2019-12-07 18:58:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:58:31,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 18:58:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:31,939 INFO L225 Difference]: With dead ends: 82515 [2019-12-07 18:58:31,939 INFO L226 Difference]: Without dead ends: 73963 [2019-12-07 18:58:31,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:58:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73963 states. [2019-12-07 18:58:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73963 to 73015. [2019-12-07 18:58:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73015 states. [2019-12-07 18:58:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73015 states to 73015 states and 237418 transitions. [2019-12-07 18:58:33,519 INFO L78 Accepts]: Start accepts. Automaton has 73015 states and 237418 transitions. Word has length 25 [2019-12-07 18:58:33,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:33,520 INFO L462 AbstractCegarLoop]: Abstraction has 73015 states and 237418 transitions. [2019-12-07 18:58:33,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:58:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 73015 states and 237418 transitions. [2019-12-07 18:58:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:58:33,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:33,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:58:33,604 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:33,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:33,604 INFO L82 PathProgramCache]: Analyzing trace with hash -726628599, now seen corresponding path program 1 times [2019-12-07 18:58:33,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:33,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608040250] [2019-12-07 18:58:33,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:33,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608040250] [2019-12-07 18:58:33,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:33,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:58:33,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597671058] [2019-12-07 18:58:33,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:58:33,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:33,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:58:33,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:58:33,668 INFO L87 Difference]: Start difference. First operand 73015 states and 237418 transitions. Second operand 6 states. [2019-12-07 18:58:33,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:33,945 INFO L93 Difference]: Finished difference Result 70949 states and 232478 transitions. [2019-12-07 18:58:33,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:58:33,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 18:58:33,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:34,055 INFO L225 Difference]: With dead ends: 70949 [2019-12-07 18:58:34,055 INFO L226 Difference]: Without dead ends: 70654 [2019-12-07 18:58:34,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:34,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70654 states. [2019-12-07 18:58:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70654 to 68447. [2019-12-07 18:58:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68447 states. [2019-12-07 18:58:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68447 states to 68447 states and 225687 transitions. [2019-12-07 18:58:35,621 INFO L78 Accepts]: Start accepts. Automaton has 68447 states and 225687 transitions. Word has length 42 [2019-12-07 18:58:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:35,622 INFO L462 AbstractCegarLoop]: Abstraction has 68447 states and 225687 transitions. [2019-12-07 18:58:35,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:58:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 68447 states and 225687 transitions. [2019-12-07 18:58:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 18:58:35,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:35,705 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 18:58:35,705 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:35,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2012604765, now seen corresponding path program 1 times [2019-12-07 18:58:35,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:35,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525139513] [2019-12-07 18:58:35,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:35,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525139513] [2019-12-07 18:58:35,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:35,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:58:35,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565297674] [2019-12-07 18:58:35,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:58:35,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:58:35,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:58:35,761 INFO L87 Difference]: Start difference. First operand 68447 states and 225687 transitions. Second operand 3 states. [2019-12-07 18:58:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:35,962 INFO L93 Difference]: Finished difference Result 64969 states and 211447 transitions. [2019-12-07 18:58:35,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:58:35,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 18:58:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:36,066 INFO L225 Difference]: With dead ends: 64969 [2019-12-07 18:58:36,067 INFO L226 Difference]: Without dead ends: 64969 [2019-12-07 18:58:36,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:58:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64969 states. [2019-12-07 18:58:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64969 to 64969. [2019-12-07 18:58:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64969 states. [2019-12-07 18:58:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64969 states to 64969 states and 211447 transitions. [2019-12-07 18:58:37,471 INFO L78 Accepts]: Start accepts. Automaton has 64969 states and 211447 transitions. Word has length 71 [2019-12-07 18:58:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:37,471 INFO L462 AbstractCegarLoop]: Abstraction has 64969 states and 211447 transitions. [2019-12-07 18:58:37,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:58:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 64969 states and 211447 transitions. [2019-12-07 18:58:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:58:37,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:37,541 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, 1] [2019-12-07 18:58:37,541 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:37,542 INFO L82 PathProgramCache]: Analyzing trace with hash -272764284, now seen corresponding path program 1 times [2019-12-07 18:58:37,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:37,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376424572] [2019-12-07 18:58:37,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:37,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376424572] [2019-12-07 18:58:37,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:37,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:58:37,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003920388] [2019-12-07 18:58:37,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:58:37,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:37,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:58:37,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:37,604 INFO L87 Difference]: Start difference. First operand 64969 states and 211447 transitions. Second operand 5 states. [2019-12-07 18:58:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:38,079 INFO L93 Difference]: Finished difference Result 75278 states and 241968 transitions. [2019-12-07 18:58:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:58:38,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-07 18:58:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:38,194 INFO L225 Difference]: With dead ends: 75278 [2019-12-07 18:58:38,194 INFO L226 Difference]: Without dead ends: 75278 [2019-12-07 18:58:38,194 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 18:58:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75278 states. [2019-12-07 18:58:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75278 to 70538. [2019-12-07 18:58:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70538 states. [2019-12-07 18:58:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70538 states to 70538 states and 228524 transitions. [2019-12-07 18:58:39,600 INFO L78 Accepts]: Start accepts. Automaton has 70538 states and 228524 transitions. Word has length 72 [2019-12-07 18:58:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:39,601 INFO L462 AbstractCegarLoop]: Abstraction has 70538 states and 228524 transitions. [2019-12-07 18:58:39,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:58:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 70538 states and 228524 transitions. [2019-12-07 18:58:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:58:39,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:39,684 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, 1] [2019-12-07 18:58:39,684 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:39,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash -70425080, now seen corresponding path program 2 times [2019-12-07 18:58:39,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:39,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183227517] [2019-12-07 18:58:39,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:39,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183227517] [2019-12-07 18:58:39,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:39,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:58:39,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610619380] [2019-12-07 18:58:39,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:58:39,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:39,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:58:39,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:58:39,775 INFO L87 Difference]: Start difference. First operand 70538 states and 228524 transitions. Second operand 9 states. [2019-12-07 18:58:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:41,287 INFO L93 Difference]: Finished difference Result 126206 states and 405810 transitions. [2019-12-07 18:58:41,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:58:41,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-12-07 18:58:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:41,497 INFO L225 Difference]: With dead ends: 126206 [2019-12-07 18:58:41,497 INFO L226 Difference]: Without dead ends: 126206 [2019-12-07 18:58:41,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:58:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126206 states. [2019-12-07 18:58:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126206 to 98040. [2019-12-07 18:58:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98040 states. [2019-12-07 18:58:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98040 states to 98040 states and 318082 transitions. [2019-12-07 18:58:43,855 INFO L78 Accepts]: Start accepts. Automaton has 98040 states and 318082 transitions. Word has length 72 [2019-12-07 18:58:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:43,855 INFO L462 AbstractCegarLoop]: Abstraction has 98040 states and 318082 transitions. [2019-12-07 18:58:43,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:58:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 98040 states and 318082 transitions. [2019-12-07 18:58:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 18:58:43,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:43,983 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, 1] [2019-12-07 18:58:43,983 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2081597808, now seen corresponding path program 3 times [2019-12-07 18:58:43,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:43,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919659337] [2019-12-07 18:58:43,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:44,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 18:58:44,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919659337] [2019-12-07 18:58:44,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:44,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:58:44,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914624528] [2019-12-07 18:58:44,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:58:44,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:58:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:58:44,042 INFO L87 Difference]: Start difference. First operand 98040 states and 318082 transitions. Second operand 3 states. [2019-12-07 18:58:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:44,372 INFO L93 Difference]: Finished difference Result 98039 states and 318080 transitions. [2019-12-07 18:58:44,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:58:44,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 18:58:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:44,526 INFO L225 Difference]: With dead ends: 98039 [2019-12-07 18:58:44,526 INFO L226 Difference]: Without dead ends: 98039 [2019-12-07 18:58:44,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:58:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98039 states. [2019-12-07 18:58:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98039 to 87351. [2019-12-07 18:58:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87351 states. [2019-12-07 18:58:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87351 states to 87351 states and 284592 transitions. [2019-12-07 18:58:46,508 INFO L78 Accepts]: Start accepts. Automaton has 87351 states and 284592 transitions. Word has length 72 [2019-12-07 18:58:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:46,508 INFO L462 AbstractCegarLoop]: Abstraction has 87351 states and 284592 transitions. [2019-12-07 18:58:46,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:58:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 87351 states and 284592 transitions. [2019-12-07 18:58:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 18:58:46,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:46,618 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, 1, 1] [2019-12-07 18:58:46,618 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash -55394244, now seen corresponding path program 1 times [2019-12-07 18:58:46,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:46,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631449842] [2019-12-07 18:58:46,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:46,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631449842] [2019-12-07 18:58:46,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:46,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:46,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799370774] [2019-12-07 18:58:46,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:58:46,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:46,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:58:46,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:46,691 INFO L87 Difference]: Start difference. First operand 87351 states and 284592 transitions. Second operand 5 states. [2019-12-07 18:58:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:47,217 INFO L93 Difference]: Finished difference Result 157237 states and 511252 transitions. [2019-12-07 18:58:47,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:58:47,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-07 18:58:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:47,333 INFO L225 Difference]: With dead ends: 157237 [2019-12-07 18:58:47,334 INFO L226 Difference]: Without dead ends: 73453 [2019-12-07 18:58:47,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:58:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73453 states. [2019-12-07 18:58:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73453 to 73453. [2019-12-07 18:58:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73453 states. [2019-12-07 18:58:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73453 states to 73453 states and 238130 transitions. [2019-12-07 18:58:48,922 INFO L78 Accepts]: Start accepts. Automaton has 73453 states and 238130 transitions. Word has length 73 [2019-12-07 18:58:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:48,923 INFO L462 AbstractCegarLoop]: Abstraction has 73453 states and 238130 transitions. [2019-12-07 18:58:48,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:58:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 73453 states and 238130 transitions. [2019-12-07 18:58:49,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 18:58:49,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:49,012 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, 1, 1] [2019-12-07 18:58:49,012 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash -477122996, now seen corresponding path program 2 times [2019-12-07 18:58:49,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:49,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449344722] [2019-12-07 18:58:49,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:49,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449344722] [2019-12-07 18:58:49,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:49,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:58:49,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367834123] [2019-12-07 18:58:49,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:58:49,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:49,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:58:49,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:58:49,096 INFO L87 Difference]: Start difference. First operand 73453 states and 238130 transitions. Second operand 4 states. [2019-12-07 18:58:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:49,367 INFO L93 Difference]: Finished difference Result 84544 states and 272957 transitions. [2019-12-07 18:58:49,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:58:49,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 18:58:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:49,489 INFO L225 Difference]: With dead ends: 84544 [2019-12-07 18:58:49,489 INFO L226 Difference]: Without dead ends: 78203 [2019-12-07 18:58:49,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78203 states. [2019-12-07 18:58:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78203 to 67636. [2019-12-07 18:58:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67636 states. [2019-12-07 18:58:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67636 states to 67636 states and 218721 transitions. [2019-12-07 18:58:51,018 INFO L78 Accepts]: Start accepts. Automaton has 67636 states and 218721 transitions. Word has length 73 [2019-12-07 18:58:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:51,019 INFO L462 AbstractCegarLoop]: Abstraction has 67636 states and 218721 transitions. [2019-12-07 18:58:51,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:58:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 67636 states and 218721 transitions. [2019-12-07 18:58:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 18:58:51,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:51,096 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, 1, 1] [2019-12-07 18:58:51,097 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:51,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1315831668, now seen corresponding path program 3 times [2019-12-07 18:58:51,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:51,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631438792] [2019-12-07 18:58:51,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:51,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631438792] [2019-12-07 18:58:51,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:51,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:58:51,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764582899] [2019-12-07 18:58:51,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:58:51,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:58:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:58:51,183 INFO L87 Difference]: Start difference. First operand 67636 states and 218721 transitions. Second operand 5 states. [2019-12-07 18:58:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:51,430 INFO L93 Difference]: Finished difference Result 76175 states and 245690 transitions. [2019-12-07 18:58:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:58:51,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-07 18:58:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:51,442 INFO L225 Difference]: With dead ends: 76175 [2019-12-07 18:58:51,442 INFO L226 Difference]: Without dead ends: 8739 [2019-12-07 18:58:51,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:58:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8739 states. [2019-12-07 18:58:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8739 to 8739. [2019-12-07 18:58:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8739 states. [2019-12-07 18:58:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8739 states to 8739 states and 27341 transitions. [2019-12-07 18:58:51,585 INFO L78 Accepts]: Start accepts. Automaton has 8739 states and 27341 transitions. Word has length 73 [2019-12-07 18:58:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:51,585 INFO L462 AbstractCegarLoop]: Abstraction has 8739 states and 27341 transitions. [2019-12-07 18:58:51,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:58:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8739 states and 27341 transitions. [2019-12-07 18:58:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:58:51,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:51,592 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, 1, 1, 1] [2019-12-07 18:58:51,593 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:51,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:51,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1189124082, now seen corresponding path program 1 times [2019-12-07 18:58:51,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:51,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462685859] [2019-12-07 18:58:51,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:52,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462685859] [2019-12-07 18:58:52,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:52,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-07 18:58:52,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689797934] [2019-12-07 18:58:52,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 18:58:52,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:52,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 18:58:52,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:58:52,199 INFO L87 Difference]: Start difference. First operand 8739 states and 27341 transitions. Second operand 22 states. [2019-12-07 18:58:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:58:58,819 INFO L93 Difference]: Finished difference Result 21132 states and 64151 transitions. [2019-12-07 18:58:58,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 18:58:58,821 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2019-12-07 18:58:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:58:58,856 INFO L225 Difference]: With dead ends: 21132 [2019-12-07 18:58:58,856 INFO L226 Difference]: Without dead ends: 13426 [2019-12-07 18:58:58,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=491, Invalid=2931, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 18:58:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13426 states. [2019-12-07 18:58:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13426 to 10346. [2019-12-07 18:58:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10346 states. [2019-12-07 18:58:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10346 states to 10346 states and 32101 transitions. [2019-12-07 18:58:59,053 INFO L78 Accepts]: Start accepts. Automaton has 10346 states and 32101 transitions. Word has length 74 [2019-12-07 18:58:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:58:59,053 INFO L462 AbstractCegarLoop]: Abstraction has 10346 states and 32101 transitions. [2019-12-07 18:58:59,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 18:58:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 10346 states and 32101 transitions. [2019-12-07 18:58:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:58:59,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:58:59,063 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, 1, 1, 1] [2019-12-07 18:58:59,063 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:58:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:58:59,063 INFO L82 PathProgramCache]: Analyzing trace with hash -976419176, now seen corresponding path program 2 times [2019-12-07 18:58:59,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:58:59,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281857375] [2019-12-07 18:58:59,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:58:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:58:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:58:59,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281857375] [2019-12-07 18:58:59,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:58:59,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 18:58:59,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531849814] [2019-12-07 18:58:59,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:58:59,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:58:59,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:58:59,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:58:59,586 INFO L87 Difference]: Start difference. First operand 10346 states and 32101 transitions. Second operand 21 states. [2019-12-07 18:59:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:04,976 INFO L93 Difference]: Finished difference Result 14471 states and 44160 transitions. [2019-12-07 18:59:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 18:59:04,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-12-07 18:59:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:05,005 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 18:59:05,005 INFO L226 Difference]: Without dead ends: 12938 [2019-12-07 18:59:05,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=341, Invalid=1915, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 18:59:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12938 states. [2019-12-07 18:59:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12938 to 10370. [2019-12-07 18:59:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10370 states. [2019-12-07 18:59:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10370 states to 10370 states and 32156 transitions. [2019-12-07 18:59:05,188 INFO L78 Accepts]: Start accepts. Automaton has 10370 states and 32156 transitions. Word has length 74 [2019-12-07 18:59:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:05,188 INFO L462 AbstractCegarLoop]: Abstraction has 10370 states and 32156 transitions. [2019-12-07 18:59:05,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:59:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 10370 states and 32156 transitions. [2019-12-07 18:59:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:59:05,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:05,198 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, 1, 1, 1] [2019-12-07 18:59:05,198 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2134876174, now seen corresponding path program 3 times [2019-12-07 18:59:05,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:05,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392502350] [2019-12-07 18:59:05,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:05,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392502350] [2019-12-07 18:59:05,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:05,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:59:05,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831924363] [2019-12-07 18:59:05,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:59:05,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:05,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:59:05,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:59:05,403 INFO L87 Difference]: Start difference. First operand 10370 states and 32156 transitions. Second operand 14 states. [2019-12-07 18:59:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:08,255 INFO L93 Difference]: Finished difference Result 20376 states and 62375 transitions. [2019-12-07 18:59:08,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 18:59:08,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-12-07 18:59:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:08,293 INFO L225 Difference]: With dead ends: 20376 [2019-12-07 18:59:08,293 INFO L226 Difference]: Without dead ends: 13329 [2019-12-07 18:59:08,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:59:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13329 states. [2019-12-07 18:59:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13329 to 10878. [2019-12-07 18:59:08,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10878 states. [2019-12-07 18:59:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10878 states to 10878 states and 33218 transitions. [2019-12-07 18:59:08,479 INFO L78 Accepts]: Start accepts. Automaton has 10878 states and 33218 transitions. Word has length 74 [2019-12-07 18:59:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:08,479 INFO L462 AbstractCegarLoop]: Abstraction has 10878 states and 33218 transitions. [2019-12-07 18:59:08,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:59:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 10878 states and 33218 transitions. [2019-12-07 18:59:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:59:08,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:08,488 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, 1, 1, 1] [2019-12-07 18:59:08,488 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1331529172, now seen corresponding path program 4 times [2019-12-07 18:59:08,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:08,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3347523] [2019-12-07 18:59:08,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:08,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3347523] [2019-12-07 18:59:08,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:08,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 18:59:08,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027437016] [2019-12-07 18:59:08,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:59:08,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:59:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:59:08,939 INFO L87 Difference]: Start difference. First operand 10878 states and 33218 transitions. Second operand 17 states. [2019-12-07 18:59:14,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:14,476 INFO L93 Difference]: Finished difference Result 16676 states and 49948 transitions. [2019-12-07 18:59:14,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:59:14,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-12-07 18:59:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:14,491 INFO L225 Difference]: With dead ends: 16676 [2019-12-07 18:59:14,491 INFO L226 Difference]: Without dead ends: 13737 [2019-12-07 18:59:14,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=1065, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:59:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-12-07 18:59:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 11338. [2019-12-07 18:59:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11338 states. [2019-12-07 18:59:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11338 states to 11338 states and 34373 transitions. [2019-12-07 18:59:14,681 INFO L78 Accepts]: Start accepts. Automaton has 11338 states and 34373 transitions. Word has length 74 [2019-12-07 18:59:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:14,682 INFO L462 AbstractCegarLoop]: Abstraction has 11338 states and 34373 transitions. [2019-12-07 18:59:14,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:59:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 11338 states and 34373 transitions. [2019-12-07 18:59:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:59:14,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:14,692 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, 1, 1, 1] [2019-12-07 18:59:14,692 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:14,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:14,692 INFO L82 PathProgramCache]: Analyzing trace with hash -381191204, now seen corresponding path program 5 times [2019-12-07 18:59:14,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:14,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134599696] [2019-12-07 18:59:14,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:14,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134599696] [2019-12-07 18:59:14,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:14,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:59:14,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238463275] [2019-12-07 18:59:14,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:59:14,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:59:14,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:59:14,923 INFO L87 Difference]: Start difference. First operand 11338 states and 34373 transitions. Second operand 16 states. [2019-12-07 18:59:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:16,431 INFO L93 Difference]: Finished difference Result 15404 states and 45821 transitions. [2019-12-07 18:59:16,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 18:59:16,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-07 18:59:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:16,445 INFO L225 Difference]: With dead ends: 15404 [2019-12-07 18:59:16,445 INFO L226 Difference]: Without dead ends: 13227 [2019-12-07 18:59:16,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:59:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13227 states. [2019-12-07 18:59:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13227 to 11368. [2019-12-07 18:59:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11368 states. [2019-12-07 18:59:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11368 states to 11368 states and 34372 transitions. [2019-12-07 18:59:16,626 INFO L78 Accepts]: Start accepts. Automaton has 11368 states and 34372 transitions. Word has length 74 [2019-12-07 18:59:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:16,627 INFO L462 AbstractCegarLoop]: Abstraction has 11368 states and 34372 transitions. [2019-12-07 18:59:16,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:59:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 11368 states and 34372 transitions. [2019-12-07 18:59:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:59:16,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:16,636 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, 1, 1, 1] [2019-12-07 18:59:16,636 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:16,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:16,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1530242152, now seen corresponding path program 6 times [2019-12-07 18:59:16,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:16,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509818986] [2019-12-07 18:59:16,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:16,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509818986] [2019-12-07 18:59:16,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:16,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:59:16,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752914419] [2019-12-07 18:59:16,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:59:16,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:59:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:59:16,860 INFO L87 Difference]: Start difference. First operand 11368 states and 34372 transitions. Second operand 16 states. [2019-12-07 18:59:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:18,151 INFO L93 Difference]: Finished difference Result 13586 states and 40546 transitions. [2019-12-07 18:59:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:59:18,151 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-07 18:59:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:18,165 INFO L225 Difference]: With dead ends: 13586 [2019-12-07 18:59:18,165 INFO L226 Difference]: Without dead ends: 12899 [2019-12-07 18:59:18,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2019-12-07 18:59:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12899 states. [2019-12-07 18:59:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12899 to 10854. [2019-12-07 18:59:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10854 states. [2019-12-07 18:59:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10854 states to 10854 states and 33003 transitions. [2019-12-07 18:59:18,342 INFO L78 Accepts]: Start accepts. Automaton has 10854 states and 33003 transitions. Word has length 74 [2019-12-07 18:59:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:18,342 INFO L462 AbstractCegarLoop]: Abstraction has 10854 states and 33003 transitions. [2019-12-07 18:59:18,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:59:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 10854 states and 33003 transitions. [2019-12-07 18:59:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:59:18,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:18,351 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, 1, 1, 1] [2019-12-07 18:59:18,351 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1397908254, now seen corresponding path program 7 times [2019-12-07 18:59:18,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:18,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587998900] [2019-12-07 18:59:18,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:18,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587998900] [2019-12-07 18:59:18,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:18,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:59:18,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015248] [2019-12-07 18:59:18,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:59:18,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:59:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:59:18,603 INFO L87 Difference]: Start difference. First operand 10854 states and 33003 transitions. Second operand 12 states. [2019-12-07 18:59:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:19,370 INFO L93 Difference]: Finished difference Result 16889 states and 50870 transitions. [2019-12-07 18:59:19,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 18:59:19,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-12-07 18:59:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:19,387 INFO L225 Difference]: With dead ends: 16889 [2019-12-07 18:59:19,387 INFO L226 Difference]: Without dead ends: 12847 [2019-12-07 18:59:19,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 18:59:19,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12847 states. [2019-12-07 18:59:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12847 to 10657. [2019-12-07 18:59:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10657 states. [2019-12-07 18:59:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10657 states to 10657 states and 32418 transitions. [2019-12-07 18:59:19,565 INFO L78 Accepts]: Start accepts. Automaton has 10657 states and 32418 transitions. Word has length 74 [2019-12-07 18:59:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:19,565 INFO L462 AbstractCegarLoop]: Abstraction has 10657 states and 32418 transitions. [2019-12-07 18:59:19,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:59:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10657 states and 32418 transitions. [2019-12-07 18:59:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:59:19,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:19,574 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, 1, 1, 1] [2019-12-07 18:59:19,574 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1515891926, now seen corresponding path program 8 times [2019-12-07 18:59:19,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:19,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420861001] [2019-12-07 18:59:19,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:20,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420861001] [2019-12-07 18:59:20,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:20,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 18:59:20,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673344875] [2019-12-07 18:59:20,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:59:20,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:20,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:59:20,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:59:20,135 INFO L87 Difference]: Start difference. First operand 10657 states and 32418 transitions. Second operand 21 states. [2019-12-07 18:59:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:24,754 INFO L93 Difference]: Finished difference Result 12776 states and 38383 transitions. [2019-12-07 18:59:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 18:59:24,754 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-12-07 18:59:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:24,767 INFO L225 Difference]: With dead ends: 12776 [2019-12-07 18:59:24,768 INFO L226 Difference]: Without dead ends: 12573 [2019-12-07 18:59:24,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=307, Invalid=2143, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 18:59:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12573 states. [2019-12-07 18:59:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12573 to 10601. [2019-12-07 18:59:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10601 states. [2019-12-07 18:59:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10601 states to 10601 states and 32276 transitions. [2019-12-07 18:59:24,944 INFO L78 Accepts]: Start accepts. Automaton has 10601 states and 32276 transitions. Word has length 74 [2019-12-07 18:59:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:24,944 INFO L462 AbstractCegarLoop]: Abstraction has 10601 states and 32276 transitions. [2019-12-07 18:59:24,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:59:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 10601 states and 32276 transitions. [2019-12-07 18:59:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:59:24,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:24,954 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, 1, 1, 1] [2019-12-07 18:59:24,954 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:24,954 INFO L82 PathProgramCache]: Analyzing trace with hash 372604844, now seen corresponding path program 9 times [2019-12-07 18:59:24,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:24,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654854787] [2019-12-07 18:59:24,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:59:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:59:25,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654854787] [2019-12-07 18:59:25,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:59:25,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:59:25,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746859410] [2019-12-07 18:59:25,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:59:25,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:59:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:59:25,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:59:25,032 INFO L87 Difference]: Start difference. First operand 10601 states and 32276 transitions. Second operand 8 states. [2019-12-07 18:59:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:59:25,219 INFO L93 Difference]: Finished difference Result 13234 states and 39437 transitions. [2019-12-07 18:59:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:59:25,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2019-12-07 18:59:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:59:25,233 INFO L225 Difference]: With dead ends: 13234 [2019-12-07 18:59:25,233 INFO L226 Difference]: Without dead ends: 12645 [2019-12-07 18:59:25,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:59:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12645 states. [2019-12-07 18:59:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12645 to 10383. [2019-12-07 18:59:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10383 states. [2019-12-07 18:59:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10383 states to 10383 states and 31650 transitions. [2019-12-07 18:59:25,412 INFO L78 Accepts]: Start accepts. Automaton has 10383 states and 31650 transitions. Word has length 74 [2019-12-07 18:59:25,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:59:25,412 INFO L462 AbstractCegarLoop]: Abstraction has 10383 states and 31650 transitions. [2019-12-07 18:59:25,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:59:25,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10383 states and 31650 transitions. [2019-12-07 18:59:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:59:25,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:59:25,422 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, 1, 1, 1] [2019-12-07 18:59:25,422 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:59:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:59:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1705874196, now seen corresponding path program 10 times [2019-12-07 18:59:25,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:59:25,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15764711] [2019-12-07 18:59:25,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:59:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:59:25,506 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:59:25,506 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:59:25,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1106] [1106] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= v_~y$flush_delayed~0_213 0) (= v_~main$tmp_guard0~0_40 0) (= 0 v_~y$r_buff1_thd3~0_199) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_191 0) (= v_~__unbuffered_p0_EBX~0_75 0) (= 0 v_~y$r_buff1_thd2~0_303) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard1~0_42 0) (= |v_ULTIMATE.start_main_~#t1755~0.offset_24| 0) (= v_~y$r_buff1_thd1~0_350 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1755~0.base_34|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1755~0.base_34| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1755~0.base_34|) |v_ULTIMATE.start_main_~#t1755~0.offset_24| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$r_buff0_thd2~0_539) (= v_~y$w_buff1_used~0_664 0) (= 0 v_~__unbuffered_cnt~0_85) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1755~0.base_34| 4)) (= v_~y$read_delayed~0_6 0) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t1755~0.base_34| 1)) (= 0 v_~__unbuffered_p0_EAX~0_70) (= v_~y$w_buff0_used~0_1110 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1755~0.base_34|) (= v_~x~0_49 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$w_buff0~0_519) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_451 0) (= 0 v_~weak$$choice0~0_172) (= v_~weak$$choice2~0_268 0) (= v_~y$mem_tmp~0_183 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~y$r_buff1_thd0~0_245 0) (= v_~y~0_341 0) (= v_~y$w_buff1~0_362 0) (= 0 v_~y$r_buff0_thd3~0_215) (= v_~__unbuffered_p1_EBX~0_51 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_20|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1755~0.base=|v_ULTIMATE.start_main_~#t1755~0.base_34|, ULTIMATE.start_main_~#t1757~0.offset=|v_ULTIMATE.start_main_~#t1757~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_77|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_75|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_183, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_199, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_451, ~y$flush_delayed~0=v_~y$flush_delayed~0_213, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_10|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_75, ULTIMATE.start_main_~#t1755~0.offset=|v_ULTIMATE.start_main_~#t1755~0.offset_24|, ULTIMATE.start_main_~#t1757~0.base=|v_ULTIMATE.start_main_~#t1757~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_172, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1756~0.base=|v_ULTIMATE.start_main_~#t1756~0.base_30|, ~y$w_buff1~0=v_~y$w_buff1~0_362, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1756~0.offset=|v_ULTIMATE.start_main_~#t1756~0.offset_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_539, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ~x~0=v_~x~0_49, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1110, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_89|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_519, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_215, ~y~0=v_~y~0_341, ULTIMATE.start_main_#t~nondet63=|v_ULTIMATE.start_main_#t~nondet63_22|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_10|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_303, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_19|, ~weak$$choice2~0=v_~weak$$choice2~0_268, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_664} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1755~0.base, ULTIMATE.start_main_~#t1757~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1755~0.offset, ULTIMATE.start_main_~#t1757~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1756~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1756~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet63, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:59:25,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1756~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1756~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1756~0.base_10|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1756~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1756~0.base_10|) |v_ULTIMATE.start_main_~#t1756~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1756~0.offset_9| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1756~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1756~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1756~0.base=|v_ULTIMATE.start_main_~#t1756~0.base_10|, ULTIMATE.start_main_~#t1756~0.offset=|v_ULTIMATE.start_main_~#t1756~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1756~0.base, ULTIMATE.start_main_~#t1756~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 18:59:25,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1080] [1080] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1757~0.base_12|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1757~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1757~0.base_12|) |v_ULTIMATE.start_main_~#t1757~0.offset_10| 2))) (= |v_ULTIMATE.start_main_~#t1757~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1757~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1757~0.base_12| 0)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1757~0.base_12| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1757~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ULTIMATE.start_main_~#t1757~0.offset=|v_ULTIMATE.start_main_~#t1757~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1757~0.base=|v_ULTIMATE.start_main_~#t1757~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_~#t1757~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1757~0.base, #length] because there is no mapped edge [2019-12-07 18:59:25,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1085] [1085] L5-->L776: Formula: (and (= ~y$r_buff0_thd3~0_In1216735863 ~y$r_buff1_thd3~0_Out1216735863) (= ~y$r_buff1_thd0~0_Out1216735863 ~y$r_buff0_thd0~0_In1216735863) (= |P1Thread1of1ForFork1_#t~nondet26_In1216735863| ~weak$$choice0~0_Out1216735863) (= ~weak$$choice2~0_Out1216735863 ~y$flush_delayed~0_Out1216735863) (= ~y~0_In1216735863 ~y$mem_tmp~0_Out1216735863) (= |P1Thread1of1ForFork1_#t~nondet27_In1216735863| ~weak$$choice2~0_Out1216735863) (= ~y$r_buff1_thd1~0_Out1216735863 ~y$r_buff0_thd1~0_In1216735863) (= 1 ~y$r_buff0_thd2~0_Out1216735863) (= ~y$r_buff1_thd2~0_Out1216735863 ~y$r_buff0_thd2~0_In1216735863) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1216735863))) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1216735863, P1Thread1of1ForFork1_#t~nondet26=|P1Thread1of1ForFork1_#t~nondet26_In1216735863|, P1Thread1of1ForFork1_#t~nondet27=|P1Thread1of1ForFork1_#t~nondet27_In1216735863|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1216735863, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1216735863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1216735863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1216735863, ~y~0=~y~0_In1216735863} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1216735863, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1216735863, ~weak$$choice0~0=~weak$$choice0~0_Out1216735863, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1216735863, ~y$mem_tmp~0=~y$mem_tmp~0_Out1216735863, P1Thread1of1ForFork1_#t~nondet26=|P1Thread1of1ForFork1_#t~nondet26_Out1216735863|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out1216735863, P1Thread1of1ForFork1_#t~nondet27=|P1Thread1of1ForFork1_#t~nondet27_Out1216735863|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1216735863, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1216735863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1216735863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1216735863, ~y$flush_delayed~0=~y$flush_delayed~0_Out1216735863, ~y~0=~y~0_In1216735863, ~weak$$choice2~0=~weak$$choice2~0_Out1216735863, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1216735863} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet26, ~y$r_buff1_thd3~0, P1Thread1of1ForFork1_#t~nondet27, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:59:25,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1446759201 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1446759201 256)))) (or (and (= ~y$w_buff0~0_In-1446759201 |P1Thread1of1ForFork1_#t~ite28_Out-1446759201|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1446759201| ~y$w_buff1~0_In-1446759201)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446759201, ~y$w_buff1~0=~y$w_buff1~0_In-1446759201, ~y$w_buff0~0=~y$w_buff0~0_In-1446759201, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1446759201} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446759201, ~y$w_buff1~0=~y$w_buff1~0_In-1446759201, ~y$w_buff0~0=~y$w_buff0~0_In-1446759201, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1446759201, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1446759201|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:59:25,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L776-4-->L777: Formula: (= v_~y~0_82 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_82, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:59:25,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L781-->L782: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~y$r_buff0_thd2~0_140 v_~y$r_buff0_thd2~0_139)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_7|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_7|, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 18:59:25,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-402734381 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out-402734381| ~y$mem_tmp~0_In-402734381)) (and .cse0 (= ~y~0_In-402734381 |P1Thread1of1ForFork1_#t~ite48_Out-402734381|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-402734381, ~y$flush_delayed~0=~y$flush_delayed~0_In-402734381, ~y~0=~y~0_In-402734381} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-402734381, ~y$flush_delayed~0=~y$flush_delayed~0_In-402734381, ~y~0=~y~0_In-402734381, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-402734381|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 18:59:25,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1149991222 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1149991222 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite55_Out-1149991222| ~y~0_In-1149991222) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite55_Out-1149991222| ~y$w_buff1~0_In-1149991222) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1149991222, ~y$w_buff1~0=~y$w_buff1~0_In-1149991222, ~y~0=~y~0_In-1149991222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149991222} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1149991222, ~y$w_buff1~0=~y$w_buff1~0_In-1149991222, P2Thread1of1ForFork2_#t~ite55=|P2Thread1of1ForFork2_#t~ite55_Out-1149991222|, ~y~0=~y~0_In-1149991222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149991222} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite55] because there is no mapped edge [2019-12-07 18:59:25,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L808-4-->L809: Formula: (= |v_P2Thread1of1ForFork2_#t~ite55_8| v_~y~0_39) InVars {P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_8|} OutVars{P2Thread1of1ForFork2_#t~ite56=|v_P2Thread1of1ForFork2_#t~ite56_13|, P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_7|, ~y~0=v_~y~0_39} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite56, P2Thread1of1ForFork2_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 18:59:25,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1836587979 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1836587979 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite57_Out1836587979| ~y$w_buff0_used~0_In1836587979)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite57_Out1836587979| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1836587979, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1836587979} OutVars{P2Thread1of1ForFork2_#t~ite57=|P2Thread1of1ForFork2_#t~ite57_Out1836587979|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1836587979, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1836587979} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite57] because there is no mapped edge [2019-12-07 18:59:25,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1128999656 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1128999656 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1128999656 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1128999656 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite58_Out1128999656| ~y$w_buff1_used~0_In1128999656) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite58_Out1128999656|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1128999656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1128999656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1128999656, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128999656} OutVars{P2Thread1of1ForFork2_#t~ite58=|P2Thread1of1ForFork2_#t~ite58_Out1128999656|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1128999656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1128999656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1128999656, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128999656} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite58] because there is no mapped edge [2019-12-07 18:59:25,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-966348272 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-966348272 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite59_Out-966348272| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite59_Out-966348272| ~y$r_buff0_thd3~0_In-966348272) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-966348272, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-966348272} OutVars{P2Thread1of1ForFork2_#t~ite59=|P2Thread1of1ForFork2_#t~ite59_Out-966348272|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-966348272, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-966348272} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite59] because there is no mapped edge [2019-12-07 18:59:25,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In151948816 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In151948816 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In151948816 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In151948816 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite60_Out151948816| ~y$r_buff1_thd3~0_In151948816) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite60_Out151948816| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In151948816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In151948816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In151948816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In151948816} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In151948816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In151948816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In151948816, P2Thread1of1ForFork2_#t~ite60=|P2Thread1of1ForFork2_#t~ite60_Out151948816|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In151948816} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite60] because there is no mapped edge [2019-12-07 18:59:25,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1066] [1066] L812-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite60_18| v_~y$r_buff1_thd3~0_84)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P2Thread1of1ForFork2_#t~ite60=|v_P2Thread1of1ForFork2_#t~ite60_18|} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_84, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork2_#t~ite60=|v_P2Thread1of1ForFork2_#t~ite60_17|, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#t~ite60, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 18:59:25,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-696449470 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-696449470 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-696449470 |P1Thread1of1ForFork1_#t~ite51_Out-696449470|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-696449470|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-696449470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696449470} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-696449470, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-696449470|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696449470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 18:59:25,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-23774792 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-23774792 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-23774792 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-23774792 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out-23774792| ~y$w_buff1_used~0_In-23774792) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-23774792|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23774792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23774792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23774792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23774792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23774792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23774792, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-23774792|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23774792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23774792} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 18:59:25,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] L794-->L795: Formula: (let ((.cse0 (= ~y$r_buff0_thd2~0_In-1206853946 ~y$r_buff0_thd2~0_Out-1206853946)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1206853946 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1206853946 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~y$r_buff0_thd2~0_Out-1206853946) (not .cse2) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1206853946, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1206853946} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1206853946|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1206853946, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1206853946} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:59:25,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1363146195 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1363146195 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1363146195 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1363146195 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out1363146195|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In1363146195 |P1Thread1of1ForFork1_#t~ite54_Out1363146195|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1363146195, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1363146195, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1363146195, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1363146195} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1363146195, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1363146195, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1363146195, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1363146195|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1363146195} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 18:59:25,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_207 |v_P1Thread1of1ForFork1_#t~ite54_30|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_207, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 18:59:25,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In227906982 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out227906982| ~y$mem_tmp~0_In227906982) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out227906982| ~y~0_In227906982)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In227906982, ~y$flush_delayed~0=~y$flush_delayed~0_In227906982, ~y~0=~y~0_In227906982} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In227906982, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out227906982|, ~y$flush_delayed~0=~y$flush_delayed~0_In227906982, ~y~0=~y~0_In227906982} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 18:59:25,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1076] [1076] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_50 (+ v_~__unbuffered_cnt~0_51 1)) (= v_~y~0_239 |v_P0Thread1of1ForFork0_#t~ite25_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$flush_delayed~0_143 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_31|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_143, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~y~0=v_~y~0_239} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 18:59:25,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L839-->L841-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= (mod v_~y$w_buff0_used~0_336 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_336, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_336, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:59:25,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1034] [1034] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1040609227 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1040609227 256)))) (or (and (= ~y$w_buff1~0_In1040609227 |ULTIMATE.start_main_#t~ite64_Out1040609227|) (not .cse0) (not .cse1)) (and (= ~y~0_In1040609227 |ULTIMATE.start_main_#t~ite64_Out1040609227|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1040609227, ~y~0=~y~0_In1040609227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1040609227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1040609227} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1040609227, ~y~0=~y~0_In1040609227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1040609227, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1040609227|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1040609227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:59:25,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L841-4-->L842: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite64_11|) InVars {ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_11|} OutVars{~y~0=v_~y~0_43, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_10|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_12|} AuxVars[] AssignedVars[~y~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 18:59:25,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1039] [1039] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-238968068 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-238968068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out-238968068| ~y$w_buff0_used~0_In-238968068) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite66_Out-238968068| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-238968068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-238968068} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-238968068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-238968068, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-238968068|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 18:59:25,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1045] [1045] L843-->L843-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1659670332 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1659670332 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1659670332 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1659670332 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite67_Out-1659670332| ~y$w_buff1_used~0_In-1659670332)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1659670332|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659670332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659670332, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1659670332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1659670332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659670332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659670332, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1659670332|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1659670332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1659670332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 18:59:25,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2141476581 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2141476581 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-2141476581| ~y$r_buff0_thd0~0_In-2141476581) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-2141476581| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141476581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2141476581} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141476581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2141476581, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-2141476581|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 18:59:25,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L845-->L845-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1023999172 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1023999172 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1023999172 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1023999172 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite69_Out1023999172| ~y$r_buff1_thd0~0_In1023999172) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite69_Out1023999172|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1023999172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1023999172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1023999172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1023999172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1023999172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1023999172, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1023999172|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1023999172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1023999172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-07 18:59:25,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~y$r_buff1_thd0~0_177 |v_ULTIMATE.start_main_#t~ite69_39|) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_32 0) (= 1 v_~__unbuffered_p0_EAX~0_41))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_38|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:59:25,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:59:25 BasicIcfg [2019-12-07 18:59:25,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:59:25,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:59:25,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:59:25,597 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:59:25,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:54:19" (3/4) ... [2019-12-07 18:59:25,600 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:59:25,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1106] [1106] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= v_~y$flush_delayed~0_213 0) (= v_~main$tmp_guard0~0_40 0) (= 0 v_~y$r_buff1_thd3~0_199) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_191 0) (= v_~__unbuffered_p0_EBX~0_75 0) (= 0 v_~y$r_buff1_thd2~0_303) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard1~0_42 0) (= |v_ULTIMATE.start_main_~#t1755~0.offset_24| 0) (= v_~y$r_buff1_thd1~0_350 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1755~0.base_34|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1755~0.base_34| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1755~0.base_34|) |v_ULTIMATE.start_main_~#t1755~0.offset_24| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$r_buff0_thd2~0_539) (= v_~y$w_buff1_used~0_664 0) (= 0 v_~__unbuffered_cnt~0_85) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1755~0.base_34| 4)) (= v_~y$read_delayed~0_6 0) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t1755~0.base_34| 1)) (= 0 v_~__unbuffered_p0_EAX~0_70) (= v_~y$w_buff0_used~0_1110 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1755~0.base_34|) (= v_~x~0_49 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$w_buff0~0_519) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_451 0) (= 0 v_~weak$$choice0~0_172) (= v_~weak$$choice2~0_268 0) (= v_~y$mem_tmp~0_183 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~y$r_buff1_thd0~0_245 0) (= v_~y~0_341 0) (= v_~y$w_buff1~0_362 0) (= 0 v_~y$r_buff0_thd3~0_215) (= v_~__unbuffered_p1_EBX~0_51 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_20|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1755~0.base=|v_ULTIMATE.start_main_~#t1755~0.base_34|, ULTIMATE.start_main_~#t1757~0.offset=|v_ULTIMATE.start_main_~#t1757~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_77|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_75|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_183, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_199, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_451, ~y$flush_delayed~0=v_~y$flush_delayed~0_213, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_10|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_75, ULTIMATE.start_main_~#t1755~0.offset=|v_ULTIMATE.start_main_~#t1755~0.offset_24|, ULTIMATE.start_main_~#t1757~0.base=|v_ULTIMATE.start_main_~#t1757~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_172, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1756~0.base=|v_ULTIMATE.start_main_~#t1756~0.base_30|, ~y$w_buff1~0=v_~y$w_buff1~0_362, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1756~0.offset=|v_ULTIMATE.start_main_~#t1756~0.offset_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_539, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ~x~0=v_~x~0_49, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1110, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_89|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_519, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_215, ~y~0=v_~y~0_341, ULTIMATE.start_main_#t~nondet63=|v_ULTIMATE.start_main_#t~nondet63_22|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_10|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_303, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_19|, ~weak$$choice2~0=v_~weak$$choice2~0_268, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_664} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1755~0.base, ULTIMATE.start_main_~#t1757~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1755~0.offset, ULTIMATE.start_main_~#t1757~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1756~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1756~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet63, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:59:25,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1756~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1756~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1756~0.base_10|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1756~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1756~0.base_10|) |v_ULTIMATE.start_main_~#t1756~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1756~0.offset_9| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1756~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1756~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1756~0.base=|v_ULTIMATE.start_main_~#t1756~0.base_10|, ULTIMATE.start_main_~#t1756~0.offset=|v_ULTIMATE.start_main_~#t1756~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1756~0.base, ULTIMATE.start_main_~#t1756~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 18:59:25,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1080] [1080] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1757~0.base_12|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1757~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1757~0.base_12|) |v_ULTIMATE.start_main_~#t1757~0.offset_10| 2))) (= |v_ULTIMATE.start_main_~#t1757~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1757~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1757~0.base_12| 0)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1757~0.base_12| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1757~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ULTIMATE.start_main_~#t1757~0.offset=|v_ULTIMATE.start_main_~#t1757~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1757~0.base=|v_ULTIMATE.start_main_~#t1757~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_~#t1757~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1757~0.base, #length] because there is no mapped edge [2019-12-07 18:59:25,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1085] [1085] L5-->L776: Formula: (and (= ~y$r_buff0_thd3~0_In1216735863 ~y$r_buff1_thd3~0_Out1216735863) (= ~y$r_buff1_thd0~0_Out1216735863 ~y$r_buff0_thd0~0_In1216735863) (= |P1Thread1of1ForFork1_#t~nondet26_In1216735863| ~weak$$choice0~0_Out1216735863) (= ~weak$$choice2~0_Out1216735863 ~y$flush_delayed~0_Out1216735863) (= ~y~0_In1216735863 ~y$mem_tmp~0_Out1216735863) (= |P1Thread1of1ForFork1_#t~nondet27_In1216735863| ~weak$$choice2~0_Out1216735863) (= ~y$r_buff1_thd1~0_Out1216735863 ~y$r_buff0_thd1~0_In1216735863) (= 1 ~y$r_buff0_thd2~0_Out1216735863) (= ~y$r_buff1_thd2~0_Out1216735863 ~y$r_buff0_thd2~0_In1216735863) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1216735863))) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1216735863, P1Thread1of1ForFork1_#t~nondet26=|P1Thread1of1ForFork1_#t~nondet26_In1216735863|, P1Thread1of1ForFork1_#t~nondet27=|P1Thread1of1ForFork1_#t~nondet27_In1216735863|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1216735863, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1216735863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1216735863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1216735863, ~y~0=~y~0_In1216735863} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1216735863, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1216735863, ~weak$$choice0~0=~weak$$choice0~0_Out1216735863, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1216735863, ~y$mem_tmp~0=~y$mem_tmp~0_Out1216735863, P1Thread1of1ForFork1_#t~nondet26=|P1Thread1of1ForFork1_#t~nondet26_Out1216735863|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out1216735863, P1Thread1of1ForFork1_#t~nondet27=|P1Thread1of1ForFork1_#t~nondet27_Out1216735863|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1216735863, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1216735863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1216735863, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1216735863, ~y$flush_delayed~0=~y$flush_delayed~0_Out1216735863, ~y~0=~y~0_In1216735863, ~weak$$choice2~0=~weak$$choice2~0_Out1216735863, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1216735863} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet26, ~y$r_buff1_thd3~0, P1Thread1of1ForFork1_#t~nondet27, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:59:25,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1446759201 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1446759201 256)))) (or (and (= ~y$w_buff0~0_In-1446759201 |P1Thread1of1ForFork1_#t~ite28_Out-1446759201|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1446759201| ~y$w_buff1~0_In-1446759201)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446759201, ~y$w_buff1~0=~y$w_buff1~0_In-1446759201, ~y$w_buff0~0=~y$w_buff0~0_In-1446759201, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1446759201} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446759201, ~y$w_buff1~0=~y$w_buff1~0_In-1446759201, ~y$w_buff0~0=~y$w_buff0~0_In-1446759201, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1446759201, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1446759201|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:59:25,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L776-4-->L777: Formula: (= v_~y~0_82 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_82, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:59:25,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L781-->L782: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~y$r_buff0_thd2~0_140 v_~y$r_buff0_thd2~0_139)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_7|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_7|, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 18:59:25,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-402734381 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite48_Out-402734381| ~y$mem_tmp~0_In-402734381)) (and .cse0 (= ~y~0_In-402734381 |P1Thread1of1ForFork1_#t~ite48_Out-402734381|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-402734381, ~y$flush_delayed~0=~y$flush_delayed~0_In-402734381, ~y~0=~y~0_In-402734381} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-402734381, ~y$flush_delayed~0=~y$flush_delayed~0_In-402734381, ~y~0=~y~0_In-402734381, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-402734381|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 18:59:25,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1149991222 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1149991222 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite55_Out-1149991222| ~y~0_In-1149991222) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite55_Out-1149991222| ~y$w_buff1~0_In-1149991222) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1149991222, ~y$w_buff1~0=~y$w_buff1~0_In-1149991222, ~y~0=~y~0_In-1149991222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149991222} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1149991222, ~y$w_buff1~0=~y$w_buff1~0_In-1149991222, P2Thread1of1ForFork2_#t~ite55=|P2Thread1of1ForFork2_#t~ite55_Out-1149991222|, ~y~0=~y~0_In-1149991222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1149991222} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite55] because there is no mapped edge [2019-12-07 18:59:25,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L808-4-->L809: Formula: (= |v_P2Thread1of1ForFork2_#t~ite55_8| v_~y~0_39) InVars {P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_8|} OutVars{P2Thread1of1ForFork2_#t~ite56=|v_P2Thread1of1ForFork2_#t~ite56_13|, P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_7|, ~y~0=v_~y~0_39} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite56, P2Thread1of1ForFork2_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 18:59:25,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1836587979 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1836587979 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite57_Out1836587979| ~y$w_buff0_used~0_In1836587979)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite57_Out1836587979| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1836587979, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1836587979} OutVars{P2Thread1of1ForFork2_#t~ite57=|P2Thread1of1ForFork2_#t~ite57_Out1836587979|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1836587979, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1836587979} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite57] because there is no mapped edge [2019-12-07 18:59:25,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1128999656 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1128999656 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1128999656 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1128999656 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite58_Out1128999656| ~y$w_buff1_used~0_In1128999656) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite58_Out1128999656|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1128999656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1128999656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1128999656, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128999656} OutVars{P2Thread1of1ForFork2_#t~ite58=|P2Thread1of1ForFork2_#t~ite58_Out1128999656|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1128999656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1128999656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1128999656, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1128999656} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite58] because there is no mapped edge [2019-12-07 18:59:25,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-966348272 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-966348272 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite59_Out-966348272| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite59_Out-966348272| ~y$r_buff0_thd3~0_In-966348272) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-966348272, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-966348272} OutVars{P2Thread1of1ForFork2_#t~ite59=|P2Thread1of1ForFork2_#t~ite59_Out-966348272|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-966348272, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-966348272} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite59] because there is no mapped edge [2019-12-07 18:59:25,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In151948816 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In151948816 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In151948816 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In151948816 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite60_Out151948816| ~y$r_buff1_thd3~0_In151948816) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite60_Out151948816| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In151948816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In151948816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In151948816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In151948816} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In151948816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In151948816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In151948816, P2Thread1of1ForFork2_#t~ite60=|P2Thread1of1ForFork2_#t~ite60_Out151948816|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In151948816} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite60] because there is no mapped edge [2019-12-07 18:59:25,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1066] [1066] L812-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite60_18| v_~y$r_buff1_thd3~0_84)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P2Thread1of1ForFork2_#t~ite60=|v_P2Thread1of1ForFork2_#t~ite60_18|} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_84, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork2_#t~ite60=|v_P2Thread1of1ForFork2_#t~ite60_17|, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#t~ite60, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 18:59:25,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-696449470 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-696449470 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-696449470 |P1Thread1of1ForFork1_#t~ite51_Out-696449470|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-696449470|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-696449470, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696449470} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-696449470, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-696449470|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696449470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 18:59:25,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-23774792 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-23774792 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-23774792 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-23774792 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out-23774792| ~y$w_buff1_used~0_In-23774792) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-23774792|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23774792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23774792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23774792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23774792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23774792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23774792, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-23774792|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23774792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23774792} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 18:59:25,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] L794-->L795: Formula: (let ((.cse0 (= ~y$r_buff0_thd2~0_In-1206853946 ~y$r_buff0_thd2~0_Out-1206853946)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1206853946 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1206853946 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= 0 ~y$r_buff0_thd2~0_Out-1206853946) (not .cse2) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1206853946, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1206853946} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1206853946|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1206853946, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1206853946} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:59:25,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1363146195 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1363146195 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1363146195 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1363146195 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out1363146195|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In1363146195 |P1Thread1of1ForFork1_#t~ite54_Out1363146195|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1363146195, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1363146195, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1363146195, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1363146195} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1363146195, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1363146195, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1363146195, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1363146195|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1363146195} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 18:59:25,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_207 |v_P1Thread1of1ForFork1_#t~ite54_30|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_207, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 18:59:25,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In227906982 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite25_Out227906982| ~y$mem_tmp~0_In227906982) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out227906982| ~y~0_In227906982)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In227906982, ~y$flush_delayed~0=~y$flush_delayed~0_In227906982, ~y~0=~y~0_In227906982} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In227906982, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out227906982|, ~y$flush_delayed~0=~y$flush_delayed~0_In227906982, ~y~0=~y~0_In227906982} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 18:59:25,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1076] [1076] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_50 (+ v_~__unbuffered_cnt~0_51 1)) (= v_~y~0_239 |v_P0Thread1of1ForFork0_#t~ite25_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$flush_delayed~0_143 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_31|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_143, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~y~0=v_~y~0_239} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 18:59:25,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L839-->L841-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= (mod v_~y$w_buff0_used~0_336 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_336, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_336, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:59:25,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1034] [1034] L841-2-->L841-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1040609227 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1040609227 256)))) (or (and (= ~y$w_buff1~0_In1040609227 |ULTIMATE.start_main_#t~ite64_Out1040609227|) (not .cse0) (not .cse1)) (and (= ~y~0_In1040609227 |ULTIMATE.start_main_#t~ite64_Out1040609227|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1040609227, ~y~0=~y~0_In1040609227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1040609227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1040609227} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1040609227, ~y~0=~y~0_In1040609227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1040609227, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1040609227|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1040609227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:59:25,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L841-4-->L842: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite64_11|) InVars {ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_11|} OutVars{~y~0=v_~y~0_43, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_10|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_12|} AuxVars[] AssignedVars[~y~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 18:59:25,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1039] [1039] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-238968068 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-238968068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out-238968068| ~y$w_buff0_used~0_In-238968068) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite66_Out-238968068| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-238968068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-238968068} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-238968068, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-238968068, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-238968068|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 18:59:25,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1045] [1045] L843-->L843-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1659670332 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1659670332 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1659670332 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1659670332 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite67_Out-1659670332| ~y$w_buff1_used~0_In-1659670332)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite67_Out-1659670332|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659670332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659670332, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1659670332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1659670332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659670332, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659670332, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1659670332|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1659670332, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1659670332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 18:59:25,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2141476581 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2141476581 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out-2141476581| ~y$r_buff0_thd0~0_In-2141476581) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite68_Out-2141476581| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141476581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2141476581} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2141476581, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2141476581, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-2141476581|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 18:59:25,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L845-->L845-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1023999172 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1023999172 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1023999172 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1023999172 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite69_Out1023999172| ~y$r_buff1_thd0~0_In1023999172) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite69_Out1023999172|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1023999172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1023999172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1023999172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1023999172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1023999172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1023999172, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1023999172|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1023999172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1023999172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-07 18:59:25,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~y$r_buff1_thd0~0_177 |v_ULTIMATE.start_main_#t~ite69_39|) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_32 0) (= 1 v_~__unbuffered_p0_EAX~0_41))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_38|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:59:25,690 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4216cb53-4034-41e9-8ced-ce19881c3fdf/bin/uautomizer/witness.graphml [2019-12-07 18:59:25,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:59:25,691 INFO L168 Benchmark]: Toolchain (without parser) took 307041.53 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 937.1 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-12-07 18:59:25,691 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:59:25,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 937.1 MB in the beginning and 1.0 GB in the end (delta: -105.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:25,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:59:25,692 INFO L168 Benchmark]: Boogie Preprocessor took 26.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:25,692 INFO L168 Benchmark]: RCFGBuilder took 464.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 978.1 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:25,692 INFO L168 Benchmark]: TraceAbstraction took 306006.71 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 978.1 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-12-07 18:59:25,693 INFO L168 Benchmark]: Witness Printer took 93.07 ms. Allocated memory is still 7.8 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:25,694 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 937.1 MB in the beginning and 1.0 GB in the end (delta: -105.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.13 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 464.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 978.1 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 306006.71 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 978.1 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 93.07 ms. Allocated memory is still 7.8 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 206 ProgramPointsBefore, 119 ProgramPointsAfterwards, 258 TransitionsBefore, 140 TransitionsAfterwards, 32698 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 13704 VarBasedMoverChecksPositive, 346 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 414 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 172435 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1755, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1756, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1757, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 1 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L776] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 [L788] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=1, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 197 locations, 2 error locations. Result: UNSAFE, OverallTime: 305.8s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 54.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6781 SDtfs, 10630 SDslu, 30692 SDs, 0 SdLazy, 25661 SolverSat, 548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 61 SyntacticMatches, 15 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458686occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 131.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 289491 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1337 ConstructedInterpolants, 0 QuantifiedInterpolants, 641597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...