./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/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 0fa591f2fa613ae5722b1eaacfa39b14021b1b6d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:10:42,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:10:42,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:10:42,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:10:42,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:10:42,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:10:42,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:10:42,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:10:42,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:10:42,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:10:42,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:10:42,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:10:42,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:10:42,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:10:42,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:10:42,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:10:42,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:10:42,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:10:42,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:10:42,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:10:42,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:10:42,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:10:42,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:10:42,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:10:42,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:10:42,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:10:42,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:10:42,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:10:42,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:10:42,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:10:42,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:10:42,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:10:42,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:10:42,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:10:42,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:10:42,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:10:42,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:10:42,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:10:42,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:10:42,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:10:42,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:10:42,122 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:10:42,131 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:10:42,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:10:42,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:10:42,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:10:42,132 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:10:42,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:10:42,133 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:10:42,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:10:42,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:10:42,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:10:42,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:10:42,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:10:42,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:10:42,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:10:42,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:10:42,134 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:10:42,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:10:42,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:10:42,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:10:42,134 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:10:42,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:10:42,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:10:42,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:10:42,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:10:42,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:10:42,135 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:10:42,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:10:42,135 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:10:42,135 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:10:42,135 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_65295ef3-2908-410f-bfe3-de6d6953730c/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 -> 0fa591f2fa613ae5722b1eaacfa39b14021b1b6d [2019-12-07 17:10:42,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:10:42,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:10:42,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:10:42,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:10:42,246 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:10:42,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix018_power.opt.i [2019-12-07 17:10:42,287 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/data/3b4c6cc08/dd08ef338e7a4f7284fa297bffd6a855/FLAGc2575eafa [2019-12-07 17:10:42,769 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:10:42,770 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/sv-benchmarks/c/pthread-wmm/mix018_power.opt.i [2019-12-07 17:10:42,781 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/data/3b4c6cc08/dd08ef338e7a4f7284fa297bffd6a855/FLAGc2575eafa [2019-12-07 17:10:42,790 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/data/3b4c6cc08/dd08ef338e7a4f7284fa297bffd6a855 [2019-12-07 17:10:42,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:10:42,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:10:42,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:42,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:10:42,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:10:42,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:42" (1/1) ... [2019-12-07 17:10:42,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:42, skipping insertion in model container [2019-12-07 17:10:42,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:42" (1/1) ... [2019-12-07 17:10:42,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:10:42,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:10:43,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:43,091 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:10:43,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:43,185 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:10:43,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43 WrapperNode [2019-12-07 17:10:43,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:43,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:10:43,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:10:43,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:10:43,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:10:43,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:10:43,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:10:43,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:10:43,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... [2019-12-07 17:10:43,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:10:43,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:10:43,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:10:43,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:10:43,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:10:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:10:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:10:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:10:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:10:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:10:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:10:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:10:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:10:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:10:43,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:10:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:10:43,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:10:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:10:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:10:43,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:10:43,305 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:10:43,707 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:10:43,708 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:10:43,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:43 BoogieIcfgContainer [2019-12-07 17:10:43,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:10:43,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:10:43,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:10:43,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:10:43,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:10:42" (1/3) ... [2019-12-07 17:10:43,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a722fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:43, skipping insertion in model container [2019-12-07 17:10:43,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:43" (2/3) ... [2019-12-07 17:10:43,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a722fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:43, skipping insertion in model container [2019-12-07 17:10:43,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:43" (3/3) ... [2019-12-07 17:10:43,714 INFO L109 eAbstractionObserver]: Analyzing ICFG mix018_power.opt.i [2019-12-07 17:10:43,720 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:10:43,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:10:43,726 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:10:43,727 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:10:43,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,758 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,761 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,762 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,776 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,776 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,776 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,777 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,777 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,781 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,782 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,783 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,784 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,785 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,786 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,787 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,788 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:43,801 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:10:43,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:10:43,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:10:43,814 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:10:43,814 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:10:43,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:10:43,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:10:43,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:10:43,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:10:43,829 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 17:10:43,830 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 17:10:43,908 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 17:10:43,908 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:10:43,921 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:10:43,944 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 17:10:43,986 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 17:10:43,986 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:10:43,995 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:10:44,021 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 17:10:44,021 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:10:47,704 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 17:10:48,007 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 17:10:48,128 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 17:10:48,128 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 17:10:48,131 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 17:10:56,384 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 17:10:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 17:10:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:10:56,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:56,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:56,391 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 17:10:56,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:56,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585725886] [2019-12-07 17:10:56,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:56,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585725886] [2019-12-07 17:10:56,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:56,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:10:56,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608279269] [2019-12-07 17:10:56,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:56,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:56,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:56,569 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 17:10:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:57,282 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 17:10:57,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:57,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:10:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:57,781 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 17:10:57,781 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 17:10:57,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 17:11:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 17:11:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 17:11:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 17:11:00,815 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 17:11:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:00,816 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 17:11:00,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:11:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 17:11:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:11:00,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:00,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:00,823 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:00,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:00,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 17:11:00,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:00,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918747017] [2019-12-07 17:11:00,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:00,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918747017] [2019-12-07 17:11:00,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:00,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:11:00,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309733708] [2019-12-07 17:11:00,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:11:00,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:11:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:11:00,896 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 17:11:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:02,929 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 17:11:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:11:02,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:11:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:03,287 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 17:11:03,287 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 17:11:03,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:11:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 17:11:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 17:11:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 17:11:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 17:11:07,027 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 17:11:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:07,027 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 17:11:07,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:11:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 17:11:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:11:07,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:07,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:07,034 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 17:11:07,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:07,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333977284] [2019-12-07 17:11:07,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:07,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333977284] [2019-12-07 17:11:07,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:07,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:11:07,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860368151] [2019-12-07 17:11:07,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:11:07,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:07,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:11:07,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:11:07,087 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 17:11:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:08,213 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 17:11:08,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:11:08,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:11:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:08,629 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 17:11:08,629 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 17:11:08,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:11:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 17:11:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 17:11:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 17:11:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 17:11:14,842 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 17:11:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:14,842 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 17:11:14,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:11:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 17:11:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:11:14,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:14,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:14,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 17:11:14,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:14,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804188770] [2019-12-07 17:11:14,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:14,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804188770] [2019-12-07 17:11:14,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:14,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:11:14,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186524329] [2019-12-07 17:11:14,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:11:14,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:14,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:11:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:11:14,878 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 17:11:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:16,070 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 17:11:16,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:11:16,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:11:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:16,759 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 17:11:16,760 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 17:11:16,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:11:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 17:11:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 17:11:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 17:11:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 17:11:25,430 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 17:11:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:25,430 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 17:11:25,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:11:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 17:11:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:11:25,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:25,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:25,445 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:25,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 17:11:25,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:25,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862600689] [2019-12-07 17:11:25,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:25,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862600689] [2019-12-07 17:11:25,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:25,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:11:25,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524715832] [2019-12-07 17:11:25,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:11:25,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:11:25,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:11:25,858 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 17:11:26,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:26,866 INFO L93 Difference]: Finished difference Result 207942 states and 891892 transitions. [2019-12-07 17:11:26,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:11:26,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:11:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:27,460 INFO L225 Difference]: With dead ends: 207942 [2019-12-07 17:11:27,460 INFO L226 Difference]: Without dead ends: 207942 [2019-12-07 17:11:27,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:11:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207942 states. [2019-12-07 17:11:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207942 to 205878. [2019-12-07 17:11:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205878 states. [2019-12-07 17:11:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205878 states to 205878 states and 883844 transitions. [2019-12-07 17:11:36,751 INFO L78 Accepts]: Start accepts. Automaton has 205878 states and 883844 transitions. Word has length 20 [2019-12-07 17:11:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:36,751 INFO L462 AbstractCegarLoop]: Abstraction has 205878 states and 883844 transitions. [2019-12-07 17:11:36,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:11:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 205878 states and 883844 transitions. [2019-12-07 17:11:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:11:36,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:36,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:36,761 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1422939487, now seen corresponding path program 1 times [2019-12-07 17:11:36,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:36,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122598365] [2019-12-07 17:11:36,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:36,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122598365] [2019-12-07 17:11:36,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:36,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:11:36,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590981975] [2019-12-07 17:11:36,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:11:36,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:36,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:11:36,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:11:36,819 INFO L87 Difference]: Start difference. First operand 205878 states and 883844 transitions. Second operand 3 states. [2019-12-07 17:11:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:37,961 INFO L93 Difference]: Finished difference Result 271349 states and 1099719 transitions. [2019-12-07 17:11:37,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:11:37,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:11:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:38,663 INFO L225 Difference]: With dead ends: 271349 [2019-12-07 17:11:38,663 INFO L226 Difference]: Without dead ends: 270911 [2019-12-07 17:11:38,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:11:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270911 states. [2019-12-07 17:11:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270911 to 264871. [2019-12-07 17:11:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264871 states. [2019-12-07 17:11:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264871 states to 264871 states and 1082715 transitions. [2019-12-07 17:11:46,153 INFO L78 Accepts]: Start accepts. Automaton has 264871 states and 1082715 transitions. Word has length 20 [2019-12-07 17:11:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:46,153 INFO L462 AbstractCegarLoop]: Abstraction has 264871 states and 1082715 transitions. [2019-12-07 17:11:46,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:11:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 264871 states and 1082715 transitions. [2019-12-07 17:11:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:11:46,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:46,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:46,166 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:46,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:46,166 INFO L82 PathProgramCache]: Analyzing trace with hash -346227298, now seen corresponding path program 1 times [2019-12-07 17:11:46,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:46,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346047804] [2019-12-07 17:11:46,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:46,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346047804] [2019-12-07 17:11:46,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:46,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:11:46,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197435291] [2019-12-07 17:11:46,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:11:46,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:46,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:11:46,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:11:46,202 INFO L87 Difference]: Start difference. First operand 264871 states and 1082715 transitions. Second operand 3 states. [2019-12-07 17:11:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:47,287 INFO L93 Difference]: Finished difference Result 258275 states and 1056589 transitions. [2019-12-07 17:11:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:11:47,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:11:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:47,953 INFO L225 Difference]: With dead ends: 258275 [2019-12-07 17:11:47,953 INFO L226 Difference]: Without dead ends: 258275 [2019-12-07 17:11:47,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:11:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258275 states. [2019-12-07 17:11:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258275 to 221554. [2019-12-07 17:11:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221554 states. [2019-12-07 17:11:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221554 states to 221554 states and 931574 transitions. [2019-12-07 17:11:57,489 INFO L78 Accepts]: Start accepts. Automaton has 221554 states and 931574 transitions. Word has length 21 [2019-12-07 17:11:57,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:57,489 INFO L462 AbstractCegarLoop]: Abstraction has 221554 states and 931574 transitions. [2019-12-07 17:11:57,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:11:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 221554 states and 931574 transitions. [2019-12-07 17:11:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:11:57,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:57,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:57,501 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:57,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:57,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 17:11:57,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:57,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753530861] [2019-12-07 17:11:57,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:57,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753530861] [2019-12-07 17:11:57,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:57,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:11:57,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477506204] [2019-12-07 17:11:57,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:11:57,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:57,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:11:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:11:57,528 INFO L87 Difference]: Start difference. First operand 221554 states and 931574 transitions. Second operand 4 states. [2019-12-07 17:11:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:59,394 INFO L93 Difference]: Finished difference Result 275045 states and 1145051 transitions. [2019-12-07 17:11:59,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:11:59,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:11:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:00,088 INFO L225 Difference]: With dead ends: 275045 [2019-12-07 17:12:00,088 INFO L226 Difference]: Without dead ends: 274977 [2019-12-07 17:12:00,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274977 states. [2019-12-07 17:12:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274977 to 225042. [2019-12-07 17:12:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225042 states. [2019-12-07 17:12:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225042 states to 225042 states and 945884 transitions. [2019-12-07 17:12:06,580 INFO L78 Accepts]: Start accepts. Automaton has 225042 states and 945884 transitions. Word has length 21 [2019-12-07 17:12:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:06,581 INFO L462 AbstractCegarLoop]: Abstraction has 225042 states and 945884 transitions. [2019-12-07 17:12:06,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 225042 states and 945884 transitions. [2019-12-07 17:12:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:12:06,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:06,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:06,608 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:06,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:06,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-07 17:12:06,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:06,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618251939] [2019-12-07 17:12:06,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:06,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618251939] [2019-12-07 17:12:06,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:06,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:06,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138688582] [2019-12-07 17:12:06,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:12:06,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:06,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:12:06,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:06,648 INFO L87 Difference]: Start difference. First operand 225042 states and 945884 transitions. Second operand 5 states. [2019-12-07 17:12:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:08,800 INFO L93 Difference]: Finished difference Result 319033 states and 1317689 transitions. [2019-12-07 17:12:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:12:08,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 17:12:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:09,657 INFO L225 Difference]: With dead ends: 319033 [2019-12-07 17:12:09,657 INFO L226 Difference]: Without dead ends: 318977 [2019-12-07 17:12:09,657 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 17:12:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318977 states. [2019-12-07 17:12:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318977 to 242837. [2019-12-07 17:12:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242837 states. [2019-12-07 17:12:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242837 states to 242837 states and 1018616 transitions. [2019-12-07 17:12:19,444 INFO L78 Accepts]: Start accepts. Automaton has 242837 states and 1018616 transitions. Word has length 24 [2019-12-07 17:12:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:19,444 INFO L462 AbstractCegarLoop]: Abstraction has 242837 states and 1018616 transitions. [2019-12-07 17:12:19,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:12:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 242837 states and 1018616 transitions. [2019-12-07 17:12:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:12:19,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:19,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:19,508 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1719472782, now seen corresponding path program 1 times [2019-12-07 17:12:19,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:19,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641479659] [2019-12-07 17:12:19,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:19,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641479659] [2019-12-07 17:12:19,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:19,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:19,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303408491] [2019-12-07 17:12:19,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:19,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:19,551 INFO L87 Difference]: Start difference. First operand 242837 states and 1018616 transitions. Second operand 4 states. [2019-12-07 17:12:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:20,765 INFO L93 Difference]: Finished difference Result 210411 states and 814481 transitions. [2019-12-07 17:12:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:20,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 17:12:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:21,211 INFO L225 Difference]: With dead ends: 210411 [2019-12-07 17:12:21,211 INFO L226 Difference]: Without dead ends: 193122 [2019-12-07 17:12:21,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193122 states. [2019-12-07 17:12:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193122 to 193122. [2019-12-07 17:12:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193122 states. [2019-12-07 17:12:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193122 states to 193122 states and 753976 transitions. [2019-12-07 17:12:26,151 INFO L78 Accepts]: Start accepts. Automaton has 193122 states and 753976 transitions. Word has length 27 [2019-12-07 17:12:26,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:26,151 INFO L462 AbstractCegarLoop]: Abstraction has 193122 states and 753976 transitions. [2019-12-07 17:12:26,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 193122 states and 753976 transitions. [2019-12-07 17:12:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:12:26,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:26,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:26,192 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1396027996, now seen corresponding path program 1 times [2019-12-07 17:12:26,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:26,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522326695] [2019-12-07 17:12:26,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:26,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522326695] [2019-12-07 17:12:26,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:26,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:26,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452031434] [2019-12-07 17:12:26,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:12:26,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:12:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:26,244 INFO L87 Difference]: Start difference. First operand 193122 states and 753976 transitions. Second operand 5 states. [2019-12-07 17:12:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:26,608 INFO L93 Difference]: Finished difference Result 97412 states and 326898 transitions. [2019-12-07 17:12:26,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:12:26,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:12:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:26,736 INFO L225 Difference]: With dead ends: 97412 [2019-12-07 17:12:26,736 INFO L226 Difference]: Without dead ends: 83682 [2019-12-07 17:12:26,736 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 17:12:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83682 states. [2019-12-07 17:12:28,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83682 to 83492. [2019-12-07 17:12:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83492 states. [2019-12-07 17:12:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83492 states to 83492 states and 276825 transitions. [2019-12-07 17:12:28,515 INFO L78 Accepts]: Start accepts. Automaton has 83492 states and 276825 transitions. Word has length 28 [2019-12-07 17:12:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:28,515 INFO L462 AbstractCegarLoop]: Abstraction has 83492 states and 276825 transitions. [2019-12-07 17:12:28,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:12:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 83492 states and 276825 transitions. [2019-12-07 17:12:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:12:28,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:28,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:28,531 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1458765979, now seen corresponding path program 1 times [2019-12-07 17:12:28,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:28,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101166711] [2019-12-07 17:12:28,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:28,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101166711] [2019-12-07 17:12:28,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:28,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:28,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810283712] [2019-12-07 17:12:28,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:12:28,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:28,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:12:28,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:28,569 INFO L87 Difference]: Start difference. First operand 83492 states and 276825 transitions. Second operand 5 states. [2019-12-07 17:12:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:29,250 INFO L93 Difference]: Finished difference Result 108408 states and 352265 transitions. [2019-12-07 17:12:29,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:12:29,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 17:12:29,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:29,432 INFO L225 Difference]: With dead ends: 108408 [2019-12-07 17:12:29,432 INFO L226 Difference]: Without dead ends: 108378 [2019-12-07 17:12:29,432 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 17:12:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108378 states. [2019-12-07 17:12:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108378 to 77480. [2019-12-07 17:12:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77480 states. [2019-12-07 17:12:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77480 states to 77480 states and 256846 transitions. [2019-12-07 17:12:31,354 INFO L78 Accepts]: Start accepts. Automaton has 77480 states and 256846 transitions. Word has length 29 [2019-12-07 17:12:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:31,355 INFO L462 AbstractCegarLoop]: Abstraction has 77480 states and 256846 transitions. [2019-12-07 17:12:31,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:12:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 77480 states and 256846 transitions. [2019-12-07 17:12:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:12:31,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:31,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:31,399 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash -506640382, now seen corresponding path program 1 times [2019-12-07 17:12:31,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:31,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106104870] [2019-12-07 17:12:31,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:31,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106104870] [2019-12-07 17:12:31,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:31,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:12:31,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989772749] [2019-12-07 17:12:31,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:12:31,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:31,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:12:31,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:12:31,490 INFO L87 Difference]: Start difference. First operand 77480 states and 256846 transitions. Second operand 8 states. [2019-12-07 17:12:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:32,278 INFO L93 Difference]: Finished difference Result 161593 states and 534877 transitions. [2019-12-07 17:12:32,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:12:32,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 17:12:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:32,494 INFO L225 Difference]: With dead ends: 161593 [2019-12-07 17:12:32,494 INFO L226 Difference]: Without dead ends: 122733 [2019-12-07 17:12:32,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:12:33,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122733 states. [2019-12-07 17:12:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122733 to 109567. [2019-12-07 17:12:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109567 states. [2019-12-07 17:12:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109567 states to 109567 states and 366649 transitions. [2019-12-07 17:12:35,008 INFO L78 Accepts]: Start accepts. Automaton has 109567 states and 366649 transitions. Word has length 37 [2019-12-07 17:12:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:35,008 INFO L462 AbstractCegarLoop]: Abstraction has 109567 states and 366649 transitions. [2019-12-07 17:12:35,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:12:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 109567 states and 366649 transitions. [2019-12-07 17:12:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:12:35,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:35,082 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:35,082 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:35,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:35,083 INFO L82 PathProgramCache]: Analyzing trace with hash 602351642, now seen corresponding path program 2 times [2019-12-07 17:12:35,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:35,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550554237] [2019-12-07 17:12:35,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:35,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550554237] [2019-12-07 17:12:35,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:35,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:12:35,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957652656] [2019-12-07 17:12:35,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:12:35,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:35,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:12:35,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:12:35,149 INFO L87 Difference]: Start difference. First operand 109567 states and 366649 transitions. Second operand 8 states. [2019-12-07 17:12:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:36,206 INFO L93 Difference]: Finished difference Result 167130 states and 554843 transitions. [2019-12-07 17:12:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:12:36,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 17:12:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:36,477 INFO L225 Difference]: With dead ends: 167130 [2019-12-07 17:12:36,477 INFO L226 Difference]: Without dead ends: 156909 [2019-12-07 17:12:36,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:12:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156909 states. [2019-12-07 17:12:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156909 to 113720. [2019-12-07 17:12:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113720 states. [2019-12-07 17:12:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113720 states to 113720 states and 379902 transitions. [2019-12-07 17:12:39,297 INFO L78 Accepts]: Start accepts. Automaton has 113720 states and 379902 transitions. Word has length 37 [2019-12-07 17:12:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:39,297 INFO L462 AbstractCegarLoop]: Abstraction has 113720 states and 379902 transitions. [2019-12-07 17:12:39,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:12:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 113720 states and 379902 transitions. [2019-12-07 17:12:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:12:39,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:39,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:39,382 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:39,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash 445827019, now seen corresponding path program 1 times [2019-12-07 17:12:39,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:39,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944793373] [2019-12-07 17:12:39,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:39,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944793373] [2019-12-07 17:12:39,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:39,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:12:39,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451918913] [2019-12-07 17:12:39,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:12:39,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:39,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:12:39,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:12:39,432 INFO L87 Difference]: Start difference. First operand 113720 states and 379902 transitions. Second operand 6 states. [2019-12-07 17:12:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:39,555 INFO L93 Difference]: Finished difference Result 29162 states and 94773 transitions. [2019-12-07 17:12:39,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:12:39,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 17:12:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:39,587 INFO L225 Difference]: With dead ends: 29162 [2019-12-07 17:12:39,587 INFO L226 Difference]: Without dead ends: 23216 [2019-12-07 17:12:39,587 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 17:12:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23216 states. [2019-12-07 17:12:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23216 to 22299. [2019-12-07 17:12:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22299 states. [2019-12-07 17:12:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22299 states to 22299 states and 72023 transitions. [2019-12-07 17:12:39,876 INFO L78 Accepts]: Start accepts. Automaton has 22299 states and 72023 transitions. Word has length 38 [2019-12-07 17:12:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:39,876 INFO L462 AbstractCegarLoop]: Abstraction has 22299 states and 72023 transitions. [2019-12-07 17:12:39,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:12:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 22299 states and 72023 transitions. [2019-12-07 17:12:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:12:39,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:39,895 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] [2019-12-07 17:12:39,895 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:39,895 INFO L82 PathProgramCache]: Analyzing trace with hash 951052415, now seen corresponding path program 1 times [2019-12-07 17:12:39,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:39,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535221063] [2019-12-07 17:12:39,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:39,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535221063] [2019-12-07 17:12:39,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:39,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:39,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023873849] [2019-12-07 17:12:39,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:39,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:39,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:39,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:39,932 INFO L87 Difference]: Start difference. First operand 22299 states and 72023 transitions. Second operand 4 states. [2019-12-07 17:12:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:40,006 INFO L93 Difference]: Finished difference Result 24773 states and 78376 transitions. [2019-12-07 17:12:40,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:40,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 17:12:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:40,034 INFO L225 Difference]: With dead ends: 24773 [2019-12-07 17:12:40,034 INFO L226 Difference]: Without dead ends: 22254 [2019-12-07 17:12:40,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22254 states. [2019-12-07 17:12:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22254 to 22234. [2019-12-07 17:12:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22234 states. [2019-12-07 17:12:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22234 states to 22234 states and 71692 transitions. [2019-12-07 17:12:40,334 INFO L78 Accepts]: Start accepts. Automaton has 22234 states and 71692 transitions. Word has length 49 [2019-12-07 17:12:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:40,334 INFO L462 AbstractCegarLoop]: Abstraction has 22234 states and 71692 transitions. [2019-12-07 17:12:40,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 22234 states and 71692 transitions. [2019-12-07 17:12:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:12:40,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:40,353 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] [2019-12-07 17:12:40,354 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2143277843, now seen corresponding path program 2 times [2019-12-07 17:12:40,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:40,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892698450] [2019-12-07 17:12:40,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:40,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892698450] [2019-12-07 17:12:40,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:40,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:12:40,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373769269] [2019-12-07 17:12:40,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:12:40,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:40,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:12:40,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:12:40,415 INFO L87 Difference]: Start difference. First operand 22234 states and 71692 transitions. Second operand 7 states. [2019-12-07 17:12:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:40,526 INFO L93 Difference]: Finished difference Result 19568 states and 65667 transitions. [2019-12-07 17:12:40,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:12:40,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 17:12:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:40,540 INFO L225 Difference]: With dead ends: 19568 [2019-12-07 17:12:40,540 INFO L226 Difference]: Without dead ends: 10082 [2019-12-07 17:12:40,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:12:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-07 17:12:40,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 9088. [2019-12-07 17:12:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2019-12-07 17:12:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 27194 transitions. [2019-12-07 17:12:40,828 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 27194 transitions. Word has length 49 [2019-12-07 17:12:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:40,828 INFO L462 AbstractCegarLoop]: Abstraction has 9088 states and 27194 transitions. [2019-12-07 17:12:40,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:12:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 27194 transitions. [2019-12-07 17:12:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:12:40,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:40,835 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] [2019-12-07 17:12:40,836 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:40,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1891696283, now seen corresponding path program 1 times [2019-12-07 17:12:40,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:40,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772335421] [2019-12-07 17:12:40,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:40,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772335421] [2019-12-07 17:12:40,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:40,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:40,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388435760] [2019-12-07 17:12:40,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:40,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:40,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:40,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:40,900 INFO L87 Difference]: Start difference. First operand 9088 states and 27194 transitions. Second operand 4 states. [2019-12-07 17:12:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:40,932 INFO L93 Difference]: Finished difference Result 9882 states and 28977 transitions. [2019-12-07 17:12:40,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:40,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:12:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:40,939 INFO L225 Difference]: With dead ends: 9882 [2019-12-07 17:12:40,939 INFO L226 Difference]: Without dead ends: 6078 [2019-12-07 17:12:40,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2019-12-07 17:12:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 6078. [2019-12-07 17:12:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6078 states. [2019-12-07 17:12:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6078 states to 6078 states and 16123 transitions. [2019-12-07 17:12:41,007 INFO L78 Accepts]: Start accepts. Automaton has 6078 states and 16123 transitions. Word has length 65 [2019-12-07 17:12:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:41,007 INFO L462 AbstractCegarLoop]: Abstraction has 6078 states and 16123 transitions. [2019-12-07 17:12:41,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6078 states and 16123 transitions. [2019-12-07 17:12:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:12:41,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:41,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] [2019-12-07 17:12:41,012 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash -505309043, now seen corresponding path program 2 times [2019-12-07 17:12:41,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:41,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916495135] [2019-12-07 17:12:41,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:41,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916495135] [2019-12-07 17:12:41,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:41,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:12:41,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594184870] [2019-12-07 17:12:41,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:41,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:41,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:41,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:41,069 INFO L87 Difference]: Start difference. First operand 6078 states and 16123 transitions. Second operand 4 states. [2019-12-07 17:12:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:41,101 INFO L93 Difference]: Finished difference Result 6590 states and 17280 transitions. [2019-12-07 17:12:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:12:41,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 17:12:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:41,106 INFO L225 Difference]: With dead ends: 6590 [2019-12-07 17:12:41,106 INFO L226 Difference]: Without dead ends: 4985 [2019-12-07 17:12:41,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2019-12-07 17:12:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4556. [2019-12-07 17:12:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4556 states. [2019-12-07 17:12:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4556 states to 4556 states and 12296 transitions. [2019-12-07 17:12:41,159 INFO L78 Accepts]: Start accepts. Automaton has 4556 states and 12296 transitions. Word has length 65 [2019-12-07 17:12:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:41,159 INFO L462 AbstractCegarLoop]: Abstraction has 4556 states and 12296 transitions. [2019-12-07 17:12:41,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4556 states and 12296 transitions. [2019-12-07 17:12:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:12:41,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:41,162 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] [2019-12-07 17:12:41,163 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash -396636243, now seen corresponding path program 3 times [2019-12-07 17:12:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:41,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328321037] [2019-12-07 17:12:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:41,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328321037] [2019-12-07 17:12:41,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:41,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:12:41,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477703150] [2019-12-07 17:12:41,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:12:41,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:12:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:12:41,233 INFO L87 Difference]: Start difference. First operand 4556 states and 12296 transitions. Second operand 7 states. [2019-12-07 17:12:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:41,392 INFO L93 Difference]: Finished difference Result 9706 states and 26531 transitions. [2019-12-07 17:12:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:12:41,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 17:12:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:41,398 INFO L225 Difference]: With dead ends: 9706 [2019-12-07 17:12:41,398 INFO L226 Difference]: Without dead ends: 6024 [2019-12-07 17:12:41,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:12:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2019-12-07 17:12:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 4598. [2019-12-07 17:12:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4598 states. [2019-12-07 17:12:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 12323 transitions. [2019-12-07 17:12:41,460 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 12323 transitions. Word has length 65 [2019-12-07 17:12:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:41,460 INFO L462 AbstractCegarLoop]: Abstraction has 4598 states and 12323 transitions. [2019-12-07 17:12:41,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:12:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 12323 transitions. [2019-12-07 17:12:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:41,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:41,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:41,464 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:41,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:41,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1473700222, now seen corresponding path program 1 times [2019-12-07 17:12:41,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:41,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510632092] [2019-12-07 17:12:41,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:41,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510632092] [2019-12-07 17:12:41,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:41,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:41,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745545635] [2019-12-07 17:12:41,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:12:41,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:41,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:12:41,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:12:41,524 INFO L87 Difference]: Start difference. First operand 4598 states and 12323 transitions. Second operand 5 states. [2019-12-07 17:12:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:41,567 INFO L93 Difference]: Finished difference Result 5071 states and 13379 transitions. [2019-12-07 17:12:41,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:12:41,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 17:12:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:41,568 INFO L225 Difference]: With dead ends: 5071 [2019-12-07 17:12:41,568 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 17:12:41,568 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 17:12:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 17:12:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 17:12:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 17:12:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 17:12:41,573 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 66 [2019-12-07 17:12:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:41,573 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 17:12:41,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:12:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 17:12:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:41,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:41,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] [2019-12-07 17:12:41,574 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 2 times [2019-12-07 17:12:41,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:41,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092291389] [2019-12-07 17:12:41,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:12:41,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092291389] [2019-12-07 17:12:41,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:41,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:12:41,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584801426] [2019-12-07 17:12:41,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:12:41,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:12:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:12:41,726 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 11 states. [2019-12-07 17:12:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:42,129 INFO L93 Difference]: Finished difference Result 1150 states and 2426 transitions. [2019-12-07 17:12:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:12:42,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-07 17:12:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:42,130 INFO L225 Difference]: With dead ends: 1150 [2019-12-07 17:12:42,130 INFO L226 Difference]: Without dead ends: 835 [2019-12-07 17:12:42,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:12:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-12-07 17:12:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 619. [2019-12-07 17:12:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-12-07 17:12:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1294 transitions. [2019-12-07 17:12:42,136 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 1294 transitions. Word has length 66 [2019-12-07 17:12:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:42,136 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 1294 transitions. [2019-12-07 17:12:42,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:12:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1294 transitions. [2019-12-07 17:12:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:42,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:42,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:42,137 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 3 times [2019-12-07 17:12:42,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:42,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078666288] [2019-12-07 17:12:42,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:12:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:12:42,248 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:12:42,248 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:12:42,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t469~0.base_38|) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t469~0.base_38|)) (= v_~z$r_buff0_thd1~0_132 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t469~0.base_38| 1)) (= v_~y~0_46 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t469~0.base_38| 4)) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 |v_ULTIMATE.start_main_~#t469~0.offset_25|) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t469~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t469~0.base_38|) |v_ULTIMATE.start_main_~#t469~0.offset_25| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~#t472~0.base=|v_ULTIMATE.start_main_~#t472~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ULTIMATE.start_main_~#t470~0.offset=|v_ULTIMATE.start_main_~#t470~0.offset_26|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ULTIMATE.start_main_~#t469~0.base=|v_ULTIMATE.start_main_~#t469~0.base_38|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t471~0.offset=|v_ULTIMATE.start_main_~#t471~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ULTIMATE.start_main_~#t470~0.base=|v_ULTIMATE.start_main_~#t470~0.base_40|, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t469~0.offset=|v_ULTIMATE.start_main_~#t469~0.offset_25|, ULTIMATE.start_main_~#t472~0.offset=|v_ULTIMATE.start_main_~#t472~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t471~0.base=|v_ULTIMATE.start_main_~#t471~0.base_30|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t472~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t470~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t469~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t471~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t470~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t469~0.offset, ULTIMATE.start_main_~#t472~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t471~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:12:42,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t470~0.base_11| 1) |v_#valid_45|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t470~0.base_11| 4)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t470~0.base_11|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t470~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t470~0.base_11|) |v_ULTIMATE.start_main_~#t470~0.offset_10| 1)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t470~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t470~0.base_11| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t470~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t470~0.offset=|v_ULTIMATE.start_main_~#t470~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t470~0.base=|v_ULTIMATE.start_main_~#t470~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t470~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t470~0.base] because there is no mapped edge [2019-12-07 17:12:42,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t471~0.base_11| 4)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t471~0.base_11| 1) |v_#valid_43|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t471~0.base_11|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t471~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t471~0.base_11|) |v_ULTIMATE.start_main_~#t471~0.offset_11| 2)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t471~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t471~0.base_11|) (= |v_ULTIMATE.start_main_~#t471~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t471~0.offset=|v_ULTIMATE.start_main_~#t471~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t471~0.base=|v_ULTIMATE.start_main_~#t471~0.base_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t471~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t471~0.base, #length] because there is no mapped edge [2019-12-07 17:12:42,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t472~0.offset_8|) (not (= 0 |v_ULTIMATE.start_main_~#t472~0.base_9|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t472~0.base_9| 1)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t472~0.base_9|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t472~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t472~0.base_9|) |v_ULTIMATE.start_main_~#t472~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t472~0.base_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t472~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t472~0.base=|v_ULTIMATE.start_main_~#t472~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t472~0.offset=|v_ULTIMATE.start_main_~#t472~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t472~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t472~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:12:42,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542)) (= ~z$r_buff0_thd4~0_Out285175542 1) (= ~weak$$choice2~0_Out285175542 |P3Thread1of1ForFork2_#t~nondet27_In285175542|) (= ~z$r_buff1_thd2~0_Out285175542 ~z$r_buff0_thd2~0_In285175542) (= ~z~0_In285175542 ~z$mem_tmp~0_Out285175542) (= ~z$r_buff0_thd3~0_In285175542 ~z$r_buff1_thd3~0_Out285175542) (= ~z$r_buff1_thd4~0_Out285175542 ~z$r_buff0_thd4~0_In285175542) (= ~z$r_buff0_thd1~0_In285175542 ~z$r_buff1_thd1~0_Out285175542) (= ~weak$$choice0~0_Out285175542 |P3Thread1of1ForFork2_#t~nondet26_In285175542|) (= ~weak$$choice2~0_Out285175542 ~z$flush_delayed~0_Out285175542) (= ~z$r_buff0_thd0~0_In285175542 ~z$r_buff1_thd0~0_Out285175542)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In285175542|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In285175542|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285175542, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In285175542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In285175542, ~z~0=~z~0_In285175542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In285175542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285175542} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out285175542|, ~z$mem_tmp~0=~z$mem_tmp~0_Out285175542, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out285175542|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out285175542, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out285175542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out285175542, ~z$flush_delayed~0=~z$flush_delayed~0_Out285175542, ~weak$$choice0~0=~weak$$choice0~0_Out285175542, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285175542, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out285175542, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out285175542, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out285175542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In285175542, ~z~0=~z~0_In285175542, ~weak$$choice2~0=~weak$$choice2~0_Out285175542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In285175542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285175542} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 17:12:42,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In462631140 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In462631140 256))) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out462631140| |P3Thread1of1ForFork2_#t~ite28_Out462631140|))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out462631140| ~z$w_buff0~0_In462631140) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= ~z$w_buff1~0_In462631140 |P3Thread1of1ForFork2_#t~ite28_Out462631140|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In462631140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In462631140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In462631140, ~z$w_buff1~0=~z$w_buff1~0_In462631140} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out462631140|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out462631140|, ~z$w_buff0~0=~z$w_buff0~0_In462631140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In462631140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In462631140, ~z$w_buff1~0=~z$w_buff1~0_In462631140} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:12:42,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:12:42,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1099231592 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1099231592| ~z$mem_tmp~0_In1099231592)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1099231592| ~z~0_In1099231592)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1099231592, ~z$flush_delayed~0=~z$flush_delayed~0_In1099231592, ~z~0=~z~0_In1099231592} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1099231592, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1099231592|, ~z$flush_delayed~0=~z$flush_delayed~0_In1099231592, ~z~0=~z~0_In1099231592} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:12:42,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 17:12:42,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:12:42,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In648285164 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In648285164 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out648285164| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out648285164| ~z$w_buff0_used~0_In648285164)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In648285164, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In648285164} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out648285164|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In648285164, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In648285164} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:12:42,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In836502439 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out836502439| ~z~0_In836502439) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out836502439| ~z$mem_tmp~0_In836502439)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In836502439, ~z$flush_delayed~0=~z$flush_delayed~0_In836502439, ~z~0=~z~0_In836502439} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In836502439, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out836502439|, ~z$flush_delayed~0=~z$flush_delayed~0_In836502439, ~z~0=~z~0_In836502439} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:12:42,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-584625225 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-584625225 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-584625225 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-584625225 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-584625225|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out-584625225| ~z$w_buff1_used~0_In-584625225)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-584625225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-584625225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-584625225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-584625225} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-584625225|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-584625225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-584625225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-584625225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-584625225} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:12:42,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-553304508 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-553304508 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_Out-553304508 ~z$r_buff0_thd4~0_In-553304508))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out-553304508 0) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-553304508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-553304508} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-553304508|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-553304508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-553304508} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:12:42,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1368005042 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1368005042 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1368005042 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1368005042 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-1368005042 |P3Thread1of1ForFork2_#t~ite54_Out-1368005042|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-1368005042|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368005042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368005042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368005042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368005042} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1368005042|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368005042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368005042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368005042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368005042} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:12:42,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:12:42,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:12:42,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:12:42,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1223133688 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1223133688 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-1223133688| ~z~0_In-1223133688) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1223133688| ~z$w_buff1~0_In-1223133688) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1223133688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1223133688, ~z$w_buff1~0=~z$w_buff1~0_In-1223133688, ~z~0=~z~0_In-1223133688} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1223133688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1223133688, ~z$w_buff1~0=~z$w_buff1~0_In-1223133688, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1223133688|, ~z~0=~z~0_In-1223133688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:12:42,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:12:42,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1207521528 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1207521528 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1207521528| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1207521528| ~z$w_buff0_used~0_In-1207521528)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1207521528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207521528} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1207521528, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1207521528|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207521528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:12:42,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In989281067 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In989281067 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In989281067 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In989281067 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out989281067| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out989281067| ~z$w_buff1_used~0_In989281067) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989281067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989281067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989281067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989281067} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out989281067|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989281067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989281067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989281067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989281067} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:12:42,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In44215696 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In44215696 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out44215696| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out44215696| ~z$r_buff0_thd0~0_In44215696)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In44215696, ~z$w_buff0_used~0=~z$w_buff0_used~0_In44215696} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out44215696|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In44215696, ~z$w_buff0_used~0=~z$w_buff0_used~0_In44215696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:12:42,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1569247255 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1569247255 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1569247255 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1569247255 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1569247255| ~z$r_buff1_thd0~0_In1569247255)) (and (= |ULTIMATE.start_main_#t~ite64_Out1569247255| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1569247255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1569247255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1569247255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569247255} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1569247255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1569247255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1569247255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569247255, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1569247255|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:12:42,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:12:42,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:12:42 BasicIcfg [2019-12-07 17:12:42,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:12:42,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:12:42,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:12:42,341 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:12:42,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:43" (3/4) ... [2019-12-07 17:12:42,343 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:12:42,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t469~0.base_38|) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t469~0.base_38|)) (= v_~z$r_buff0_thd1~0_132 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t469~0.base_38| 1)) (= v_~y~0_46 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (< 0 |v_#StackHeapBarrier_20|) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t469~0.base_38| 4)) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 |v_ULTIMATE.start_main_~#t469~0.offset_25|) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t469~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t469~0.base_38|) |v_ULTIMATE.start_main_~#t469~0.offset_25| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_~#t472~0.base=|v_ULTIMATE.start_main_~#t472~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ULTIMATE.start_main_~#t470~0.offset=|v_ULTIMATE.start_main_~#t470~0.offset_26|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ULTIMATE.start_main_~#t469~0.base=|v_ULTIMATE.start_main_~#t469~0.base_38|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t471~0.offset=|v_ULTIMATE.start_main_~#t471~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ULTIMATE.start_main_~#t470~0.base=|v_ULTIMATE.start_main_~#t470~0.base_40|, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t469~0.offset=|v_ULTIMATE.start_main_~#t469~0.offset_25|, ULTIMATE.start_main_~#t472~0.offset=|v_ULTIMATE.start_main_~#t472~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t471~0.base=|v_ULTIMATE.start_main_~#t471~0.base_30|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t472~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t470~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t469~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t471~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t470~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t469~0.offset, ULTIMATE.start_main_~#t472~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t471~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:12:42,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t470~0.base_11| 1) |v_#valid_45|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t470~0.base_11| 4)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t470~0.base_11|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t470~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t470~0.base_11|) |v_ULTIMATE.start_main_~#t470~0.offset_10| 1)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t470~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t470~0.base_11| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t470~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t470~0.offset=|v_ULTIMATE.start_main_~#t470~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t470~0.base=|v_ULTIMATE.start_main_~#t470~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t470~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t470~0.base] because there is no mapped edge [2019-12-07 17:12:42,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t471~0.base_11| 4)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t471~0.base_11| 1) |v_#valid_43|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t471~0.base_11|) 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t471~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t471~0.base_11|) |v_ULTIMATE.start_main_~#t471~0.offset_11| 2)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t471~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t471~0.base_11|) (= |v_ULTIMATE.start_main_~#t471~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t471~0.offset=|v_ULTIMATE.start_main_~#t471~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t471~0.base=|v_ULTIMATE.start_main_~#t471~0.base_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t471~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t471~0.base, #length] because there is no mapped edge [2019-12-07 17:12:42,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t472~0.offset_8|) (not (= 0 |v_ULTIMATE.start_main_~#t472~0.base_9|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t472~0.base_9| 1)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t472~0.base_9|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t472~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t472~0.base_9|) |v_ULTIMATE.start_main_~#t472~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t472~0.base_9|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t472~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t472~0.base=|v_ULTIMATE.start_main_~#t472~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t472~0.offset=|v_ULTIMATE.start_main_~#t472~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t472~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t472~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:12:42,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542)) (= ~z$r_buff0_thd4~0_Out285175542 1) (= ~weak$$choice2~0_Out285175542 |P3Thread1of1ForFork2_#t~nondet27_In285175542|) (= ~z$r_buff1_thd2~0_Out285175542 ~z$r_buff0_thd2~0_In285175542) (= ~z~0_In285175542 ~z$mem_tmp~0_Out285175542) (= ~z$r_buff0_thd3~0_In285175542 ~z$r_buff1_thd3~0_Out285175542) (= ~z$r_buff1_thd4~0_Out285175542 ~z$r_buff0_thd4~0_In285175542) (= ~z$r_buff0_thd1~0_In285175542 ~z$r_buff1_thd1~0_Out285175542) (= ~weak$$choice0~0_Out285175542 |P3Thread1of1ForFork2_#t~nondet26_In285175542|) (= ~weak$$choice2~0_Out285175542 ~z$flush_delayed~0_Out285175542) (= ~z$r_buff0_thd0~0_In285175542 ~z$r_buff1_thd0~0_Out285175542)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In285175542|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In285175542|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285175542, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In285175542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In285175542, ~z~0=~z~0_In285175542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In285175542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285175542} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out285175542|, ~z$mem_tmp~0=~z$mem_tmp~0_Out285175542, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out285175542|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In285175542, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out285175542, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out285175542, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out285175542, ~z$flush_delayed~0=~z$flush_delayed~0_Out285175542, ~weak$$choice0~0=~weak$$choice0~0_Out285175542, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In285175542, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out285175542, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out285175542, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out285175542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In285175542, ~z~0=~z~0_In285175542, ~weak$$choice2~0=~weak$$choice2~0_Out285175542, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In285175542, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285175542} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 17:12:42,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In462631140 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In462631140 256))) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out462631140| |P3Thread1of1ForFork2_#t~ite28_Out462631140|))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out462631140| ~z$w_buff0~0_In462631140) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= ~z$w_buff1~0_In462631140 |P3Thread1of1ForFork2_#t~ite28_Out462631140|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In462631140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In462631140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In462631140, ~z$w_buff1~0=~z$w_buff1~0_In462631140} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out462631140|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out462631140|, ~z$w_buff0~0=~z$w_buff0~0_In462631140, ~z$w_buff0_used~0=~z$w_buff0_used~0_In462631140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In462631140, ~z$w_buff1~0=~z$w_buff1~0_In462631140} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 17:12:42,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:12:42,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1099231592 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1099231592| ~z$mem_tmp~0_In1099231592)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1099231592| ~z~0_In1099231592)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1099231592, ~z$flush_delayed~0=~z$flush_delayed~0_In1099231592, ~z~0=~z~0_In1099231592} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1099231592, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1099231592|, ~z$flush_delayed~0=~z$flush_delayed~0_In1099231592, ~z~0=~z~0_In1099231592} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 17:12:42,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 17:12:42,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 17:12:42,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In648285164 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In648285164 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out648285164| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out648285164| ~z$w_buff0_used~0_In648285164)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In648285164, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In648285164} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out648285164|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In648285164, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In648285164} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 17:12:42,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In836502439 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out836502439| ~z~0_In836502439) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out836502439| ~z$mem_tmp~0_In836502439)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In836502439, ~z$flush_delayed~0=~z$flush_delayed~0_In836502439, ~z~0=~z~0_In836502439} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In836502439, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out836502439|, ~z$flush_delayed~0=~z$flush_delayed~0_In836502439, ~z~0=~z~0_In836502439} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:12:42,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-584625225 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-584625225 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-584625225 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-584625225 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-584625225|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out-584625225| ~z$w_buff1_used~0_In-584625225)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-584625225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-584625225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-584625225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-584625225} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-584625225|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-584625225, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-584625225, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-584625225, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-584625225} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 17:12:42,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-553304508 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-553304508 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_Out-553304508 ~z$r_buff0_thd4~0_In-553304508))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out-553304508 0) (not .cse0) (not .cse2)) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-553304508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-553304508} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-553304508|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-553304508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-553304508} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:12:42,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1368005042 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1368005042 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1368005042 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1368005042 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-1368005042 |P3Thread1of1ForFork2_#t~ite54_Out-1368005042|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-1368005042|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368005042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368005042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368005042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368005042} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1368005042|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1368005042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1368005042, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1368005042, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1368005042} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 17:12:42,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:12:42,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:12:42,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:12:42,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1223133688 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1223133688 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out-1223133688| ~z~0_In-1223133688) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out-1223133688| ~z$w_buff1~0_In-1223133688) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1223133688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1223133688, ~z$w_buff1~0=~z$w_buff1~0_In-1223133688, ~z~0=~z~0_In-1223133688} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1223133688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1223133688, ~z$w_buff1~0=~z$w_buff1~0_In-1223133688, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1223133688|, ~z~0=~z~0_In-1223133688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:12:42,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:12:42,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1207521528 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1207521528 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1207521528| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1207521528| ~z$w_buff0_used~0_In-1207521528)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1207521528, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207521528} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1207521528, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1207521528|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1207521528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:12:42,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In989281067 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In989281067 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In989281067 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In989281067 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out989281067| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out989281067| ~z$w_buff1_used~0_In989281067) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989281067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989281067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989281067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989281067} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out989281067|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In989281067, ~z$w_buff0_used~0=~z$w_buff0_used~0_In989281067, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In989281067, ~z$w_buff1_used~0=~z$w_buff1_used~0_In989281067} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:12:42,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In44215696 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In44215696 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out44215696| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out44215696| ~z$r_buff0_thd0~0_In44215696)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In44215696, ~z$w_buff0_used~0=~z$w_buff0_used~0_In44215696} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out44215696|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In44215696, ~z$w_buff0_used~0=~z$w_buff0_used~0_In44215696} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:12:42,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1569247255 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1569247255 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1569247255 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1569247255 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1569247255| ~z$r_buff1_thd0~0_In1569247255)) (and (= |ULTIMATE.start_main_#t~ite64_Out1569247255| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1569247255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1569247255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1569247255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569247255} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1569247255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1569247255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1569247255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1569247255, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1569247255|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:12:42,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:12:42,421 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_65295ef3-2908-410f-bfe3-de6d6953730c/bin/uautomizer/witness.graphml [2019-12-07 17:12:42,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:12:42,422 INFO L168 Benchmark]: Toolchain (without parser) took 119629.14 ms. Allocated memory was 1.0 GB in the beginning and 8.3 GB in the end (delta: 7.3 GB). Free memory was 937.9 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. [2019-12-07 17:12:42,422 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:12:42,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:42,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:12:42,423 INFO L168 Benchmark]: Boogie Preprocessor took 29.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:42,423 INFO L168 Benchmark]: RCFGBuilder took 447.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:42,424 INFO L168 Benchmark]: TraceAbstraction took 118631.58 ms. Allocated memory was 1.1 GB in the beginning and 8.3 GB in the end (delta: 7.2 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2019-12-07 17:12:42,424 INFO L168 Benchmark]: Witness Printer took 80.09 ms. Allocated memory is still 8.3 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:12:42,425 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.01 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 118631.58 ms. Allocated memory was 1.1 GB in the beginning and 8.3 GB in the end (delta: 7.2 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 80.09 ms. Allocated memory is still 8.3 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 340 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 380 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 118.4s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4974 SDtfs, 7380 SDslu, 10058 SDs, 0 SdLazy, 2723 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264871occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 79.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 307205 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 854 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 239038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...