./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/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 5182a98928927dad271e4a1609ef1ddeca333e55 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 12:43:15,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:43:15,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:43:15,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:43:15,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:43:15,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:43:15,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:43:15,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:43:15,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:43:15,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:43:15,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:43:15,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:43:15,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:43:15,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:43:15,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:43:15,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:43:15,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:43:15,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:43:15,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:43:15,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:43:15,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:43:15,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:43:15,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:43:15,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:43:15,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:43:15,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:43:15,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:43:15,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:43:15,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:43:15,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:43:15,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:43:15,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:43:15,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:43:15,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:43:15,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:43:15,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:43:15,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:43:15,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:43:15,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:43:15,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:43:15,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:43:15,107 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:43:15,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:43:15,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:43:15,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:43:15,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:43:15,118 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:43:15,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:43:15,118 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:43:15,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:43:15,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:43:15,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:43:15,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:43:15,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:43:15,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:43:15,119 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:43:15,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:43:15,119 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:43:15,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:43:15,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:43:15,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:43:15,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:43:15,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:43:15,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:43:15,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:43:15,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:43:15,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:43:15,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:43:15,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:43:15,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:43:15,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:43:15,121 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_55c0d3b8-2f37-4aff-a317-993841cdd79b/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 -> 5182a98928927dad271e4a1609ef1ddeca333e55 [2019-12-07 12:43:15,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:43:15,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:43:15,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:43:15,233 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:43:15,233 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:43:15,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix016_tso.opt.i [2019-12-07 12:43:15,276 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/data/e5091ed1f/f03c39c7a1ab48fd976146f44eafa25a/FLAGc8fd97a1e [2019-12-07 12:43:15,736 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:43:15,737 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/sv-benchmarks/c/pthread-wmm/mix016_tso.opt.i [2019-12-07 12:43:15,747 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/data/e5091ed1f/f03c39c7a1ab48fd976146f44eafa25a/FLAGc8fd97a1e [2019-12-07 12:43:15,756 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/data/e5091ed1f/f03c39c7a1ab48fd976146f44eafa25a [2019-12-07 12:43:15,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:43:15,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:43:15,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:43:15,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:43:15,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:43:15,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:43:15" (1/1) ... [2019-12-07 12:43:15,764 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 12:43:15, skipping insertion in model container [2019-12-07 12:43:15,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:43:15" (1/1) ... [2019-12-07 12:43:15,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:43:15,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:43:16,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:43:16,085 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:43:16,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:43:16,171 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:43:16,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16 WrapperNode [2019-12-07 12:43:16,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:43:16,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:43:16,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:43:16,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:43:16,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:43:16,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:43:16,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:43:16,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:43:16,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... [2019-12-07 12:43:16,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:43:16,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:43:16,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:43:16,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:43:16,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/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 12:43:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:43:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:43:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:43:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:43:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:43:16,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:43:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:43:16,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:43:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:43:16,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:43:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:43:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:43:16,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:43:16,284 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 12:43:16,664 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:43:16,664 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:43:16,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:43:16 BoogieIcfgContainer [2019-12-07 12:43:16,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:43:16,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:43:16,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:43:16,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:43:16,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:43:15" (1/3) ... [2019-12-07 12:43:16,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ed9a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:43:16, skipping insertion in model container [2019-12-07 12:43:16,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:43:16" (2/3) ... [2019-12-07 12:43:16,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ed9a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:43:16, skipping insertion in model container [2019-12-07 12:43:16,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:43:16" (3/3) ... [2019-12-07 12:43:16,671 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_tso.opt.i [2019-12-07 12:43:16,677 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:43:16,678 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:43:16,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:43:16,683 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:43:16,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,714 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,730 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:43:16,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 12:43:16,771 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:43:16,771 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:43:16,771 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:43:16,771 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:43:16,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:43:16,772 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:43:16,772 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:43:16,772 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:43:16,782 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-07 12:43:16,783 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 12:43:16,844 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 12:43:16,844 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:43:16,858 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 904 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 12:43:16,881 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 12:43:16,915 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 12:43:16,915 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:43:16,923 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 904 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 12:43:16,946 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 12:43:16,947 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:43:20,218 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 12:43:20,380 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 12:43:20,489 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147047 [2019-12-07 12:43:20,489 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-07 12:43:20,491 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 134 transitions [2019-12-07 12:43:23,641 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 48534 states. [2019-12-07 12:43:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 48534 states. [2019-12-07 12:43:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 12:43:23,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:23,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:23,647 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:23,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash 746662760, now seen corresponding path program 1 times [2019-12-07 12:43:23,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:23,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026299752] [2019-12-07 12:43:23,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:23,804 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 12:43:23,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026299752] [2019-12-07 12:43:23,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:23,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:43:23,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113992029] [2019-12-07 12:43:23,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:23,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:23,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:23,819 INFO L87 Difference]: Start difference. First operand 48534 states. Second operand 3 states. [2019-12-07 12:43:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:24,231 INFO L93 Difference]: Finished difference Result 48214 states and 197664 transitions. [2019-12-07 12:43:24,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:24,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 12:43:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:24,490 INFO L225 Difference]: With dead ends: 48214 [2019-12-07 12:43:24,490 INFO L226 Difference]: Without dead ends: 44902 [2019-12-07 12:43:24,491 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 12:43:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44902 states. [2019-12-07 12:43:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44902 to 44902. [2019-12-07 12:43:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44902 states. [2019-12-07 12:43:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44902 states to 44902 states and 183960 transitions. [2019-12-07 12:43:26,158 INFO L78 Accepts]: Start accepts. Automaton has 44902 states and 183960 transitions. Word has length 7 [2019-12-07 12:43:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:26,159 INFO L462 AbstractCegarLoop]: Abstraction has 44902 states and 183960 transitions. [2019-12-07 12:43:26,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:43:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 44902 states and 183960 transitions. [2019-12-07 12:43:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 12:43:26,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:26,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:26,163 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1082779043, now seen corresponding path program 1 times [2019-12-07 12:43:26,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:26,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065879829] [2019-12-07 12:43:26,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:26,221 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 12:43:26,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065879829] [2019-12-07 12:43:26,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:26,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:43:26,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002248103] [2019-12-07 12:43:26,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:43:26,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:26,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:43:26,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:26,223 INFO L87 Difference]: Start difference. First operand 44902 states and 183960 transitions. Second operand 4 states. [2019-12-07 12:43:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:26,751 INFO L93 Difference]: Finished difference Result 71574 states and 281396 transitions. [2019-12-07 12:43:26,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:43:26,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 12:43:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:27,083 INFO L225 Difference]: With dead ends: 71574 [2019-12-07 12:43:27,083 INFO L226 Difference]: Without dead ends: 71542 [2019-12-07 12:43:27,084 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 12:43:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71542 states. [2019-12-07 12:43:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71542 to 69774. [2019-12-07 12:43:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69774 states. [2019-12-07 12:43:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69774 states to 69774 states and 275806 transitions. [2019-12-07 12:43:29,121 INFO L78 Accepts]: Start accepts. Automaton has 69774 states and 275806 transitions. Word has length 13 [2019-12-07 12:43:29,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:29,121 INFO L462 AbstractCegarLoop]: Abstraction has 69774 states and 275806 transitions. [2019-12-07 12:43:29,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:43:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 69774 states and 275806 transitions. [2019-12-07 12:43:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:43:29,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:29,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:29,126 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:29,126 INFO L82 PathProgramCache]: Analyzing trace with hash 837864252, now seen corresponding path program 1 times [2019-12-07 12:43:29,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:29,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166062634] [2019-12-07 12:43:29,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:29,171 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 12:43:29,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166062634] [2019-12-07 12:43:29,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:29,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:43:29,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644172540] [2019-12-07 12:43:29,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:43:29,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:43:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:29,172 INFO L87 Difference]: Start difference. First operand 69774 states and 275806 transitions. Second operand 4 states. [2019-12-07 12:43:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:29,652 INFO L93 Difference]: Finished difference Result 88624 states and 345355 transitions. [2019-12-07 12:43:29,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:43:29,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:43:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:29,835 INFO L225 Difference]: With dead ends: 88624 [2019-12-07 12:43:29,835 INFO L226 Difference]: Without dead ends: 88596 [2019-12-07 12:43:29,835 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 12:43:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88596 states. [2019-12-07 12:43:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88596 to 79570. [2019-12-07 12:43:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79570 states. [2019-12-07 12:43:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79570 states to 79570 states and 312836 transitions. [2019-12-07 12:43:33,136 INFO L78 Accepts]: Start accepts. Automaton has 79570 states and 312836 transitions. Word has length 16 [2019-12-07 12:43:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:33,136 INFO L462 AbstractCegarLoop]: Abstraction has 79570 states and 312836 transitions. [2019-12-07 12:43:33,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:43:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 79570 states and 312836 transitions. [2019-12-07 12:43:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:43:33,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:33,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:33,142 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash 204017463, now seen corresponding path program 1 times [2019-12-07 12:43:33,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:33,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558691245] [2019-12-07 12:43:33,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:33,179 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 12:43:33,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558691245] [2019-12-07 12:43:33,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:33,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:43:33,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348080990] [2019-12-07 12:43:33,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:33,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:33,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:33,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:33,181 INFO L87 Difference]: Start difference. First operand 79570 states and 312836 transitions. Second operand 3 states. [2019-12-07 12:43:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:33,743 INFO L93 Difference]: Finished difference Result 132064 states and 498805 transitions. [2019-12-07 12:43:33,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:33,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 12:43:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:34,035 INFO L225 Difference]: With dead ends: 132064 [2019-12-07 12:43:34,035 INFO L226 Difference]: Without dead ends: 132064 [2019-12-07 12:43:34,035 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 12:43:35,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132064 states. [2019-12-07 12:43:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132064 to 117574. [2019-12-07 12:43:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117574 states. [2019-12-07 12:43:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117574 states to 117574 states and 450334 transitions. [2019-12-07 12:43:37,099 INFO L78 Accepts]: Start accepts. Automaton has 117574 states and 450334 transitions. Word has length 17 [2019-12-07 12:43:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:37,099 INFO L462 AbstractCegarLoop]: Abstraction has 117574 states and 450334 transitions. [2019-12-07 12:43:37,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:43:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 117574 states and 450334 transitions. [2019-12-07 12:43:37,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:43:37,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:37,107 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 12:43:37,107 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:37,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:37,107 INFO L82 PathProgramCache]: Analyzing trace with hash 628271860, now seen corresponding path program 1 times [2019-12-07 12:43:37,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:37,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300604247] [2019-12-07 12:43:37,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:43:37,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300604247] [2019-12-07 12:43:37,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:37,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:43:37,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475316284] [2019-12-07 12:43:37,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:37,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:37,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:37,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:37,160 INFO L87 Difference]: Start difference. First operand 117574 states and 450334 transitions. Second operand 3 states. [2019-12-07 12:43:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:37,843 INFO L93 Difference]: Finished difference Result 114554 states and 436668 transitions. [2019-12-07 12:43:37,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:37,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:43:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:38,106 INFO L225 Difference]: With dead ends: 114554 [2019-12-07 12:43:38,106 INFO L226 Difference]: Without dead ends: 114554 [2019-12-07 12:43:38,106 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 12:43:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114554 states. [2019-12-07 12:43:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114554 to 114481. [2019-12-07 12:43:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114481 states. [2019-12-07 12:43:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114481 states to 114481 states and 436552 transitions. [2019-12-07 12:43:42,489 INFO L78 Accepts]: Start accepts. Automaton has 114481 states and 436552 transitions. Word has length 18 [2019-12-07 12:43:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:42,489 INFO L462 AbstractCegarLoop]: Abstraction has 114481 states and 436552 transitions. [2019-12-07 12:43:42,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:43:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 114481 states and 436552 transitions. [2019-12-07 12:43:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:43:42,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:42,496 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 12:43:42,496 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1005580165, now seen corresponding path program 1 times [2019-12-07 12:43:42,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:42,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270387388] [2019-12-07 12:43:42,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:42,548 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 12:43:42,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270387388] [2019-12-07 12:43:42,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:42,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:43:42,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486152602] [2019-12-07 12:43:42,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:43:42,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:43:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:42,550 INFO L87 Difference]: Start difference. First operand 114481 states and 436552 transitions. Second operand 5 states. [2019-12-07 12:43:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:42,661 INFO L93 Difference]: Finished difference Result 17025 states and 54977 transitions. [2019-12-07 12:43:42,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:43:42,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 12:43:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:42,675 INFO L225 Difference]: With dead ends: 17025 [2019-12-07 12:43:42,676 INFO L226 Difference]: Without dead ends: 9727 [2019-12-07 12:43:42,676 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 12:43:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9727 states. [2019-12-07 12:43:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9727 to 9727. [2019-12-07 12:43:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9727 states. [2019-12-07 12:43:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 26868 transitions. [2019-12-07 12:43:42,796 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 26868 transitions. Word has length 19 [2019-12-07 12:43:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:42,796 INFO L462 AbstractCegarLoop]: Abstraction has 9727 states and 26868 transitions. [2019-12-07 12:43:42,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:43:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 26868 transitions. [2019-12-07 12:43:42,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 12:43:42,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:42,798 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 12:43:42,798 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1364222767, now seen corresponding path program 1 times [2019-12-07 12:43:42,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:42,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22978734] [2019-12-07 12:43:42,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:42,836 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 12:43:42,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22978734] [2019-12-07 12:43:42,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:42,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:43:42,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596984918] [2019-12-07 12:43:42,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:43:42,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:42,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:43:42,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:42,838 INFO L87 Difference]: Start difference. First operand 9727 states and 26868 transitions. Second operand 4 states. [2019-12-07 12:43:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:43,019 INFO L93 Difference]: Finished difference Result 12116 states and 32850 transitions. [2019-12-07 12:43:43,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:43:43,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 12:43:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:43,031 INFO L225 Difference]: With dead ends: 12116 [2019-12-07 12:43:43,031 INFO L226 Difference]: Without dead ends: 12060 [2019-12-07 12:43:43,031 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 12:43:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12060 states. [2019-12-07 12:43:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12060 to 9674. [2019-12-07 12:43:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9674 states. [2019-12-07 12:43:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9674 states to 9674 states and 26687 transitions. [2019-12-07 12:43:43,143 INFO L78 Accepts]: Start accepts. Automaton has 9674 states and 26687 transitions. Word has length 19 [2019-12-07 12:43:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:43,143 INFO L462 AbstractCegarLoop]: Abstraction has 9674 states and 26687 transitions. [2019-12-07 12:43:43,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:43:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 9674 states and 26687 transitions. [2019-12-07 12:43:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:43:43,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:43,149 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] [2019-12-07 12:43:43,149 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:43,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1429692523, now seen corresponding path program 1 times [2019-12-07 12:43:43,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:43,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946761183] [2019-12-07 12:43:43,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:43,189 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 12:43:43,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946761183] [2019-12-07 12:43:43,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:43,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:43:43,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702411967] [2019-12-07 12:43:43,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:43:43,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:43,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:43:43,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:43,190 INFO L87 Difference]: Start difference. First operand 9674 states and 26687 transitions. Second operand 5 states. [2019-12-07 12:43:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:43,437 INFO L93 Difference]: Finished difference Result 12683 states and 33951 transitions. [2019-12-07 12:43:43,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:43:43,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 12:43:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:43,449 INFO L225 Difference]: With dead ends: 12683 [2019-12-07 12:43:43,450 INFO L226 Difference]: Without dead ends: 12682 [2019-12-07 12:43:43,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:43:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12682 states. [2019-12-07 12:43:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12682 to 11863. [2019-12-07 12:43:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11863 states. [2019-12-07 12:43:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11863 states to 11863 states and 32174 transitions. [2019-12-07 12:43:43,578 INFO L78 Accepts]: Start accepts. Automaton has 11863 states and 32174 transitions. Word has length 31 [2019-12-07 12:43:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:43,579 INFO L462 AbstractCegarLoop]: Abstraction has 11863 states and 32174 transitions. [2019-12-07 12:43:43,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:43:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 11863 states and 32174 transitions. [2019-12-07 12:43:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 12:43:43,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:43,587 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] [2019-12-07 12:43:43,587 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:43,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:43,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1846791940, now seen corresponding path program 1 times [2019-12-07 12:43:43,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:43,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134302842] [2019-12-07 12:43:43,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:43,616 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 12:43:43,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134302842] [2019-12-07 12:43:43,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:43,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:43:43,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475815357] [2019-12-07 12:43:43,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:43,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:43,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:43,617 INFO L87 Difference]: Start difference. First operand 11863 states and 32174 transitions. Second operand 3 states. [2019-12-07 12:43:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:43,681 INFO L93 Difference]: Finished difference Result 12696 states and 32654 transitions. [2019-12-07 12:43:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:43,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 12:43:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:43,694 INFO L225 Difference]: With dead ends: 12696 [2019-12-07 12:43:43,694 INFO L226 Difference]: Without dead ends: 12696 [2019-12-07 12:43:43,694 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 12:43:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12696 states. [2019-12-07 12:43:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12696 to 11939. [2019-12-07 12:43:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11939 states. [2019-12-07 12:43:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11939 states to 11939 states and 30926 transitions. [2019-12-07 12:43:43,842 INFO L78 Accepts]: Start accepts. Automaton has 11939 states and 30926 transitions. Word has length 34 [2019-12-07 12:43:43,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:43,842 INFO L462 AbstractCegarLoop]: Abstraction has 11939 states and 30926 transitions. [2019-12-07 12:43:43,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:43:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 11939 states and 30926 transitions. [2019-12-07 12:43:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:43:43,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:43,852 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] [2019-12-07 12:43:43,852 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash -922484020, now seen corresponding path program 1 times [2019-12-07 12:43:43,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:43,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258682778] [2019-12-07 12:43:43,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:43,892 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 12:43:43,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258682778] [2019-12-07 12:43:43,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:43,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:43:43,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575905663] [2019-12-07 12:43:43,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:43:43,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:43:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:43,893 INFO L87 Difference]: Start difference. First operand 11939 states and 30926 transitions. Second operand 3 states. [2019-12-07 12:43:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:43,928 INFO L93 Difference]: Finished difference Result 11939 states and 30774 transitions. [2019-12-07 12:43:43,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:43,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 12:43:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:43,940 INFO L225 Difference]: With dead ends: 11939 [2019-12-07 12:43:43,940 INFO L226 Difference]: Without dead ends: 11939 [2019-12-07 12:43:43,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:43:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11939 states. [2019-12-07 12:43:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11939 to 11484. [2019-12-07 12:43:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11484 states. [2019-12-07 12:43:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11484 states to 11484 states and 29687 transitions. [2019-12-07 12:43:44,063 INFO L78 Accepts]: Start accepts. Automaton has 11484 states and 29687 transitions. Word has length 36 [2019-12-07 12:43:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:44,063 INFO L462 AbstractCegarLoop]: Abstraction has 11484 states and 29687 transitions. [2019-12-07 12:43:44,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:43:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 11484 states and 29687 transitions. [2019-12-07 12:43:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:43:44,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:44,071 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] [2019-12-07 12:43:44,072 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash 257189679, now seen corresponding path program 1 times [2019-12-07 12:43:44,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:44,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172701354] [2019-12-07 12:43:44,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:44,119 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 12:43:44,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172701354] [2019-12-07 12:43:44,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:44,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:43:44,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725708614] [2019-12-07 12:43:44,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:43:44,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:44,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:43:44,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:44,121 INFO L87 Difference]: Start difference. First operand 11484 states and 29687 transitions. Second operand 4 states. [2019-12-07 12:43:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:44,160 INFO L93 Difference]: Finished difference Result 11380 states and 29463 transitions. [2019-12-07 12:43:44,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:43:44,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 12:43:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:44,170 INFO L225 Difference]: With dead ends: 11380 [2019-12-07 12:43:44,170 INFO L226 Difference]: Without dead ends: 11380 [2019-12-07 12:43:44,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2019-12-07 12:43:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 11380. [2019-12-07 12:43:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11380 states. [2019-12-07 12:43:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11380 states to 11380 states and 29463 transitions. [2019-12-07 12:43:44,281 INFO L78 Accepts]: Start accepts. Automaton has 11380 states and 29463 transitions. Word has length 36 [2019-12-07 12:43:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:44,281 INFO L462 AbstractCegarLoop]: Abstraction has 11380 states and 29463 transitions. [2019-12-07 12:43:44,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:43:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 11380 states and 29463 transitions. [2019-12-07 12:43:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:43:44,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:44,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:43:44,290 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:44,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:44,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1321912617, now seen corresponding path program 1 times [2019-12-07 12:43:44,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:44,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378246023] [2019-12-07 12:43:44,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:44,329 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 12:43:44,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378246023] [2019-12-07 12:43:44,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:44,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:43:44,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70624624] [2019-12-07 12:43:44,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:43:44,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:43:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:44,330 INFO L87 Difference]: Start difference. First operand 11380 states and 29463 transitions. Second operand 5 states. [2019-12-07 12:43:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:44,582 INFO L93 Difference]: Finished difference Result 12658 states and 32141 transitions. [2019-12-07 12:43:44,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:43:44,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 12:43:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:44,593 INFO L225 Difference]: With dead ends: 12658 [2019-12-07 12:43:44,593 INFO L226 Difference]: Without dead ends: 12657 [2019-12-07 12:43:44,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:43:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12657 states. [2019-12-07 12:43:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12657 to 10139. [2019-12-07 12:43:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10139 states. [2019-12-07 12:43:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10139 states to 10139 states and 26492 transitions. [2019-12-07 12:43:44,703 INFO L78 Accepts]: Start accepts. Automaton has 10139 states and 26492 transitions. Word has length 37 [2019-12-07 12:43:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:44,703 INFO L462 AbstractCegarLoop]: Abstraction has 10139 states and 26492 transitions. [2019-12-07 12:43:44,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:43:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 10139 states and 26492 transitions. [2019-12-07 12:43:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:43:44,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:44,713 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] [2019-12-07 12:43:44,713 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:44,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1619473358, now seen corresponding path program 1 times [2019-12-07 12:43:44,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:44,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802431565] [2019-12-07 12:43:44,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:44,773 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 12:43:44,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802431565] [2019-12-07 12:43:44,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:44,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:43:44,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567695048] [2019-12-07 12:43:44,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:43:44,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:43:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:43:44,774 INFO L87 Difference]: Start difference. First operand 10139 states and 26492 transitions. Second operand 6 states. [2019-12-07 12:43:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:44,886 INFO L93 Difference]: Finished difference Result 15081 states and 39545 transitions. [2019-12-07 12:43:44,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:43:44,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 12:43:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:44,898 INFO L225 Difference]: With dead ends: 15081 [2019-12-07 12:43:44,898 INFO L226 Difference]: Without dead ends: 12437 [2019-12-07 12:43:44,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:43:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12437 states. [2019-12-07 12:43:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12437 to 12437. [2019-12-07 12:43:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12437 states. [2019-12-07 12:43:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12437 states to 12437 states and 32856 transitions. [2019-12-07 12:43:45,132 INFO L78 Accepts]: Start accepts. Automaton has 12437 states and 32856 transitions. Word has length 45 [2019-12-07 12:43:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:45,132 INFO L462 AbstractCegarLoop]: Abstraction has 12437 states and 32856 transitions. [2019-12-07 12:43:45,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:43:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 12437 states and 32856 transitions. [2019-12-07 12:43:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 12:43:45,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:45,145 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] [2019-12-07 12:43:45,145 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:45,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1982378189, now seen corresponding path program 1 times [2019-12-07 12:43:45,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:45,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483400426] [2019-12-07 12:43:45,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:45,332 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 12:43:45,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483400426] [2019-12-07 12:43:45,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:45,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:43:45,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485618337] [2019-12-07 12:43:45,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:43:45,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:43:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:43:45,333 INFO L87 Difference]: Start difference. First operand 12437 states and 32856 transitions. Second operand 9 states. [2019-12-07 12:43:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:46,308 INFO L93 Difference]: Finished difference Result 24148 states and 58249 transitions. [2019-12-07 12:43:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:43:46,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-12-07 12:43:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:46,327 INFO L225 Difference]: With dead ends: 24148 [2019-12-07 12:43:46,327 INFO L226 Difference]: Without dead ends: 23504 [2019-12-07 12:43:46,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:43:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23504 states. [2019-12-07 12:43:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23504 to 16735. [2019-12-07 12:43:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16735 states. [2019-12-07 12:43:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16735 states to 16735 states and 42791 transitions. [2019-12-07 12:43:46,542 INFO L78 Accepts]: Start accepts. Automaton has 16735 states and 42791 transitions. Word has length 46 [2019-12-07 12:43:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:46,542 INFO L462 AbstractCegarLoop]: Abstraction has 16735 states and 42791 transitions. [2019-12-07 12:43:46,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:43:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 16735 states and 42791 transitions. [2019-12-07 12:43:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 12:43:46,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:46,554 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] [2019-12-07 12:43:46,554 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:46,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:46,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1215930825, now seen corresponding path program 2 times [2019-12-07 12:43:46,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:46,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734035075] [2019-12-07 12:43:46,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:46,617 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 12:43:46,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734035075] [2019-12-07 12:43:46,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:46,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:43:46,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480925061] [2019-12-07 12:43:46,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:43:46,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:46,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:43:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:43:46,619 INFO L87 Difference]: Start difference. First operand 16735 states and 42791 transitions. Second operand 6 states. [2019-12-07 12:43:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:46,702 INFO L93 Difference]: Finished difference Result 13594 states and 35941 transitions. [2019-12-07 12:43:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:43:46,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 12:43:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:46,714 INFO L225 Difference]: With dead ends: 13594 [2019-12-07 12:43:46,714 INFO L226 Difference]: Without dead ends: 12021 [2019-12-07 12:43:46,714 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 12:43:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12021 states. [2019-12-07 12:43:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12021 to 10972. [2019-12-07 12:43:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10972 states. [2019-12-07 12:43:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10972 states to 10972 states and 29076 transitions. [2019-12-07 12:43:46,837 INFO L78 Accepts]: Start accepts. Automaton has 10972 states and 29076 transitions. Word has length 46 [2019-12-07 12:43:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:46,838 INFO L462 AbstractCegarLoop]: Abstraction has 10972 states and 29076 transitions. [2019-12-07 12:43:46,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:43:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 10972 states and 29076 transitions. [2019-12-07 12:43:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:43:46,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:46,846 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] [2019-12-07 12:43:46,846 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:46,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:46,846 INFO L82 PathProgramCache]: Analyzing trace with hash 918921343, now seen corresponding path program 1 times [2019-12-07 12:43:46,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:46,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315005023] [2019-12-07 12:43:46,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:47,007 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 12:43:47,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315005023] [2019-12-07 12:43:47,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:47,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:43:47,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531657272] [2019-12-07 12:43:47,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:43:47,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:47,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:43:47,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:43:47,008 INFO L87 Difference]: Start difference. First operand 10972 states and 29076 transitions. Second operand 12 states. [2019-12-07 12:43:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:48,846 INFO L93 Difference]: Finished difference Result 17853 states and 47490 transitions. [2019-12-07 12:43:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 12:43:48,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-12-07 12:43:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:48,872 INFO L225 Difference]: With dead ends: 17853 [2019-12-07 12:43:48,872 INFO L226 Difference]: Without dead ends: 17533 [2019-12-07 12:43:48,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2019-12-07 12:43:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17533 states. [2019-12-07 12:43:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17533 to 12427. [2019-12-07 12:43:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12427 states. [2019-12-07 12:43:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12427 states to 12427 states and 33095 transitions. [2019-12-07 12:43:49,038 INFO L78 Accepts]: Start accepts. Automaton has 12427 states and 33095 transitions. Word has length 62 [2019-12-07 12:43:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:49,038 INFO L462 AbstractCegarLoop]: Abstraction has 12427 states and 33095 transitions. [2019-12-07 12:43:49,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:43:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 12427 states and 33095 transitions. [2019-12-07 12:43:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:43:49,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:49,049 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] [2019-12-07 12:43:49,049 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1458918029, now seen corresponding path program 2 times [2019-12-07 12:43:49,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:49,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160152868] [2019-12-07 12:43:49,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:49,118 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 12:43:49,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160152868] [2019-12-07 12:43:49,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:49,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:43:49,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451628048] [2019-12-07 12:43:49,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:43:49,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:49,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:43:49,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:43:49,120 INFO L87 Difference]: Start difference. First operand 12427 states and 33095 transitions. Second operand 5 states. [2019-12-07 12:43:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:49,179 INFO L93 Difference]: Finished difference Result 13433 states and 35195 transitions. [2019-12-07 12:43:49,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:43:49,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 12:43:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:49,186 INFO L225 Difference]: With dead ends: 13433 [2019-12-07 12:43:49,186 INFO L226 Difference]: Without dead ends: 6548 [2019-12-07 12:43:49,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:43:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2019-12-07 12:43:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 6548. [2019-12-07 12:43:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2019-12-07 12:43:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15899 transitions. [2019-12-07 12:43:49,249 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15899 transitions. Word has length 62 [2019-12-07 12:43:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:49,249 INFO L462 AbstractCegarLoop]: Abstraction has 6548 states and 15899 transitions. [2019-12-07 12:43:49,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:43:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15899 transitions. [2019-12-07 12:43:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:43:49,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:49,253 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] [2019-12-07 12:43:49,253 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2015799447, now seen corresponding path program 3 times [2019-12-07 12:43:49,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:49,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852805404] [2019-12-07 12:43:49,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:49,445 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 12:43:49,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852805404] [2019-12-07 12:43:49,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:49,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:43:49,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356357020] [2019-12-07 12:43:49,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:43:49,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:43:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:43:49,446 INFO L87 Difference]: Start difference. First operand 6548 states and 15899 transitions. Second operand 13 states. [2019-12-07 12:43:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:50,409 INFO L93 Difference]: Finished difference Result 15121 states and 36833 transitions. [2019-12-07 12:43:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 12:43:50,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-12-07 12:43:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:50,420 INFO L225 Difference]: With dead ends: 15121 [2019-12-07 12:43:50,421 INFO L226 Difference]: Without dead ends: 13723 [2019-12-07 12:43:50,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2019-12-07 12:43:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13723 states. [2019-12-07 12:43:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13723 to 10237. [2019-12-07 12:43:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10237 states. [2019-12-07 12:43:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10237 states to 10237 states and 24877 transitions. [2019-12-07 12:43:50,538 INFO L78 Accepts]: Start accepts. Automaton has 10237 states and 24877 transitions. Word has length 62 [2019-12-07 12:43:50,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:50,538 INFO L462 AbstractCegarLoop]: Abstraction has 10237 states and 24877 transitions. [2019-12-07 12:43:50,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:43:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 10237 states and 24877 transitions. [2019-12-07 12:43:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:43:50,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:50,546 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] [2019-12-07 12:43:50,546 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1543684769, now seen corresponding path program 4 times [2019-12-07 12:43:50,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:50,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580727428] [2019-12-07 12:43:50,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:50,587 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 12:43:50,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580727428] [2019-12-07 12:43:50,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:50,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:43:50,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603665446] [2019-12-07 12:43:50,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:43:50,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:50,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:43:50,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:43:50,589 INFO L87 Difference]: Start difference. First operand 10237 states and 24877 transitions. Second operand 6 states. [2019-12-07 12:43:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:50,726 INFO L93 Difference]: Finished difference Result 13841 states and 33877 transitions. [2019-12-07 12:43:50,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:43:50,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 12:43:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:50,734 INFO L225 Difference]: With dead ends: 13841 [2019-12-07 12:43:50,734 INFO L226 Difference]: Without dead ends: 10188 [2019-12-07 12:43:50,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:43:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10188 states. [2019-12-07 12:43:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10188 to 6952. [2019-12-07 12:43:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6952 states. [2019-12-07 12:43:50,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 16639 transitions. [2019-12-07 12:43:50,812 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 16639 transitions. Word has length 62 [2019-12-07 12:43:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:50,812 INFO L462 AbstractCegarLoop]: Abstraction has 6952 states and 16639 transitions. [2019-12-07 12:43:50,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:43:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 16639 transitions. [2019-12-07 12:43:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:43:50,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:50,816 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] [2019-12-07 12:43:50,816 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1644291991, now seen corresponding path program 5 times [2019-12-07 12:43:50,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:50,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817065849] [2019-12-07 12:43:50,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:50,847 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 12:43:50,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817065849] [2019-12-07 12:43:50,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:50,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:43:50,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071417626] [2019-12-07 12:43:50,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:43:50,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:50,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:43:50,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:43:50,848 INFO L87 Difference]: Start difference. First operand 6952 states and 16639 transitions. Second operand 4 states. [2019-12-07 12:43:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:50,872 INFO L93 Difference]: Finished difference Result 7455 states and 17718 transitions. [2019-12-07 12:43:50,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:43:50,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 12:43:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:50,873 INFO L225 Difference]: With dead ends: 7455 [2019-12-07 12:43:50,873 INFO L226 Difference]: Without dead ends: 574 [2019-12-07 12:43:50,873 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 12:43:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-12-07 12:43:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-12-07 12:43:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-07 12:43:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1181 transitions. [2019-12-07 12:43:50,878 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1181 transitions. Word has length 62 [2019-12-07 12:43:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:50,878 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 1181 transitions. [2019-12-07 12:43:50,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:43:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1181 transitions. [2019-12-07 12:43:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 12:43:50,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:50,879 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] [2019-12-07 12:43:50,879 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash -876782608, now seen corresponding path program 1 times [2019-12-07 12:43:50,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:50,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314659965] [2019-12-07 12:43:50,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:43:51,005 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 12:43:51,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314659965] [2019-12-07 12:43:51,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:43:51,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:43:51,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691965528] [2019-12-07 12:43:51,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:43:51,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:43:51,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:43:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:43:51,006 INFO L87 Difference]: Start difference. First operand 574 states and 1181 transitions. Second operand 11 states. [2019-12-07 12:43:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:43:51,448 INFO L93 Difference]: Finished difference Result 1122 states and 2303 transitions. [2019-12-07 12:43:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:43:51,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-12-07 12:43:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:43:51,449 INFO L225 Difference]: With dead ends: 1122 [2019-12-07 12:43:51,449 INFO L226 Difference]: Without dead ends: 815 [2019-12-07 12:43:51,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:43:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-12-07 12:43:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 627. [2019-12-07 12:43:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-12-07 12:43:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1272 transitions. [2019-12-07 12:43:51,454 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1272 transitions. Word has length 63 [2019-12-07 12:43:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:43:51,454 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 1272 transitions. [2019-12-07 12:43:51,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:43:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1272 transitions. [2019-12-07 12:43:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 12:43:51,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:43:51,456 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] [2019-12-07 12:43:51,456 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:43:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:43:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1358707696, now seen corresponding path program 2 times [2019-12-07 12:43:51,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:43:51,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704876750] [2019-12-07 12:43:51,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:43:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:43:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:43:51,534 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:43:51,534 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:43:51,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~weak$$choice2~0_331 0) (= v_~y$mem_tmp~0_262 0) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t430~0.base_35| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t430~0.base_35|) |v_ULTIMATE.start_main_~#t430~0.offset_24| 0)) |v_#memory_int_19|) (= v_~y$w_buff1_used~0_559 0) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd0~0_210 0) (= v_~y$read_delayed~0_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_273 0) (= 0 v_~y$w_buff0~0_396) (= v_~y$flush_delayed~0_331 0) (= v_~y$r_buff1_thd1~0_223 0) (= 0 v_~y$r_buff0_thd2~0_420) (= 0 v_~__unbuffered_p1_EAX~0_45) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t430~0.base_35| 4) |v_#length_23|) (= 0 v_~weak$$choice0~0_251) (= v_~y$r_buff1_thd0~0_289 0) (= v_~__unbuffered_cnt~0_185 0) (= v_~y$w_buff0_used~0_892 0) (= v_~y$r_buff0_thd1~0_153 0) (= 0 |v_#NULL.base_6|) (= v_~x~0_52 0) (= v_~main$tmp_guard1~0_36 0) (= v_~y~0_382 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t430~0.base_35|) (= 0 v_~y$r_buff0_thd3~0_625) (= 0 v_~y$r_buff1_thd3~0_388) (= 0 v_~y$read_delayed_var~0.base_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t430~0.base_35|) 0) (= v_~z~0_29 0) (= 0 v_~y$r_buff1_thd2~0_385) (= v_~__unbuffered_p2_EBX~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t430~0.base_35| 1)) (= 0 |v_ULTIMATE.start_main_~#t430~0.offset_24|) (= 0 v_~__unbuffered_p0_EAX~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t432~0.base=|v_ULTIMATE.start_main_~#t432~0.base_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_388, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_331, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_39, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_66|, ULTIMATE.start_main_~#t430~0.offset=|v_ULTIMATE.start_main_~#t430~0.offset_24|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_72|, ~weak$$choice0~0=v_~weak$$choice0~0_251, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_196|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_420, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~x~0=v_~x~0_52, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_892, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t431~0.base=|v_ULTIMATE.start_main_~#t431~0.base_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_223, ~y$w_buff0~0=v_~y$w_buff0~0_396, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_625, ULTIMATE.start_main_~#t431~0.offset=|v_ULTIMATE.start_main_~#t431~0.offset_22|, ~y~0=v_~y~0_382, ULTIMATE.start_main_~#t430~0.base=|v_ULTIMATE.start_main_~#t430~0.base_35|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_99|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_385, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_~#t432~0.offset=|v_ULTIMATE.start_main_~#t432~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_210, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_331, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t432~0.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t430~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t431~0.base, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t431~0.offset, ~y~0, ULTIMATE.start_main_~#t430~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t432~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:43:51,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t431~0.offset_10|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t431~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t431~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t431~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t431~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t431~0.base_11|) |v_ULTIMATE.start_main_~#t431~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t431~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t431~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t431~0.base=|v_ULTIMATE.start_main_~#t431~0.base_11|, ULTIMATE.start_main_~#t431~0.offset=|v_ULTIMATE.start_main_~#t431~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t431~0.base, ULTIMATE.start_main_~#t431~0.offset, #length] because there is no mapped edge [2019-12-07 12:43:51,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-1-->L834: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t432~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t432~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t432~0.base_13|) |v_ULTIMATE.start_main_~#t432~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t432~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t432~0.offset_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t432~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t432~0.base_13| 0)) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t432~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t432~0.base=|v_ULTIMATE.start_main_~#t432~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t432~0.offset=|v_ULTIMATE.start_main_~#t432~0.offset_11|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t432~0.base, ULTIMATE.start_main_~#t432~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 12:43:51,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_219 v_~y$w_buff1_used~0_122) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_37) (= 1 v_~y$w_buff0~0_91) (= v_~y$w_buff0~0_92 v_~y$w_buff1~0_64) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_122 256) 0)) (not (= (mod v_~y$w_buff0_used~0_218 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_37) (= v_~y$w_buff0_used~0_218 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_219, ~y$w_buff0~0=v_~y$w_buff0~0_92, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$w_buff0~0=v_~y$w_buff0~0_91, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_122} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:43:51,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In256755943 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In256755943 256)))) (or (and (= ~y$w_buff1~0_In256755943 |P2Thread1of1ForFork0_#t~ite28_Out256755943|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out256755943| ~y$w_buff0~0_In256755943) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In256755943, ~y$w_buff1~0=~y$w_buff1~0_In256755943, ~y$w_buff0~0=~y$w_buff0~0_In256755943, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In256755943} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out256755943|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In256755943, ~y$w_buff1~0=~y$w_buff1~0_In256755943, ~y$w_buff0~0=~y$w_buff0~0_In256755943, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In256755943} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 12:43:51,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_37 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 12:43:51,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_101 v_~y$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 12:43:51,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-290013383 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-290013383| ~y$mem_tmp~0_In-290013383) (not .cse0)) (and (= ~y~0_In-290013383 |P2Thread1of1ForFork0_#t~ite48_Out-290013383|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-290013383, ~y$flush_delayed~0=~y$flush_delayed~0_In-290013383, ~y~0=~y~0_In-290013383} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-290013383|, ~y$mem_tmp~0=~y$mem_tmp~0_In-290013383, ~y$flush_delayed~0=~y$flush_delayed~0_In-290013383, ~y~0=~y~0_In-290013383} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 12:43:51,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_36 v_~__unbuffered_p0_EAX~0_14) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 12:43:51,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In640887100 256)))) (or (and .cse0 (= ~y~0_In640887100 |P1Thread1of1ForFork2_#t~ite25_Out640887100|)) (and (= ~y$mem_tmp~0_In640887100 |P1Thread1of1ForFork2_#t~ite25_Out640887100|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In640887100, ~y$flush_delayed~0=~y$flush_delayed~0_In640887100, ~y~0=~y~0_In640887100} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In640887100, ~y$flush_delayed~0=~y$flush_delayed~0_In640887100, ~y~0=~y~0_In640887100, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out640887100|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:43:51,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-462257861 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-462257861 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-462257861| ~y$w_buff0_used~0_In-462257861) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-462257861|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-462257861, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-462257861} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-462257861, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-462257861, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-462257861|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 12:43:51,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1133313362 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1133313362 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1133313362 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1133313362 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1133313362| ~y$w_buff1_used~0_In-1133313362) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1133313362|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1133313362, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1133313362, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1133313362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1133313362} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1133313362, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1133313362, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1133313362, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1133313362|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1133313362} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 12:43:51,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In278728265 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In278728265 256))) (.cse2 (= ~y$r_buff0_thd3~0_In278728265 ~y$r_buff0_thd3~0_Out278728265))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out278728265)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In278728265, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In278728265} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In278728265, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out278728265, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out278728265|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 12:43:51,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-2011752764 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-2011752764 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2011752764 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2011752764 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-2011752764|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-2011752764 |P2Thread1of1ForFork0_#t~ite54_Out-2011752764|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2011752764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2011752764, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2011752764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2011752764} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2011752764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2011752764, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-2011752764|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2011752764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2011752764} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 12:43:51,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L811-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_213 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_213, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 12:43:51,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1)) (= v_~y~0_235 |v_P1Thread1of1ForFork2_#t~ite25_102|) (= v_~y$flush_delayed~0_185 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_102|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_185, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~y~0=v_~y~0_235, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_101|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:43:51,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= 0 (mod v_~y$w_buff0_used~0_302 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:43:51,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-313050587 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-313050587 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-313050587| |ULTIMATE.start_main_#t~ite58_Out-313050587|))) (or (and (or .cse0 .cse1) (= ~y~0_In-313050587 |ULTIMATE.start_main_#t~ite58_Out-313050587|) .cse2) (and (not .cse1) (not .cse0) .cse2 (= ~y$w_buff1~0_In-313050587 |ULTIMATE.start_main_#t~ite58_Out-313050587|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-313050587, ~y~0=~y~0_In-313050587, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-313050587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313050587} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-313050587, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-313050587|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-313050587|, ~y~0=~y~0_In-313050587, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-313050587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313050587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:43:51,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1643112501 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1643112501 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1643112501|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1643112501 |ULTIMATE.start_main_#t~ite60_Out-1643112501|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643112501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1643112501} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1643112501|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643112501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1643112501} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:43:51,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-997616385 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-997616385 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-997616385 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-997616385 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-997616385 |ULTIMATE.start_main_#t~ite61_Out-997616385|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-997616385|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-997616385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997616385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997616385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997616385} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-997616385|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-997616385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997616385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997616385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997616385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:43:51,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In178330238 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In178330238 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out178330238| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out178330238| ~y$r_buff0_thd0~0_In178330238) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In178330238, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In178330238} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out178330238|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In178330238, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In178330238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:43:51,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-416503375 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-416503375 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-416503375 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-416503375 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-416503375| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite63_Out-416503375| ~y$r_buff1_thd0~0_In-416503375) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-416503375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-416503375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-416503375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-416503375} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-416503375|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-416503375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-416503375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-416503375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-416503375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:43:51,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p2_EAX~0_33) (= v_~__unbuffered_p2_EBX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_237 |v_ULTIMATE.start_main_#t~ite63_37|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:43:51,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:43:51 BasicIcfg [2019-12-07 12:43:51,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:43:51,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:43:51,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:43:51,619 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:43:51,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:43:16" (3/4) ... [2019-12-07 12:43:51,621 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:43:51,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~weak$$choice2~0_331 0) (= v_~y$mem_tmp~0_262 0) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t430~0.base_35| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t430~0.base_35|) |v_ULTIMATE.start_main_~#t430~0.offset_24| 0)) |v_#memory_int_19|) (= v_~y$w_buff1_used~0_559 0) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd0~0_210 0) (= v_~y$read_delayed~0_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_273 0) (= 0 v_~y$w_buff0~0_396) (= v_~y$flush_delayed~0_331 0) (= v_~y$r_buff1_thd1~0_223 0) (= 0 v_~y$r_buff0_thd2~0_420) (= 0 v_~__unbuffered_p1_EAX~0_45) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t430~0.base_35| 4) |v_#length_23|) (= 0 v_~weak$$choice0~0_251) (= v_~y$r_buff1_thd0~0_289 0) (= v_~__unbuffered_cnt~0_185 0) (= v_~y$w_buff0_used~0_892 0) (= v_~y$r_buff0_thd1~0_153 0) (= 0 |v_#NULL.base_6|) (= v_~x~0_52 0) (= v_~main$tmp_guard1~0_36 0) (= v_~y~0_382 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t430~0.base_35|) (= 0 v_~y$r_buff0_thd3~0_625) (= 0 v_~y$r_buff1_thd3~0_388) (= 0 v_~y$read_delayed_var~0.base_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t430~0.base_35|) 0) (= v_~z~0_29 0) (= 0 v_~y$r_buff1_thd2~0_385) (= v_~__unbuffered_p2_EBX~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t430~0.base_35| 1)) (= 0 |v_ULTIMATE.start_main_~#t430~0.offset_24|) (= 0 v_~__unbuffered_p0_EAX~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t432~0.base=|v_ULTIMATE.start_main_~#t432~0.base_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_388, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_331, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_39, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_66|, ULTIMATE.start_main_~#t430~0.offset=|v_ULTIMATE.start_main_~#t430~0.offset_24|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_72|, ~weak$$choice0~0=v_~weak$$choice0~0_251, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_196|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_420, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~x~0=v_~x~0_52, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_892, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t431~0.base=|v_ULTIMATE.start_main_~#t431~0.base_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_223, ~y$w_buff0~0=v_~y$w_buff0~0_396, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_625, ULTIMATE.start_main_~#t431~0.offset=|v_ULTIMATE.start_main_~#t431~0.offset_22|, ~y~0=v_~y~0_382, ULTIMATE.start_main_~#t430~0.base=|v_ULTIMATE.start_main_~#t430~0.base_35|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_99|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_385, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_~#t432~0.offset=|v_ULTIMATE.start_main_~#t432~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_210, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_331, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t432~0.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t430~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t431~0.base, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t431~0.offset, ~y~0, ULTIMATE.start_main_~#t430~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t432~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:43:51,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t431~0.offset_10|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t431~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t431~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t431~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t431~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t431~0.base_11|) |v_ULTIMATE.start_main_~#t431~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t431~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t431~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t431~0.base=|v_ULTIMATE.start_main_~#t431~0.base_11|, ULTIMATE.start_main_~#t431~0.offset=|v_ULTIMATE.start_main_~#t431~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t431~0.base, ULTIMATE.start_main_~#t431~0.offset, #length] because there is no mapped edge [2019-12-07 12:43:51,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-1-->L834: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t432~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t432~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t432~0.base_13|) |v_ULTIMATE.start_main_~#t432~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t432~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t432~0.offset_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t432~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t432~0.base_13| 0)) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t432~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t432~0.base=|v_ULTIMATE.start_main_~#t432~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t432~0.offset=|v_ULTIMATE.start_main_~#t432~0.offset_11|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t432~0.base, ULTIMATE.start_main_~#t432~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 12:43:51,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_219 v_~y$w_buff1_used~0_122) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_37) (= 1 v_~y$w_buff0~0_91) (= v_~y$w_buff0~0_92 v_~y$w_buff1~0_64) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_122 256) 0)) (not (= (mod v_~y$w_buff0_used~0_218 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_37) (= v_~y$w_buff0_used~0_218 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_219, ~y$w_buff0~0=v_~y$w_buff0~0_92, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_37, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_37|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$w_buff0~0=v_~y$w_buff0~0_91, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_37, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_39, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_122} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:43:51,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In256755943 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In256755943 256)))) (or (and (= ~y$w_buff1~0_In256755943 |P2Thread1of1ForFork0_#t~ite28_Out256755943|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out256755943| ~y$w_buff0~0_In256755943) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In256755943, ~y$w_buff1~0=~y$w_buff1~0_In256755943, ~y$w_buff0~0=~y$w_buff0~0_In256755943, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In256755943} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out256755943|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In256755943, ~y$w_buff1~0=~y$w_buff1~0_In256755943, ~y$w_buff0~0=~y$w_buff0~0_In256755943, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In256755943} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 12:43:51,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_37 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 12:43:51,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_101 v_~y$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 12:43:51,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-290013383 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-290013383| ~y$mem_tmp~0_In-290013383) (not .cse0)) (and (= ~y~0_In-290013383 |P2Thread1of1ForFork0_#t~ite48_Out-290013383|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-290013383, ~y$flush_delayed~0=~y$flush_delayed~0_In-290013383, ~y~0=~y~0_In-290013383} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-290013383|, ~y$mem_tmp~0=~y$mem_tmp~0_In-290013383, ~y$flush_delayed~0=~y$flush_delayed~0_In-290013383, ~y~0=~y~0_In-290013383} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 12:43:51,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_36 v_~__unbuffered_p0_EAX~0_14) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 12:43:51,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In640887100 256)))) (or (and .cse0 (= ~y~0_In640887100 |P1Thread1of1ForFork2_#t~ite25_Out640887100|)) (and (= ~y$mem_tmp~0_In640887100 |P1Thread1of1ForFork2_#t~ite25_Out640887100|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In640887100, ~y$flush_delayed~0=~y$flush_delayed~0_In640887100, ~y~0=~y~0_In640887100} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In640887100, ~y$flush_delayed~0=~y$flush_delayed~0_In640887100, ~y~0=~y~0_In640887100, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out640887100|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:43:51,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-462257861 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-462257861 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-462257861| ~y$w_buff0_used~0_In-462257861) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-462257861|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-462257861, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-462257861} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-462257861, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-462257861, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-462257861|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 12:43:51,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1133313362 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1133313362 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1133313362 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1133313362 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1133313362| ~y$w_buff1_used~0_In-1133313362) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1133313362|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1133313362, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1133313362, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1133313362, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1133313362} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1133313362, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1133313362, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1133313362, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1133313362|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1133313362} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 12:43:51,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In278728265 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In278728265 256))) (.cse2 (= ~y$r_buff0_thd3~0_In278728265 ~y$r_buff0_thd3~0_Out278728265))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out278728265)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In278728265, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In278728265} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In278728265, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out278728265, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out278728265|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 12:43:51,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-2011752764 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-2011752764 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2011752764 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2011752764 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-2011752764|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-2011752764 |P2Thread1of1ForFork0_#t~ite54_Out-2011752764|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2011752764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2011752764, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2011752764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2011752764} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2011752764, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2011752764, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-2011752764|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2011752764, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2011752764} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 12:43:51,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L811-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_213 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_213, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 12:43:51,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1)) (= v_~y~0_235 |v_P1Thread1of1ForFork2_#t~ite25_102|) (= v_~y$flush_delayed~0_185 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_102|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_185, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~y~0=v_~y~0_235, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_101|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:43:51,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= 0 (mod v_~y$w_buff0_used~0_302 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:43:51,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-313050587 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-313050587 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out-313050587| |ULTIMATE.start_main_#t~ite58_Out-313050587|))) (or (and (or .cse0 .cse1) (= ~y~0_In-313050587 |ULTIMATE.start_main_#t~ite58_Out-313050587|) .cse2) (and (not .cse1) (not .cse0) .cse2 (= ~y$w_buff1~0_In-313050587 |ULTIMATE.start_main_#t~ite58_Out-313050587|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-313050587, ~y~0=~y~0_In-313050587, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-313050587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313050587} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-313050587, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-313050587|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-313050587|, ~y~0=~y~0_In-313050587, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-313050587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313050587} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:43:51,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1643112501 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1643112501 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-1643112501|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1643112501 |ULTIMATE.start_main_#t~ite60_Out-1643112501|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643112501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1643112501} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1643112501|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643112501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1643112501} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:43:51,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-997616385 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-997616385 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-997616385 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-997616385 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-997616385 |ULTIMATE.start_main_#t~ite61_Out-997616385|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite61_Out-997616385|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-997616385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997616385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997616385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997616385} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-997616385|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-997616385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-997616385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-997616385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-997616385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:43:51,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In178330238 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In178330238 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out178330238| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out178330238| ~y$r_buff0_thd0~0_In178330238) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In178330238, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In178330238} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out178330238|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In178330238, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In178330238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:43:51,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-416503375 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-416503375 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-416503375 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-416503375 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-416503375| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite63_Out-416503375| ~y$r_buff1_thd0~0_In-416503375) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-416503375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-416503375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-416503375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-416503375} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-416503375|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-416503375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-416503375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-416503375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-416503375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:43:51,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p2_EAX~0_33) (= v_~__unbuffered_p2_EBX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_237 |v_ULTIMATE.start_main_#t~ite63_37|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:43:51,700 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_55c0d3b8-2f37-4aff-a317-993841cdd79b/bin/uautomizer/witness.graphml [2019-12-07 12:43:51,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:43:51,701 INFO L168 Benchmark]: Toolchain (without parser) took 35942.59 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 940.9 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 12:43:51,701 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:43:51,702 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:51,702 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.22 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 12:43:51,702 INFO L168 Benchmark]: Boogie Preprocessor took 26.88 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 12:43:51,702 INFO L168 Benchmark]: RCFGBuilder took 427.05 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.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:51,703 INFO L168 Benchmark]: TraceAbstraction took 34952.69 ms. Allocated memory was 1.1 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 12:43:51,703 INFO L168 Benchmark]: Witness Printer took 81.37 ms. Allocated memory is still 5.3 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:43:51,704 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 412.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.22 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 26.88 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 427.05 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.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34952.69 ms. Allocated memory was 1.1 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 81.37 ms. Allocated memory is still 5.3 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 195 ProgramPointsBefore, 111 ProgramPointsAfterwards, 241 TransitionsBefore, 134 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 27 ChoiceCompositions, 9672 VarBasedMoverChecksPositive, 313 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 317 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 147047 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t430, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t431, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t432, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 y$flush_delayed = weak$$choice2 [L791] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L795] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y = y$flush_delayed ? y$mem_tmp : y [L801] 3 y$flush_delayed = (_Bool)0 [L804] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L808] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L809] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 34.7s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4686 SDtfs, 7016 SDslu, 10702 SDs, 0 SdLazy, 5833 SolverSat, 382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117574occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 52126 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 772 ConstructedInterpolants, 0 QuantifiedInterpolants, 231577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...