/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/mix033_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:56:15,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:56:15,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:56:15,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:56:15,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:56:15,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:56:15,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:56:15,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:56:15,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:56:15,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:56:15,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:56:15,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:56:15,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:56:15,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:56:15,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:56:15,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:56:15,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:56:15,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:56:15,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:56:15,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:56:15,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:56:15,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:56:15,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:56:15,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:56:15,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:56:15,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:56:15,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:56:15,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:56:15,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:56:15,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:56:15,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:56:15,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:56:15,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:56:15,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:56:15,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:56:15,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:56:15,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:56:15,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:56:15,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:56:15,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:56:15,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:56:15,350 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 20:56:15,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:56:15,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:56:15,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:56:15,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:56:15,384 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:56:15,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:56:15,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:56:15,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:56:15,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:56:15,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:56:15,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:56:15,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:56:15,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:56:15,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:56:15,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:56:15,389 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:56:15,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:56:15,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:56:15,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:56:15,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:56:15,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:56:15,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:56:15,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:56:15,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:56:15,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:56:15,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:56:15,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:56:15,392 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:56:15,392 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:56:15,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:56:15,393 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:56:15,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:56:15,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:56:15,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:56:15,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:56:15,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:56:15,681 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:56:15,681 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.opt.i [2019-12-27 20:56:15,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b4ffdb2/0bba1f715cea43c4915df44b82b3fe9d/FLAGf2fbc1951 [2019-12-27 20:56:16,301 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:56:16,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.opt.i [2019-12-27 20:56:16,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b4ffdb2/0bba1f715cea43c4915df44b82b3fe9d/FLAGf2fbc1951 [2019-12-27 20:56:16,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b4ffdb2/0bba1f715cea43c4915df44b82b3fe9d [2019-12-27 20:56:16,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:56:16,565 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:56:16,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:56:16,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:56:16,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:56:16,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:56:16" (1/1) ... [2019-12-27 20:56:16,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e3edf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:16, skipping insertion in model container [2019-12-27 20:56:16,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:56:16" (1/1) ... [2019-12-27 20:56:16,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:56:16,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:56:17,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:56:17,201 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:56:17,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:56:17,338 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:56:17,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17 WrapperNode [2019-12-27 20:56:17,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:56:17,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:56:17,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:56:17,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:56:17,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:56:17,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:56:17,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:56:17,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:56:17,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (1/1) ... [2019-12-27 20:56:17,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:56:17,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:56:17,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:56:17,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:56:17,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (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 20:56:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:56:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:56:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:56:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:56:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:56:17,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:56:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:56:17,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:56:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:56:17,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:56:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:56:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:56:17,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:56:17,507 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 20:56:18,216 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:56:18,217 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:56:18,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:56:18 BoogieIcfgContainer [2019-12-27 20:56:18,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:56:18,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:56:18,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:56:18,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:56:18,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:56:16" (1/3) ... [2019-12-27 20:56:18,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fda3318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:56:18, skipping insertion in model container [2019-12-27 20:56:18,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:56:17" (2/3) ... [2019-12-27 20:56:18,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fda3318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:56:18, skipping insertion in model container [2019-12-27 20:56:18,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:56:18" (3/3) ... [2019-12-27 20:56:18,227 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_power.opt.i [2019-12-27 20:56:18,237 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:56:18,237 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:56:18,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:56:18,245 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:56:18,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,284 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,287 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,288 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,312 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,312 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,313 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,313 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,313 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,331 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,334 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,339 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:56:18,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:56:18,385 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:56:18,385 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:56:18,385 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:56:18,385 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:56:18,385 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:56:18,385 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:56:18,386 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:56:18,386 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:56:18,402 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-12-27 20:56:18,404 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-27 20:56:18,498 INFO L132 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-27 20:56:18,498 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:56:18,512 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 20:56:18,531 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-27 20:56:18,578 INFO L132 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-27 20:56:18,578 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:56:18,585 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 20:56:18,599 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 20:56:18,600 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:56:22,320 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 20:56:22,462 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 20:56:22,498 INFO L206 etLargeBlockEncoding]: Checked pairs total: 43881 [2019-12-27 20:56:22,498 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 20:56:22,502 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 83 transitions [2019-12-27 20:56:23,245 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-27 20:56:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-27 20:56:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:56:23,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:23,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:23,254 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 20:56:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1633137599, now seen corresponding path program 1 times [2019-12-27 20:56:23,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:23,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314980378] [2019-12-27 20:56:23,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:23,479 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 20:56:23,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314980378] [2019-12-27 20:56:23,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:23,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:56:23,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517860107] [2019-12-27 20:56:23,484 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:23,490 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:23,503 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:56:23,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:23,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:23,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:23,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:23,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:23,530 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-27 20:56:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:23,948 INFO L93 Difference]: Finished difference Result 13112 states and 50889 transitions. [2019-12-27 20:56:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:23,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:56:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:24,084 INFO L225 Difference]: With dead ends: 13112 [2019-12-27 20:56:24,085 INFO L226 Difference]: Without dead ends: 12332 [2019-12-27 20:56:24,086 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 20:56:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12332 states. [2019-12-27 20:56:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12332 to 12332. [2019-12-27 20:56:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12332 states. [2019-12-27 20:56:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12332 states to 12332 states and 47787 transitions. [2019-12-27 20:56:25,395 INFO L78 Accepts]: Start accepts. Automaton has 12332 states and 47787 transitions. Word has length 7 [2019-12-27 20:56:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:25,396 INFO L462 AbstractCegarLoop]: Abstraction has 12332 states and 47787 transitions. [2019-12-27 20:56:25,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 12332 states and 47787 transitions. [2019-12-27 20:56:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:56:25,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:25,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:25,402 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 20:56:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -812909038, now seen corresponding path program 1 times [2019-12-27 20:56:25,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:25,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722045161] [2019-12-27 20:56:25,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:25,503 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 20:56:25,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722045161] [2019-12-27 20:56:25,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:25,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:25,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132780054] [2019-12-27 20:56:25,506 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:25,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:25,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:56:25,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:25,512 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:25,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:25,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:25,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:25,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:25,515 INFO L87 Difference]: Start difference. First operand 12332 states and 47787 transitions. Second operand 3 states. [2019-12-27 20:56:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:25,643 INFO L93 Difference]: Finished difference Result 7395 states and 25096 transitions. [2019-12-27 20:56:25,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:25,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 20:56:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:25,695 INFO L225 Difference]: With dead ends: 7395 [2019-12-27 20:56:25,695 INFO L226 Difference]: Without dead ends: 7395 [2019-12-27 20:56:25,696 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 20:56:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7395 states. [2019-12-27 20:56:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7395 to 7395. [2019-12-27 20:56:25,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7395 states. [2019-12-27 20:56:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7395 states to 7395 states and 25096 transitions. [2019-12-27 20:56:25,964 INFO L78 Accepts]: Start accepts. Automaton has 7395 states and 25096 transitions. Word has length 13 [2019-12-27 20:56:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:25,964 INFO L462 AbstractCegarLoop]: Abstraction has 7395 states and 25096 transitions. [2019-12-27 20:56:25,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7395 states and 25096 transitions. [2019-12-27 20:56:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:56:25,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:25,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:25,971 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 20:56:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1068045656, now seen corresponding path program 1 times [2019-12-27 20:56:25,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:25,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994431271] [2019-12-27 20:56:25,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:26,055 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 20:56:26,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994431271] [2019-12-27 20:56:26,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:26,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:26,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1374107349] [2019-12-27 20:56:26,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:26,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:26,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 20:56:26,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:26,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:26,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:56:26,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:56:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:56:26,065 INFO L87 Difference]: Start difference. First operand 7395 states and 25096 transitions. Second operand 4 states. [2019-12-27 20:56:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:26,111 INFO L93 Difference]: Finished difference Result 1726 states and 4713 transitions. [2019-12-27 20:56:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:56:26,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:56:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:26,117 INFO L225 Difference]: With dead ends: 1726 [2019-12-27 20:56:26,118 INFO L226 Difference]: Without dead ends: 1726 [2019-12-27 20:56:26,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:56:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-12-27 20:56:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2019-12-27 20:56:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 20:56:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4713 transitions. [2019-12-27 20:56:26,283 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4713 transitions. Word has length 14 [2019-12-27 20:56:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:26,283 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 4713 transitions. [2019-12-27 20:56:26,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:56:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4713 transitions. [2019-12-27 20:56:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:56:26,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:26,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:26,285 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 20:56:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash -902771085, now seen corresponding path program 1 times [2019-12-27 20:56:26,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:26,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136205513] [2019-12-27 20:56:26,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:26,325 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 20:56:26,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136205513] [2019-12-27 20:56:26,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:26,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:26,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [972021869] [2019-12-27 20:56:26,327 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:26,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:26,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:56:26,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:26,410 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:56:26,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:56:26,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:26,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:56:26,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:56:26,412 INFO L87 Difference]: Start difference. First operand 1726 states and 4713 transitions. Second operand 5 states. [2019-12-27 20:56:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:26,549 INFO L93 Difference]: Finished difference Result 2578 states and 7057 transitions. [2019-12-27 20:56:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:26,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:56:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:26,562 INFO L225 Difference]: With dead ends: 2578 [2019-12-27 20:56:26,562 INFO L226 Difference]: Without dead ends: 2578 [2019-12-27 20:56:26,563 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 20:56:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-27 20:56:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1996. [2019-12-27 20:56:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-12-27 20:56:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 5570 transitions. [2019-12-27 20:56:26,624 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 5570 transitions. Word has length 16 [2019-12-27 20:56:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:26,624 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 5570 transitions. [2019-12-27 20:56:26,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:56:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 5570 transitions. [2019-12-27 20:56:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:56:26,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:26,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:56:26,626 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 20:56:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:26,627 INFO L82 PathProgramCache]: Analyzing trace with hash -807708004, now seen corresponding path program 1 times [2019-12-27 20:56:26,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:26,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081056745] [2019-12-27 20:56:26,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:26,747 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 20:56:26,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081056745] [2019-12-27 20:56:26,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:26,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:26,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907853918] [2019-12-27 20:56:26,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:26,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:26,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:56:26,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:26,821 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:56:26,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:56:26,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:26,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:56:26,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:56:26,823 INFO L87 Difference]: Start difference. First operand 1996 states and 5570 transitions. Second operand 7 states. [2019-12-27 20:56:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:27,285 INFO L93 Difference]: Finished difference Result 2931 states and 7814 transitions. [2019-12-27 20:56:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:56:27,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 20:56:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:27,293 INFO L225 Difference]: With dead ends: 2931 [2019-12-27 20:56:27,293 INFO L226 Difference]: Without dead ends: 2931 [2019-12-27 20:56:27,294 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 20:56:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2019-12-27 20:56:27,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2477. [2019-12-27 20:56:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-12-27 20:56:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 6729 transitions. [2019-12-27 20:56:27,360 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 6729 transitions. Word has length 16 [2019-12-27 20:56:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:27,360 INFO L462 AbstractCegarLoop]: Abstraction has 2477 states and 6729 transitions. [2019-12-27 20:56:27,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:56:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 6729 transitions. [2019-12-27 20:56:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 20:56:27,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:27,366 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 20:56:27,366 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 20:56:27,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1606250141, now seen corresponding path program 1 times [2019-12-27 20:56:27,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:27,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036770635] [2019-12-27 20:56:27,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:27,437 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 20:56:27,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036770635] [2019-12-27 20:56:27,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:27,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:56:27,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939403465] [2019-12-27 20:56:27,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:27,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:27,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 209 transitions. [2019-12-27 20:56:27,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:27,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:56:27,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:56:27,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:27,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:56:27,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:56:27,485 INFO L87 Difference]: Start difference. First operand 2477 states and 6729 transitions. Second operand 6 states. [2019-12-27 20:56:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:27,522 INFO L93 Difference]: Finished difference Result 1480 states and 4149 transitions. [2019-12-27 20:56:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:56:27,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 20:56:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:27,527 INFO L225 Difference]: With dead ends: 1480 [2019-12-27 20:56:27,527 INFO L226 Difference]: Without dead ends: 1480 [2019-12-27 20:56:27,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:56:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-12-27 20:56:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1432. [2019-12-27 20:56:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-12-27 20:56:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 4029 transitions. [2019-12-27 20:56:27,559 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 4029 transitions. Word has length 29 [2019-12-27 20:56:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:27,560 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 4029 transitions. [2019-12-27 20:56:27,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:56:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 4029 transitions. [2019-12-27 20:56:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:27,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:27,564 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 20:56:27,565 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 20:56:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash 2141548715, now seen corresponding path program 1 times [2019-12-27 20:56:27,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:27,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917861910] [2019-12-27 20:56:27,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:27,706 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 20:56:27,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917861910] [2019-12-27 20:56:27,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:27,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:56:27,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1212737884] [2019-12-27 20:56:27,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:27,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:27,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 124 transitions. [2019-12-27 20:56:27,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:27,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:27,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:56:27,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:27,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:56:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:56:27,841 INFO L87 Difference]: Start difference. First operand 1432 states and 4029 transitions. Second operand 4 states. [2019-12-27 20:56:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:27,865 INFO L93 Difference]: Finished difference Result 2017 states and 5395 transitions. [2019-12-27 20:56:27,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:56:27,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-27 20:56:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:27,870 INFO L225 Difference]: With dead ends: 2017 [2019-12-27 20:56:27,870 INFO L226 Difference]: Without dead ends: 1290 [2019-12-27 20:56:27,870 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 20:56:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-12-27 20:56:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-12-27 20:56:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-12-27 20:56:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3570 transitions. [2019-12-27 20:56:27,899 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3570 transitions. Word has length 44 [2019-12-27 20:56:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:27,899 INFO L462 AbstractCegarLoop]: Abstraction has 1290 states and 3570 transitions. [2019-12-27 20:56:27,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:56:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3570 transitions. [2019-12-27 20:56:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:27,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:27,904 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 20:56:27,904 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 20:56:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1012376631, now seen corresponding path program 2 times [2019-12-27 20:56:27,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:27,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922380568] [2019-12-27 20:56:27,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:27,971 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 20:56:27,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922380568] [2019-12-27 20:56:27,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:27,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:27,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126343809] [2019-12-27 20:56:27,973 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:27,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:28,032 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 149 transitions. [2019-12-27 20:56:28,032 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:28,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:28,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:28,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:28,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:28,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:28,034 INFO L87 Difference]: Start difference. First operand 1290 states and 3570 transitions. Second operand 3 states. [2019-12-27 20:56:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:28,050 INFO L93 Difference]: Finished difference Result 1699 states and 4565 transitions. [2019-12-27 20:56:28,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:28,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 20:56:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:28,052 INFO L225 Difference]: With dead ends: 1699 [2019-12-27 20:56:28,052 INFO L226 Difference]: Without dead ends: 441 [2019-12-27 20:56:28,053 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 20:56:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-12-27 20:56:28,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-12-27 20:56:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-12-27 20:56:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1050 transitions. [2019-12-27 20:56:28,062 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1050 transitions. Word has length 44 [2019-12-27 20:56:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:28,062 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 1050 transitions. [2019-12-27 20:56:28,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1050 transitions. [2019-12-27 20:56:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:28,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:28,064 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 20:56:28,064 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 20:56:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1658366409, now seen corresponding path program 3 times [2019-12-27 20:56:28,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:28,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46518231] [2019-12-27 20:56:28,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:28,145 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 20:56:28,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46518231] [2019-12-27 20:56:28,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:28,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:56:28,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [352193239] [2019-12-27 20:56:28,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:28,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:28,197 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 110 transitions. [2019-12-27 20:56:28,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:28,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:56:28,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:56:28,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:28,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:56:28,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:56:28,263 INFO L87 Difference]: Start difference. First operand 441 states and 1050 transitions. Second operand 9 states. [2019-12-27 20:56:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:29,253 INFO L93 Difference]: Finished difference Result 982 states and 2202 transitions. [2019-12-27 20:56:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:56:29,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-12-27 20:56:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:29,259 INFO L225 Difference]: With dead ends: 982 [2019-12-27 20:56:29,259 INFO L226 Difference]: Without dead ends: 982 [2019-12-27 20:56:29,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:56:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-27 20:56:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 758. [2019-12-27 20:56:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-12-27 20:56:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1732 transitions. [2019-12-27 20:56:29,276 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1732 transitions. Word has length 44 [2019-12-27 20:56:29,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:29,276 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1732 transitions. [2019-12-27 20:56:29,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:56:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1732 transitions. [2019-12-27 20:56:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:29,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:29,279 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 20:56:29,279 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 20:56:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash 616615367, now seen corresponding path program 4 times [2019-12-27 20:56:29,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:29,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187032917] [2019-12-27 20:56:29,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:29,357 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 20:56:29,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187032917] [2019-12-27 20:56:29,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:29,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:56:29,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862940292] [2019-12-27 20:56:29,359 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:29,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:29,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 167 transitions. [2019-12-27 20:56:29,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:29,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:56:29,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:56:29,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:29,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:56:29,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:56:29,626 INFO L87 Difference]: Start difference. First operand 758 states and 1732 transitions. Second operand 11 states. [2019-12-27 20:56:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:32,260 INFO L93 Difference]: Finished difference Result 4953 states and 10323 transitions. [2019-12-27 20:56:32,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 20:56:32,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-12-27 20:56:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:32,265 INFO L225 Difference]: With dead ends: 4953 [2019-12-27 20:56:32,265 INFO L226 Difference]: Without dead ends: 2790 [2019-12-27 20:56:32,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=418, Invalid=1652, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 20:56:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-12-27 20:56:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 946. [2019-12-27 20:56:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-27 20:56:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2124 transitions. [2019-12-27 20:56:32,296 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2124 transitions. Word has length 44 [2019-12-27 20:56:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:32,297 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 2124 transitions. [2019-12-27 20:56:32,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:56:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2124 transitions. [2019-12-27 20:56:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 20:56:32,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:32,299 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 20:56:32,300 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 20:56:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:32,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1634630491, now seen corresponding path program 5 times [2019-12-27 20:56:32,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:32,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310286910] [2019-12-27 20:56:32,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:56:32,377 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 20:56:32,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310286910] [2019-12-27 20:56:32,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:56:32,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:56:32,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223045896] [2019-12-27 20:56:32,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:56:32,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:56:32,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 100 transitions. [2019-12-27 20:56:32,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:56:32,420 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:56:32,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:56:32,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:56:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:56:32,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:56:32,421 INFO L87 Difference]: Start difference. First operand 946 states and 2124 transitions. Second operand 3 states. [2019-12-27 20:56:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:56:32,430 INFO L93 Difference]: Finished difference Result 944 states and 2119 transitions. [2019-12-27 20:56:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:56:32,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 20:56:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:56:32,433 INFO L225 Difference]: With dead ends: 944 [2019-12-27 20:56:32,433 INFO L226 Difference]: Without dead ends: 944 [2019-12-27 20:56:32,434 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 20:56:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-12-27 20:56:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 865. [2019-12-27 20:56:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-12-27 20:56:32,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1973 transitions. [2019-12-27 20:56:32,449 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1973 transitions. Word has length 44 [2019-12-27 20:56:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:56:32,449 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1973 transitions. [2019-12-27 20:56:32,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:56:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1973 transitions. [2019-12-27 20:56:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 20:56:32,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:56:32,452 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 20:56:32,452 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 20:56:32,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:56:32,452 INFO L82 PathProgramCache]: Analyzing trace with hash 759529029, now seen corresponding path program 1 times [2019-12-27 20:56:32,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:56:32,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416682051] [2019-12-27 20:56:32,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:56:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:56:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:56:32,552 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:56:32,552 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:56:32,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~z$w_buff1_used~0_56) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd0~0_20 0) (= |v_ULTIMATE.start_main_~#t876~0.offset_21| 0) (= 0 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_19) (= 0 v_~z$r_buff1_thd2~0_39) (= (select .cse0 |v_ULTIMATE.start_main_~#t876~0.base_30|) 0) (= 0 v_~y~0_7) (= v_~z$r_buff0_thd2~0_68 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_17) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~a~0_10 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t876~0.base_30|) (= v_~z$w_buff0_used~0_93 0) (= v_~z$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= v_~z$r_buff0_thd3~0_27 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$flush_delayed~0_12) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t876~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t876~0.base_30|) |v_ULTIMATE.start_main_~#t876~0.offset_21| 0)) |v_#memory_int_21|) (= v_~__unbuffered_p2_EBX~0_17 0) (= 0 v_~weak$$choice0~0_6) (= 0 v_~z$w_buff0~0_26) (= v_~z~0_20 0) (= 0 v_~z$w_buff1~0_24) (= v_~b~0_12 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t876~0.base_30| 4)) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t876~0.base_30| 1)) (= v_~x~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t878~0.offset=|v_ULTIMATE.start_main_~#t878~0.offset_16|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t876~0.base=|v_ULTIMATE.start_main_~#t876~0.base_30|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start_main_~#t877~0.base=|v_ULTIMATE.start_main_~#t877~0.base_23|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_17, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|, ULTIMATE.start_main_~#t877~0.offset=|v_ULTIMATE.start_main_~#t877~0.offset_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_27, ULTIMATE.start_main_~#t876~0.offset=|v_ULTIMATE.start_main_~#t876~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_16, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t878~0.base=|v_ULTIMATE.start_main_~#t878~0.base_19|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_68, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t878~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t876~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t877~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t877~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t876~0.offset, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t878~0.base, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:56:32,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L830-1-->L832: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t877~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t877~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t877~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t877~0.base_11|) |v_ULTIMATE.start_main_~#t877~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t877~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t877~0.offset_10| 0) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t877~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t877~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t877~0.base=|v_ULTIMATE.start_main_~#t877~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t877~0.offset=|v_ULTIMATE.start_main_~#t877~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t877~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t877~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:56:32,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L832-1-->L834: Formula: (and (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t878~0.base_13| 1) |v_#valid_41|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t878~0.base_13| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t878~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t878~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t878~0.base_13|) |v_ULTIMATE.start_main_~#t878~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t878~0.base_13|) (= |v_ULTIMATE.start_main_~#t878~0.offset_11| 0) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t878~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t878~0.offset=|v_ULTIMATE.start_main_~#t878~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t878~0.base=|v_ULTIMATE.start_main_~#t878~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t878~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t878~0.base, #length] because there is no mapped edge [2019-12-27 20:56:32,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= 1 v_~a~0_4) (= v_~z$r_buff0_thd2~0_45 v_~z$r_buff1_thd2~0_26) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_5) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd3~0_22 v_~z$r_buff1_thd3~0_12) (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~__unbuffered_p2_EBX~0_5 v_~b~0_5) (= v_~__unbuffered_p2_EAX~0_5 v_~a~0_4) (= v_~z$r_buff0_thd3~0_21 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~b~0=v_~b~0_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_45} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_5, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_26, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~a~0=v_~a~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_45} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-27 20:56:32,560 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= 1 v_~x~0_7) (= 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_17} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, 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_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 20:56:32,566 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-256555333 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In-256555333| |P1Thread1of1ForFork1_#t~ite14_Out-256555333|) (not .cse0) (= ~z$w_buff0_used~0_In-256555333 |P1Thread1of1ForFork1_#t~ite15_Out-256555333|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-256555333 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-256555333 256)) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-256555333 256) 0)) (and (= (mod ~z$w_buff1_used~0_In-256555333 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out-256555333| |P1Thread1of1ForFork1_#t~ite15_Out-256555333|) (= |P1Thread1of1ForFork1_#t~ite14_Out-256555333| ~z$w_buff0_used~0_In-256555333) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-256555333, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-256555333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-256555333, ~weak$$choice2~0=~weak$$choice2~0_In-256555333, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-256555333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-256555333|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-256555333, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-256555333, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-256555333, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-256555333|, ~weak$$choice2~0=~weak$$choice2~0_In-256555333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-256555333|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-256555333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 20:56:32,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_59 v_~z$r_buff0_thd2~0_58)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_9|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:56:32,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 20:56:32,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1187616974 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1187616974 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out1187616974| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1187616974 |P2Thread1of1ForFork2_#t~ite28_Out1187616974|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1187616974, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1187616974} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1187616974, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1187616974, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1187616974|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 20:56:32,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In-1956517453 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1956517453 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1956517453 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1956517453 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite29_Out-1956517453| ~z$w_buff1_used~0_In-1956517453)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-1956517453| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1956517453, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1956517453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1956517453, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1956517453} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1956517453, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1956517453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1956517453, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1956517453, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1956517453|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 20:56:32,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In843918967 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In843918967 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd3~0_Out843918967 0)) (and (= ~z$r_buff0_thd3~0_Out843918967 ~z$r_buff0_thd3~0_In843918967) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In843918967, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In843918967} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out843918967|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In843918967, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out843918967} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 20:56:32,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In249214540 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In249214540 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In249214540 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In249214540 256)))) (or (and (= ~z$r_buff1_thd3~0_In249214540 |P2Thread1of1ForFork2_#t~ite31_Out249214540|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out249214540|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In249214540, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In249214540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In249214540, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In249214540} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out249214540|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In249214540, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In249214540, ~z$w_buff1_used~0=~z$w_buff1_used~0_In249214540, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In249214540} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 20:56:32,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd3~0_15)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, 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[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 20:56:32,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:56:32,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In697662924 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In697662924 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out697662924| ~z$w_buff1~0_In697662924) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite35_Out697662924| ~z~0_In697662924)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In697662924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In697662924, ~z$w_buff1~0=~z$w_buff1~0_In697662924, ~z~0=~z~0_In697662924} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In697662924, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out697662924|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In697662924, ~z$w_buff1~0=~z$w_buff1~0_In697662924, ~z~0=~z~0_In697662924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 20:56:32,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_14 |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|, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-27 20:56:32,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-852049982 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-852049982 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out-852049982|)) (and (= ~z$w_buff0_used~0_In-852049982 |ULTIMATE.start_main_#t~ite37_Out-852049982|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-852049982, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-852049982} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-852049982, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-852049982, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-852049982|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 20:56:32,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1358559056 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1358559056 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1358559056 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1358559056 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out1358559056| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1358559056 |ULTIMATE.start_main_#t~ite38_Out1358559056|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1358559056, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1358559056, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1358559056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1358559056} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1358559056, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1358559056, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1358559056, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1358559056, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1358559056|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 20:56:32,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In952959263 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In952959263 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out952959263|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In952959263 |ULTIMATE.start_main_#t~ite39_Out952959263|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In952959263, ~z$w_buff0_used~0=~z$w_buff0_used~0_In952959263} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In952959263, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out952959263|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In952959263} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 20:56:32,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In629811436 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In629811436 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In629811436 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In629811436 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out629811436| ~z$r_buff1_thd0~0_In629811436)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite40_Out629811436|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In629811436, ~z$w_buff0_used~0=~z$w_buff0_used~0_In629811436, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In629811436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In629811436} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In629811436, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out629811436|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In629811436, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In629811436, ~z$w_buff1_used~0=~z$w_buff1_used~0_In629811436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:56:32,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite40_14| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 1 v_~__unbuffered_p1_EAX~0_9) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 1 v_~__unbuffered_p2_EAX~0_11) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:56:32,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:56:32 BasicIcfg [2019-12-27 20:56:32,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:56:32,677 INFO L168 Benchmark]: Toolchain (without parser) took 16112.08 ms. Allocated memory was 144.2 MB in the beginning and 640.2 MB in the end (delta: 496.0 MB). Free memory was 100.9 MB in the beginning and 138.5 MB in the end (delta: -37.6 MB). Peak memory consumption was 458.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:32,678 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:56:32,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.49 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:32,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.30 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 153.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:32,680 INFO L168 Benchmark]: Boogie Preprocessor took 38.11 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:32,680 INFO L168 Benchmark]: RCFGBuilder took 778.16 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 106.8 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:32,681 INFO L168 Benchmark]: TraceAbstraction took 14454.96 ms. Allocated memory was 201.9 MB in the beginning and 640.2 MB in the end (delta: 438.3 MB). Free memory was 106.8 MB in the beginning and 138.5 MB in the end (delta: -31.7 MB). Peak memory consumption was 406.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:56:32,687 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.49 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.30 ms. Allocated memory is still 201.9 MB. Free memory was 155.6 MB in the beginning and 153.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.11 ms. Allocated memory is still 201.9 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 778.16 ms. Allocated memory is still 201.9 MB. Free memory was 150.8 MB in the beginning and 106.8 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14454.96 ms. Allocated memory was 201.9 MB in the beginning and 640.2 MB in the end (delta: 438.3 MB). Free memory was 106.8 MB in the beginning and 138.5 MB in the end (delta: -31.7 MB). Peak memory consumption was 406.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 155 ProgramPointsBefore, 73 ProgramPointsAfterwards, 180 TransitionsBefore, 83 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4740 VarBasedMoverChecksPositive, 133 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 43881 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1322 SDtfs, 1864 SDslu, 2677 SDs, 0 SdLazy, 2301 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13626occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 3231 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 28102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...