/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:01:20,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:01:20,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:01:20,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:01:20,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:01:20,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:01:20,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:01:20,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:01:20,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:01:20,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:01:20,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:01:20,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:01:20,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:01:20,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:01:20,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:01:20,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:01:20,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:01:20,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:01:20,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:01:20,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:01:20,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:01:20,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:01:20,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:01:20,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:01:20,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:01:20,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:01:20,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:01:20,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:01:20,279 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:01:20,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:01:20,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:01:20,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:01:20,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:01:20,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:01:20,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:01:20,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:01:20,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:01:20,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:01:20,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:01:20,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:01:20,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:01:20,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 23:01:20,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:01:20,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:01:20,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:01:20,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:01:20,312 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:01:20,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:01:20,313 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:01:20,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:01:20,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:01:20,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:01:20,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:01:20,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:01:20,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:01:20,314 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:01:20,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:01:20,315 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:01:20,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:01:20,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:01:20,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:01:20,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:01:20,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:01:20,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:01:20,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:01:20,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:01:20,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:01:20,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:01:20,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:01:20,317 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:01:20,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:01:20,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:01:20,317 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:01:20,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:01:20,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:01:20,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:01:20,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:01:20,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:01:20,632 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:01:20,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.opt.i [2019-12-27 23:01:20,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb77e37e/e4f62bd2983648589c471580845494b3/FLAG45539e26b [2019-12-27 23:01:21,275 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:01:21,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_pso.opt.i [2019-12-27 23:01:21,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb77e37e/e4f62bd2983648589c471580845494b3/FLAG45539e26b [2019-12-27 23:01:21,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb77e37e/e4f62bd2983648589c471580845494b3 [2019-12-27 23:01:21,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:01:21,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:01:21,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:01:21,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:01:21,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:01:21,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:01:21" (1/1) ... [2019-12-27 23:01:21,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:21, skipping insertion in model container [2019-12-27 23:01:21,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:01:21" (1/1) ... [2019-12-27 23:01:21,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:01:21,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:01:22,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:01:22,112 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:01:22,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:01:22,265 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:01:22,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22 WrapperNode [2019-12-27 23:01:22,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:01:22,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:01:22,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:01:22,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:01:22,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:01:22,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:01:22,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:01:22,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:01:22,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... [2019-12-27 23:01:22,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:01:22,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:01:22,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:01:22,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:01:22,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-27 23:01:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:01:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:01:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:01:22,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:01:22,438 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 23:01:22,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 23:01:22,438 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 23:01:22,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 23:01:22,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 23:01:22,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 23:01:22,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:01:22,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:01:22,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:01:22,441 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:01:23,140 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:01:23,141 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 23:01:23,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:01:23 BoogieIcfgContainer [2019-12-27 23:01:23,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:01:23,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:01:23,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:01:23,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:01:23,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:01:21" (1/3) ... [2019-12-27 23:01:23,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fe3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:01:23, skipping insertion in model container [2019-12-27 23:01:23,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:01:22" (2/3) ... [2019-12-27 23:01:23,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fe3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:01:23, skipping insertion in model container [2019-12-27 23:01:23,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:01:23" (3/3) ... [2019-12-27 23:01:23,151 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_pso.opt.i [2019-12-27 23:01:23,161 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:01:23,162 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:01:23,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:01:23,170 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:01:23,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,235 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,235 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,236 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,236 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,236 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,248 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,252 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,281 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:01:23,299 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 23:01:23,320 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:01:23,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:01:23,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:01:23,320 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:01:23,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:01:23,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:01:23,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:01:23,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:01:23,338 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-27 23:01:23,340 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 23:01:23,441 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 23:01:23,442 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:01:23,458 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 23:01:23,475 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 23:01:23,552 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 23:01:23,552 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:01:23,558 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 23:01:23,572 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 23:01:23,573 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:01:26,647 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 23:01:27,058 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 23:01:27,178 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 23:01:27,204 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48572 [2019-12-27 23:01:27,204 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 23:01:27,207 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-27 23:01:28,147 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14526 states. [2019-12-27 23:01:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 14526 states. [2019-12-27 23:01:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 23:01:28,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:28,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:28,156 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-27 23:01:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1566852802, now seen corresponding path program 1 times [2019-12-27 23:01:28,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:28,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434047215] [2019-12-27 23:01:28,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:28,441 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-27 23:01:28,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434047215] [2019-12-27 23:01:28,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:28,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:01:28,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1772681092] [2019-12-27 23:01:28,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:28,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:28,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 23:01:28,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:28,477 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:28,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:28,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:28,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:28,499 INFO L87 Difference]: Start difference. First operand 14526 states. Second operand 3 states. [2019-12-27 23:01:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:28,884 INFO L93 Difference]: Finished difference Result 13996 states and 53893 transitions. [2019-12-27 23:01:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:28,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 23:01:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:29,077 INFO L225 Difference]: With dead ends: 13996 [2019-12-27 23:01:29,078 INFO L226 Difference]: Without dead ends: 13156 [2019-12-27 23:01:29,079 INFO L631 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-27 23:01:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13156 states. [2019-12-27 23:01:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13156 to 13156. [2019-12-27 23:01:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13156 states. [2019-12-27 23:01:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13156 states to 13156 states and 50585 transitions. [2019-12-27 23:01:29,844 INFO L78 Accepts]: Start accepts. Automaton has 13156 states and 50585 transitions. Word has length 7 [2019-12-27 23:01:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:29,846 INFO L462 AbstractCegarLoop]: Abstraction has 13156 states and 50585 transitions. [2019-12-27 23:01:29,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 13156 states and 50585 transitions. [2019-12-27 23:01:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:01:29,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:29,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:29,859 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-27 23:01:29,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1632341996, now seen corresponding path program 1 times [2019-12-27 23:01:29,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:29,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747471290] [2019-12-27 23:01:29,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:30,027 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-27 23:01:30,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747471290] [2019-12-27 23:01:30,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:30,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:01:30,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1813365663] [2019-12-27 23:01:30,029 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:30,031 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:30,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:01:30,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:30,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:30,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:01:30,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:30,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:01:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:01:30,039 INFO L87 Difference]: Start difference. First operand 13156 states and 50585 transitions. Second operand 4 states. [2019-12-27 23:01:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:31,381 INFO L93 Difference]: Finished difference Result 19646 states and 72584 transitions. [2019-12-27 23:01:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:01:31,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 23:01:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:31,488 INFO L225 Difference]: With dead ends: 19646 [2019-12-27 23:01:31,488 INFO L226 Difference]: Without dead ends: 19616 [2019-12-27 23:01:31,489 INFO L631 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-27 23:01:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19616 states. [2019-12-27 23:01:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19616 to 17838. [2019-12-27 23:01:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17838 states. [2019-12-27 23:01:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17838 states to 17838 states and 66884 transitions. [2019-12-27 23:01:32,319 INFO L78 Accepts]: Start accepts. Automaton has 17838 states and 66884 transitions. Word has length 13 [2019-12-27 23:01:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:32,319 INFO L462 AbstractCegarLoop]: Abstraction has 17838 states and 66884 transitions. [2019-12-27 23:01:32,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:01:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17838 states and 66884 transitions. [2019-12-27 23:01:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 23:01:32,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:32,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:32,327 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-27 23:01:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:32,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1674715579, now seen corresponding path program 1 times [2019-12-27 23:01:32,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:32,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84261115] [2019-12-27 23:01:32,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:32,412 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-27 23:01:32,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84261115] [2019-12-27 23:01:32,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:32,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:01:32,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66404072] [2019-12-27 23:01:32,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:32,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:32,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 23:01:32,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:32,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:01:32,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:01:32,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:32,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:01:32,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:01:32,504 INFO L87 Difference]: Start difference. First operand 17838 states and 66884 transitions. Second operand 7 states. [2019-12-27 23:01:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:33,311 INFO L93 Difference]: Finished difference Result 24700 states and 90839 transitions. [2019-12-27 23:01:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:01:33,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 23:01:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:33,438 INFO L225 Difference]: With dead ends: 24700 [2019-12-27 23:01:33,438 INFO L226 Difference]: Without dead ends: 24662 [2019-12-27 23:01:33,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:01:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24662 states. [2019-12-27 23:01:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24662 to 21030. [2019-12-27 23:01:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21030 states. [2019-12-27 23:01:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21030 states to 21030 states and 78424 transitions. [2019-12-27 23:01:34,342 INFO L78 Accepts]: Start accepts. Automaton has 21030 states and 78424 transitions. Word has length 16 [2019-12-27 23:01:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:34,342 INFO L462 AbstractCegarLoop]: Abstraction has 21030 states and 78424 transitions. [2019-12-27 23:01:34,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:01:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 21030 states and 78424 transitions. [2019-12-27 23:01:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:01:34,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:34,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:34,351 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-27 23:01:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1310988069, now seen corresponding path program 1 times [2019-12-27 23:01:34,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:34,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865716300] [2019-12-27 23:01:34,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:34,405 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-27 23:01:34,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865716300] [2019-12-27 23:01:34,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:34,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:01:34,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1988974336] [2019-12-27 23:01:34,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:34,410 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:34,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 23:01:34,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:34,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:34,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:34,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:34,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:34,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:34,418 INFO L87 Difference]: Start difference. First operand 21030 states and 78424 transitions. Second operand 3 states. [2019-12-27 23:01:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:34,522 INFO L93 Difference]: Finished difference Result 20886 states and 77807 transitions. [2019-12-27 23:01:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:34,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 23:01:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:34,605 INFO L225 Difference]: With dead ends: 20886 [2019-12-27 23:01:34,605 INFO L226 Difference]: Without dead ends: 20886 [2019-12-27 23:01:34,605 INFO L631 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-27 23:01:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20886 states. [2019-12-27 23:01:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20886 to 20886. [2019-12-27 23:01:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20886 states. [2019-12-27 23:01:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 77807 transitions. [2019-12-27 23:01:36,312 INFO L78 Accepts]: Start accepts. Automaton has 20886 states and 77807 transitions. Word has length 18 [2019-12-27 23:01:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:36,312 INFO L462 AbstractCegarLoop]: Abstraction has 20886 states and 77807 transitions. [2019-12-27 23:01:36,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20886 states and 77807 transitions. [2019-12-27 23:01:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:01:36,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:36,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:36,321 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-27 23:01:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 718938577, now seen corresponding path program 1 times [2019-12-27 23:01:36,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:36,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680964992] [2019-12-27 23:01:36,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:36,411 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-27 23:01:36,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680964992] [2019-12-27 23:01:36,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:36,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:01:36,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790385138] [2019-12-27 23:01:36,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:36,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:36,418 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 23:01:36,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:36,436 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:01:36,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:01:36,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:01:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:01:36,437 INFO L87 Difference]: Start difference. First operand 20886 states and 77807 transitions. Second operand 6 states. [2019-12-27 23:01:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:36,653 INFO L93 Difference]: Finished difference Result 4037 states and 11919 transitions. [2019-12-27 23:01:36,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:01:36,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 23:01:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:36,661 INFO L225 Difference]: With dead ends: 4037 [2019-12-27 23:01:36,661 INFO L226 Difference]: Without dead ends: 2813 [2019-12-27 23:01:36,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:01:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2019-12-27 23:01:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2287. [2019-12-27 23:01:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2019-12-27 23:01:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 6105 transitions. [2019-12-27 23:01:36,709 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 6105 transitions. Word has length 19 [2019-12-27 23:01:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:36,709 INFO L462 AbstractCegarLoop]: Abstraction has 2287 states and 6105 transitions. [2019-12-27 23:01:36,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:01:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 6105 transitions. [2019-12-27 23:01:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 23:01:36,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:36,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:36,714 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-27 23:01:36,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:36,715 INFO L82 PathProgramCache]: Analyzing trace with hash -990981209, now seen corresponding path program 1 times [2019-12-27 23:01:36,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:36,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957985716] [2019-12-27 23:01:36,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:36,969 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-27 23:01:36,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957985716] [2019-12-27 23:01:36,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:36,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:01:36,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794880162] [2019-12-27 23:01:36,970 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:36,978 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:36,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 48 transitions. [2019-12-27 23:01:36,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:36,990 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:36,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:36,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:36,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:36,991 INFO L87 Difference]: Start difference. First operand 2287 states and 6105 transitions. Second operand 3 states. [2019-12-27 23:01:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:37,010 INFO L93 Difference]: Finished difference Result 3617 states and 9326 transitions. [2019-12-27 23:01:37,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:37,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 23:01:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:37,017 INFO L225 Difference]: With dead ends: 3617 [2019-12-27 23:01:37,017 INFO L226 Difference]: Without dead ends: 2309 [2019-12-27 23:01:37,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-27 23:01:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2019-12-27 23:01:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 2277. [2019-12-27 23:01:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2019-12-27 23:01:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 6009 transitions. [2019-12-27 23:01:37,056 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 6009 transitions. Word has length 29 [2019-12-27 23:01:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:37,056 INFO L462 AbstractCegarLoop]: Abstraction has 2277 states and 6009 transitions. [2019-12-27 23:01:37,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 6009 transitions. [2019-12-27 23:01:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 23:01:37,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:37,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:37,060 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-27 23:01:37,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -322199084, now seen corresponding path program 1 times [2019-12-27 23:01:37,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:37,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503892288] [2019-12-27 23:01:37,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:37,105 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-27 23:01:37,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503892288] [2019-12-27 23:01:37,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:37,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:01:37,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548746021] [2019-12-27 23:01:37,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:37,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:37,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 23:01:37,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:37,174 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:01:37,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:01:37,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:37,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:01:37,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:01:37,176 INFO L87 Difference]: Start difference. First operand 2277 states and 6009 transitions. Second operand 5 states. [2019-12-27 23:01:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:37,275 INFO L93 Difference]: Finished difference Result 3264 states and 8342 transitions. [2019-12-27 23:01:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:37,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 23:01:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:37,281 INFO L225 Difference]: With dead ends: 3264 [2019-12-27 23:01:37,281 INFO L226 Difference]: Without dead ends: 3264 [2019-12-27 23:01:37,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:01:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2019-12-27 23:01:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 2490. [2019-12-27 23:01:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2490 states. [2019-12-27 23:01:37,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 6432 transitions. [2019-12-27 23:01:37,330 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 6432 transitions. Word has length 29 [2019-12-27 23:01:37,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:37,331 INFO L462 AbstractCegarLoop]: Abstraction has 2490 states and 6432 transitions. [2019-12-27 23:01:37,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:01:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 6432 transitions. [2019-12-27 23:01:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 23:01:37,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:37,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:37,336 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-27 23:01:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:37,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1477101190, now seen corresponding path program 1 times [2019-12-27 23:01:37,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:37,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106341709] [2019-12-27 23:01:37,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:37,422 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-27 23:01:37,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106341709] [2019-12-27 23:01:37,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:37,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 23:01:37,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [534055613] [2019-12-27 23:01:37,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:37,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:37,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 97 transitions. [2019-12-27 23:01:37,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:37,509 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:01:37,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:01:37,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:01:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:01:37,512 INFO L87 Difference]: Start difference. First operand 2490 states and 6432 transitions. Second operand 8 states. [2019-12-27 23:01:38,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:38,081 INFO L93 Difference]: Finished difference Result 3452 states and 8642 transitions. [2019-12-27 23:01:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:01:38,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 23:01:38,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:38,088 INFO L225 Difference]: With dead ends: 3452 [2019-12-27 23:01:38,088 INFO L226 Difference]: Without dead ends: 3448 [2019-12-27 23:01:38,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:01:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2019-12-27 23:01:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 2534. [2019-12-27 23:01:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-27 23:01:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 6521 transitions. [2019-12-27 23:01:38,139 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 6521 transitions. Word has length 29 [2019-12-27 23:01:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:38,140 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 6521 transitions. [2019-12-27 23:01:38,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:01:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 6521 transitions. [2019-12-27 23:01:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 23:01:38,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:38,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:01:38,145 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-27 23:01:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash 806369611, now seen corresponding path program 2 times [2019-12-27 23:01:38,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:38,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217621] [2019-12-27 23:01:38,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:38,217 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-27 23:01:38,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217621] [2019-12-27 23:01:38,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:38,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:01:38,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271622615] [2019-12-27 23:01:38,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:38,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:38,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 56 transitions. [2019-12-27 23:01:38,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:38,235 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:01:38,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:01:38,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:38,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:01:38,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:01:38,236 INFO L87 Difference]: Start difference. First operand 2534 states and 6521 transitions. Second operand 5 states. [2019-12-27 23:01:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:38,822 INFO L93 Difference]: Finished difference Result 3671 states and 9368 transitions. [2019-12-27 23:01:38,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:01:38,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 23:01:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:38,828 INFO L225 Difference]: With dead ends: 3671 [2019-12-27 23:01:38,828 INFO L226 Difference]: Without dead ends: 3671 [2019-12-27 23:01:38,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:01:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-12-27 23:01:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3183. [2019-12-27 23:01:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-12-27 23:01:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 8205 transitions. [2019-12-27 23:01:38,886 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 8205 transitions. Word has length 29 [2019-12-27 23:01:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:38,886 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 8205 transitions. [2019-12-27 23:01:38,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:01:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 8205 transitions. [2019-12-27 23:01:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:01:38,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:38,891 INFO L411 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] [2019-12-27 23:01:38,892 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-27 23:01:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1983062445, now seen corresponding path program 1 times [2019-12-27 23:01:38,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:38,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863011822] [2019-12-27 23:01:38,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:38,966 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-27 23:01:38,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863011822] [2019-12-27 23:01:38,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:38,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:01:38,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [734905319] [2019-12-27 23:01:38,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:38,972 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:38,981 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 57 transitions. [2019-12-27 23:01:38,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:38,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:38,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:01:38,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:38,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:01:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:01:38,983 INFO L87 Difference]: Start difference. First operand 3183 states and 8205 transitions. Second operand 6 states. [2019-12-27 23:01:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:39,068 INFO L93 Difference]: Finished difference Result 2227 states and 5795 transitions. [2019-12-27 23:01:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:01:39,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-27 23:01:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:39,072 INFO L225 Difference]: With dead ends: 2227 [2019-12-27 23:01:39,072 INFO L226 Difference]: Without dead ends: 1951 [2019-12-27 23:01:39,073 INFO L631 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-27 23:01:39,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2019-12-27 23:01:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1747. [2019-12-27 23:01:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1747 states. [2019-12-27 23:01:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 4610 transitions. [2019-12-27 23:01:39,104 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 4610 transitions. Word has length 30 [2019-12-27 23:01:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:39,104 INFO L462 AbstractCegarLoop]: Abstraction has 1747 states and 4610 transitions. [2019-12-27 23:01:39,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:01:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 4610 transitions. [2019-12-27 23:01:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:01:39,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:39,109 INFO L411 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] [2019-12-27 23:01:39,109 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-27 23:01:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:39,110 INFO L82 PathProgramCache]: Analyzing trace with hash 583125687, now seen corresponding path program 1 times [2019-12-27 23:01:39,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:39,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795491581] [2019-12-27 23:01:39,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:39,184 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-27 23:01:39,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795491581] [2019-12-27 23:01:39,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:39,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:01:39,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1142544565] [2019-12-27 23:01:39,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:39,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:39,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 113 transitions. [2019-12-27 23:01:39,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:39,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:01:39,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:39,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:39,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:39,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:39,252 INFO L87 Difference]: Start difference. First operand 1747 states and 4610 transitions. Second operand 3 states. [2019-12-27 23:01:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:39,291 INFO L93 Difference]: Finished difference Result 2053 states and 5201 transitions. [2019-12-27 23:01:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:39,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 23:01:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:39,296 INFO L225 Difference]: With dead ends: 2053 [2019-12-27 23:01:39,296 INFO L226 Difference]: Without dead ends: 2053 [2019-12-27 23:01:39,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 23:01:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-27 23:01:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1769. [2019-12-27 23:01:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1769 states. [2019-12-27 23:01:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 4543 transitions. [2019-12-27 23:01:39,317 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 4543 transitions. Word has length 44 [2019-12-27 23:01:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:39,317 INFO L462 AbstractCegarLoop]: Abstraction has 1769 states and 4543 transitions. [2019-12-27 23:01:39,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 4543 transitions. [2019-12-27 23:01:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:01:39,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:39,321 INFO L411 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] [2019-12-27 23:01:39,321 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-27 23:01:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:39,321 INFO L82 PathProgramCache]: Analyzing trace with hash -652505403, now seen corresponding path program 1 times [2019-12-27 23:01:39,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:39,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089715983] [2019-12-27 23:01:39,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:39,427 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-27 23:01:39,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089715983] [2019-12-27 23:01:39,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:39,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:01:39,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1147795228] [2019-12-27 23:01:39,428 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:39,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:39,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 92 transitions. [2019-12-27 23:01:39,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:39,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 23:01:39,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:01:39,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:39,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:01:39,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:01:39,485 INFO L87 Difference]: Start difference. First operand 1769 states and 4543 transitions. Second operand 7 states. [2019-12-27 23:01:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:39,727 INFO L93 Difference]: Finished difference Result 4558 states and 11512 transitions. [2019-12-27 23:01:39,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:01:39,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 23:01:39,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:39,732 INFO L225 Difference]: With dead ends: 4558 [2019-12-27 23:01:39,732 INFO L226 Difference]: Without dead ends: 2920 [2019-12-27 23:01:39,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:01:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2019-12-27 23:01:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1870. [2019-12-27 23:01:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2019-12-27 23:01:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 4768 transitions. [2019-12-27 23:01:39,761 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 4768 transitions. Word has length 44 [2019-12-27 23:01:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:39,761 INFO L462 AbstractCegarLoop]: Abstraction has 1870 states and 4768 transitions. [2019-12-27 23:01:39,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:01:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 4768 transitions. [2019-12-27 23:01:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:01:39,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:39,764 INFO L411 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] [2019-12-27 23:01:39,764 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-27 23:01:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:39,765 INFO L82 PathProgramCache]: Analyzing trace with hash 245120113, now seen corresponding path program 2 times [2019-12-27 23:01:39,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:39,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198560152] [2019-12-27 23:01:39,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:39,952 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-27 23:01:39,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198560152] [2019-12-27 23:01:39,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:39,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 23:01:39,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1635223259] [2019-12-27 23:01:39,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:39,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:40,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 143 transitions. [2019-12-27 23:01:40,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:40,285 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:01:40,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:01:40,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:40,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:01:40,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:01:40,286 INFO L87 Difference]: Start difference. First operand 1870 states and 4768 transitions. Second operand 14 states. [2019-12-27 23:01:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:42,861 INFO L93 Difference]: Finished difference Result 4376 states and 10531 transitions. [2019-12-27 23:01:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:01:42,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-12-27 23:01:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:42,867 INFO L225 Difference]: With dead ends: 4376 [2019-12-27 23:01:42,868 INFO L226 Difference]: Without dead ends: 4376 [2019-12-27 23:01:42,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=410, Invalid=1660, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 23:01:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2019-12-27 23:01:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 1612. [2019-12-27 23:01:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2019-12-27 23:01:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 3977 transitions. [2019-12-27 23:01:42,923 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 3977 transitions. Word has length 44 [2019-12-27 23:01:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:42,924 INFO L462 AbstractCegarLoop]: Abstraction has 1612 states and 3977 transitions. [2019-12-27 23:01:42,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:01:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 3977 transitions. [2019-12-27 23:01:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 23:01:42,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:42,926 INFO L411 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] [2019-12-27 23:01:42,926 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-27 23:01:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash 32251683, now seen corresponding path program 3 times [2019-12-27 23:01:42,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:42,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381053646] [2019-12-27 23:01:42,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:01:42,998 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-27 23:01:42,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381053646] [2019-12-27 23:01:42,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:01:42,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:01:43,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1026181326] [2019-12-27 23:01:43,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:01:43,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:01:43,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 105 transitions. [2019-12-27 23:01:43,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:01:43,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:01:43,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:01:43,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:01:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:01:43,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:01:43,051 INFO L87 Difference]: Start difference. First operand 1612 states and 3977 transitions. Second operand 3 states. [2019-12-27 23:01:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:01:43,071 INFO L93 Difference]: Finished difference Result 1610 states and 3972 transitions. [2019-12-27 23:01:43,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:01:43,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 23:01:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:01:43,074 INFO L225 Difference]: With dead ends: 1610 [2019-12-27 23:01:43,074 INFO L226 Difference]: Without dead ends: 1610 [2019-12-27 23:01:43,074 INFO L631 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-27 23:01:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2019-12-27 23:01:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1374. [2019-12-27 23:01:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-27 23:01:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 3430 transitions. [2019-12-27 23:01:43,102 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 3430 transitions. Word has length 44 [2019-12-27 23:01:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:01:43,103 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 3430 transitions. [2019-12-27 23:01:43,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:01:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 3430 transitions. [2019-12-27 23:01:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 23:01:43,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:01:43,107 INFO L411 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-27 23:01:43,107 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-27 23:01:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:01:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2093039597, now seen corresponding path program 1 times [2019-12-27 23:01:43,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:01:43,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3330063] [2019-12-27 23:01:43,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:01:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:01:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:01:43,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:01:43,228 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:01:43,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~__unbuffered_p1_EAX~0_13) (= v_~y~0_23 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= 0 v_~y$w_buff1~0_22) (= v_~main$tmp_guard0~0_12 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2586~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2586~0.base_27|) |v_ULTIMATE.start_main_~#t2586~0.offset_21| 0))) (= 0 v_~y$flush_delayed~0_14) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd2~0_67 0) (= 0 v_~y$r_buff1_thd2~0_39) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$r_buff0_thd0~0_22 0) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff1_thd1~0_8 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2586~0.base_27| 4)) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2586~0.base_27|) (= 0 v_~weak$$choice2~0_33) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t2586~0.offset_21|) (= 0 v_~y$w_buff0_used~0_94) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t2586~0.base_27| 1)) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= v_~y$w_buff1_used~0_55 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2586~0.base_27|) 0) (= v_~y$r_buff0_thd3~0_27 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 |v_#NULL.base_5|) (= 0 v_~y$r_buff1_thd3~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ULTIMATE.start_main_~#t2588~0.offset=|v_ULTIMATE.start_main_~#t2588~0.offset_16|, ULTIMATE.start_main_~#t2586~0.base=|v_ULTIMATE.start_main_~#t2586~0.base_27|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|, ~y$w_buff1~0=v_~y$w_buff1~0_22, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_94, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t2588~0.base=|v_ULTIMATE.start_main_~#t2588~0.base_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y~0=v_~y~0_23, ULTIMATE.start_main_~#t2587~0.offset=|v_ULTIMATE.start_main_~#t2587~0.offset_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ULTIMATE.start_main_~#t2586~0.offset=|v_ULTIMATE.start_main_~#t2586~0.offset_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_~#t2587~0.base=|v_ULTIMATE.start_main_~#t2587~0.base_25|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_55} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2588~0.base, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2588~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2586~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2587~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2586~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2587~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 23:01:43,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L814-1-->L816: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2587~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2587~0.offset_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2587~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t2587~0.base_10| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2587~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2587~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2587~0.base_10|) |v_ULTIMATE.start_main_~#t2587~0.offset_9| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2587~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2587~0.offset=|v_ULTIMATE.start_main_~#t2587~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2587~0.base=|v_ULTIMATE.start_main_~#t2587~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2587~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2587~0.base] because there is no mapped edge [2019-12-27 23:01:43,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L816-1-->L818: Formula: (and (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2588~0.base_11| 1) |v_#valid_36|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2588~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2588~0.base_11|) |v_ULTIMATE.start_main_~#t2588~0.offset_10| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2588~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2588~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2588~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t2588~0.offset_10|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2588~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, ULTIMATE.start_main_~#t2588~0.offset=|v_ULTIMATE.start_main_~#t2588~0.offset_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2588~0.base=|v_ULTIMATE.start_main_~#t2588~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t2588~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2588~0.base, #length] because there is no mapped edge [2019-12-27 23:01:43,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0~0_14) (= v_~y$w_buff1_used~0_40 v_~y$w_buff0_used~0_67) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_13) (= 1 v_~y$w_buff0_used~0_66) (= 1 |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|) (= 0 (mod v_~y$w_buff1_used~0_40 256)) (= v_P2Thread1of1ForFork2_~arg.base_4 |v_P2Thread1of1ForFork2_#in~arg.base_4|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_4| v_P2Thread1of1ForFork2_~arg.offset_4) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_4|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_66, ~y$w_buff1~0=v_~y$w_buff1~0_13, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_4, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_4, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_4|, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_40} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 23:01:43,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] P0ENTRY-->P0EXIT: Formula: (and (= 2 v_~z~0_9) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_9, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 23:01:43,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-970624798 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In-970624798 |P1Thread1of1ForFork1_#t~ite9_Out-970624798|) (= |P1Thread1of1ForFork1_#t~ite8_In-970624798| |P1Thread1of1ForFork1_#t~ite8_Out-970624798|)) (and (= ~y$w_buff0~0_In-970624798 |P1Thread1of1ForFork1_#t~ite8_Out-970624798|) .cse0 (= |P1Thread1of1ForFork1_#t~ite8_Out-970624798| |P1Thread1of1ForFork1_#t~ite9_Out-970624798|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-970624798 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In-970624798 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-970624798 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-970624798 256)) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-970624798, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-970624798, ~y$w_buff0~0=~y$w_buff0~0_In-970624798, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-970624798, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-970624798|, ~weak$$choice2~0=~weak$$choice2~0_In-970624798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-970624798} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-970624798, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-970624798, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-970624798|, ~y$w_buff0~0=~y$w_buff0~0_In-970624798, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-970624798, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-970624798|, ~weak$$choice2~0=~weak$$choice2~0_In-970624798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-970624798} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 23:01:43,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In81339999 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out81339999| |P1Thread1of1ForFork1_#t~ite14_Out81339999|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In81339999 256) 0))) (or (= (mod ~y$w_buff0_used~0_In81339999 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In81339999 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In81339999 256))))) (= |P1Thread1of1ForFork1_#t~ite14_Out81339999| ~y$w_buff0_used~0_In81339999) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite14_In81339999| |P1Thread1of1ForFork1_#t~ite14_Out81339999|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite15_Out81339999| ~y$w_buff0_used~0_In81339999)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In81339999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In81339999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In81339999, ~weak$$choice2~0=~weak$$choice2~0_In81339999, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In81339999|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In81339999} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In81339999, ~y$w_buff0_used~0=~y$w_buff0_used~0_In81339999, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In81339999, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out81339999|, ~weak$$choice2~0=~weak$$choice2~0_In81339999, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out81339999|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In81339999} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 23:01:43,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd2~0_43 v_~y$r_buff0_thd2~0_42)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_43, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_10|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 23:01:43,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1383702864 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1383702864 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite28_Out1383702864|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1383702864 |P2Thread1of1ForFork2_#t~ite28_Out1383702864|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1383702864, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1383702864} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1383702864, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1383702864, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1383702864|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 23:01:43,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 23:01:43,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-824636522 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-824636522 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-824636522 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-824636522 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-824636522|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-824636522 |P2Thread1of1ForFork2_#t~ite29_Out-824636522|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-824636522, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-824636522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-824636522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-824636522} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-824636522, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-824636522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-824636522, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-824636522|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-824636522} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 23:01:43,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In124977612 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In124977612 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out124977612 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In124977612 ~y$r_buff0_thd3~0_Out124977612)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In124977612, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In124977612} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In124977612, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out124977612|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out124977612} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 23:01:43,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In-1271119869 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1271119869 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1271119869 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1271119869 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out-1271119869| ~y$r_buff1_thd3~0_In-1271119869) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite31_Out-1271119869| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1271119869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1271119869, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1271119869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1271119869} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1271119869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1271119869, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-1271119869|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1271119869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1271119869} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 23:01:43,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~y$r_buff1_thd3~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 23:01:43,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~y$w_buff0_used~0_72 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 23:01:43,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In159501218 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In159501218 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out159501218| ~y$w_buff1~0_In159501218) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out159501218| ~y~0_In159501218) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In159501218, ~y~0=~y~0_In159501218, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In159501218, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159501218} OutVars{~y$w_buff1~0=~y$w_buff1~0_In159501218, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out159501218|, ~y~0=~y~0_In159501218, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In159501218, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159501218} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 23:01:43,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~y~0=v_~y~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 23:01:43,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-543292647 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-543292647 256)))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-543292647| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite37_Out-543292647| ~y$w_buff0_used~0_In-543292647) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-543292647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-543292647} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-543292647, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-543292647, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-543292647|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 23:01:43,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1486968704 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1486968704 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1486968704 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1486968704 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1486968704|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1486968704 |ULTIMATE.start_main_#t~ite38_Out-1486968704|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1486968704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1486968704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1486968704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1486968704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1486968704, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1486968704, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1486968704|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1486968704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1486968704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 23:01:43,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1547541684 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1547541684 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1547541684 |ULTIMATE.start_main_#t~ite39_Out1547541684|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1547541684| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1547541684, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547541684} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1547541684, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1547541684|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547541684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 23:01:43,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1731213886 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1731213886 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1731213886 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1731213886 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1731213886|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-1731213886 |ULTIMATE.start_main_#t~ite40_Out-1731213886|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1731213886, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1731213886, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1731213886, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1731213886} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1731213886|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1731213886, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1731213886, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1731213886, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1731213886} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 23:01:43,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~z~0_11 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start_main_#t~ite40_13| v_~y$r_buff1_thd0~0_16) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z~0=v_~z~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 23:01:43,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:01:43 BasicIcfg [2019-12-27 23:01:43,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:01:43,381 INFO L168 Benchmark]: Toolchain (without parser) took 21854.50 ms. Allocated memory was 138.9 MB in the beginning and 995.6 MB in the end (delta: 856.7 MB). Free memory was 102.2 MB in the beginning and 605.1 MB in the end (delta: -502.9 MB). Peak memory consumption was 353.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:43,382 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 23:01:43,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.59 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 157.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:43,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.32 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:43,388 INFO L168 Benchmark]: Boogie Preprocessor took 38.58 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:43,388 INFO L168 Benchmark]: RCFGBuilder took 768.32 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 109.6 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:43,390 INFO L168 Benchmark]: TraceAbstraction took 20235.51 ms. Allocated memory was 203.4 MB in the beginning and 995.6 MB in the end (delta: 792.2 MB). Free memory was 109.6 MB in the beginning and 605.1 MB in the end (delta: -495.4 MB). Peak memory consumption was 296.8 MB. Max. memory is 7.1 GB. [2019-12-27 23:01:43,399 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.59 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 157.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.32 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.58 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 768.32 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 109.6 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20235.51 ms. Allocated memory was 203.4 MB in the beginning and 995.6 MB in the end (delta: 792.2 MB). Free memory was 109.6 MB in the beginning and 605.1 MB in the end (delta: -495.4 MB). Peak memory consumption was 296.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 151 ProgramPointsBefore, 74 ProgramPointsAfterwards, 176 TransitionsBefore, 83 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4568 VarBasedMoverChecksPositive, 135 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48572 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2586, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L816] FCALL, FORK 0 pthread_create(&t2587, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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] [L818] FCALL, FORK 0 pthread_create(&t2588, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=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] [L791] 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, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=2] [L746] 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, 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=2] [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, 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=2] [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] 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, 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=2] [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] 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, 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=2] [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)) [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, 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=2] [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, 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=2] [L791] 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) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1776 SDtfs, 2506 SDslu, 4078 SDs, 0 SdLazy, 2765 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21030occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 12682 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 40864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...