/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:33:29,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:33:29,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:33:29,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:33:29,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:33:29,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:33:29,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:33:29,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:33:29,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:33:29,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:33:29,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:33:29,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:33:29,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:33:29,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:33:29,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:33:29,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:33:29,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:33:29,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:33:29,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:33:29,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:33:29,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:33:29,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:33:29,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:33:29,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:33:29,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:33:29,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:33:29,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:33:29,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:33:29,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:33:29,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:33:29,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:33:29,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:33:29,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:33:29,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:33:29,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:33:29,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:33:29,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:33:29,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:33:29,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:33:29,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:33:29,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:33:29,401 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-SemanticLbe-MCR.epf [2019-12-27 17:33:29,423 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:33:29,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:33:29,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:33:29,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:33:29,427 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:33:29,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:33:29,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:33:29,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:33:29,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:33:29,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:33:29,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:33:29,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:33:29,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:33:29,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:33:29,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:33:29,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:33:29,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:33:29,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:33:29,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:33:29,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:33:29,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:33:29,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:33:29,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:33:29,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:33:29,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:33:29,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:33:29,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:33:29,434 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:33:29,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:33:29,434 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:33:29,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:33:29,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:33:29,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:33:29,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:33:29,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:33:29,751 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:33:29,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2019-12-27 17:33:29,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9223289ae/808b26a2aa3e42d3bd5ad3640b7ca703/FLAG5810181dc [2019-12-27 17:33:30,379 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:33:30,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2019-12-27 17:33:30,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9223289ae/808b26a2aa3e42d3bd5ad3640b7ca703/FLAG5810181dc [2019-12-27 17:33:30,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9223289ae/808b26a2aa3e42d3bd5ad3640b7ca703 [2019-12-27 17:33:30,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:33:30,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:33:30,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:33:30,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:33:30,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:33:30,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:33:30" (1/1) ... [2019-12-27 17:33:30,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c834d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:30, skipping insertion in model container [2019-12-27 17:33:30,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:33:30" (1/1) ... [2019-12-27 17:33:30,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:33:30,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:33:31,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:33:31,341 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:33:31,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:33:31,486 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:33:31,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31 WrapperNode [2019-12-27 17:33:31,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:33:31,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:33:31,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:33:31,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:33:31,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:33:31,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:33:31,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:33:31,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:33:31,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (1/1) ... [2019-12-27 17:33:31,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:33:31,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:33:31,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:33:31,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:33:31,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (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 17:33:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:33:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:33:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:33:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:33:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:33:31,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:33:31,678 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:33:31,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:33:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:33:31,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:33:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:33:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:33:31,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:33:31,682 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 17:33:32,472 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:33:32,472 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:33:32,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:33:32 BoogieIcfgContainer [2019-12-27 17:33:32,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:33:32,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:33:32,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:33:32,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:33:32,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:33:30" (1/3) ... [2019-12-27 17:33:32,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b4b32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:33:32, skipping insertion in model container [2019-12-27 17:33:32,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:33:31" (2/3) ... [2019-12-27 17:33:32,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b4b32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:33:32, skipping insertion in model container [2019-12-27 17:33:32,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:33:32" (3/3) ... [2019-12-27 17:33:32,483 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt.i [2019-12-27 17:33:32,493 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:33:32,494 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:33:32,502 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:33:32,503 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:33:32,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,541 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,542 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,550 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,550 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,551 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,552 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,563 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,565 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,572 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,588 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:33:32,607 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:33:32,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:33:32,629 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:33:32,629 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:33:32,629 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:33:32,629 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:33:32,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:33:32,630 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:33:32,630 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:33:32,647 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 17:33:32,649 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 17:33:32,737 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 17:33:32,737 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:33:32,752 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:33:32,771 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 17:33:32,817 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 17:33:32,817 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:33:32,824 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 17:33:32,841 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 17:33:32,842 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:33:37,471 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:33:37,577 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 17:33:37,595 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-27 17:33:37,595 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 17:33:37,599 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 17:33:38,688 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-27 17:33:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-27 17:33:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 17:33:38,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:38,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:38,698 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 17:33:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-27 17:33:38,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:38,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791850989] [2019-12-27 17:33:38,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:39,003 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 17:33:39,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791850989] [2019-12-27 17:33:39,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:39,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:33:39,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376529080] [2019-12-27 17:33:39,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:39,015 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:39,031 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 17:33:39,031 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:39,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:39,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:39,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:39,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:39,052 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-27 17:33:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:39,448 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-27 17:33:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:39,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 17:33:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:39,635 INFO L225 Difference]: With dead ends: 16398 [2019-12-27 17:33:39,635 INFO L226 Difference]: Without dead ends: 16062 [2019-12-27 17:33:39,637 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 17:33:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-27 17:33:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-27 17:33:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-27 17:33:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-27 17:33:40,957 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-27 17:33:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:40,958 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-27 17:33:40,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-27 17:33:40,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:33:40,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:40,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:40,964 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 17:33:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-27 17:33:40,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:40,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974256366] [2019-12-27 17:33:40,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:41,095 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 17:33:41,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974256366] [2019-12-27 17:33:41,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:41,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:41,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2126441959] [2019-12-27 17:33:41,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:41,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:41,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 17:33:41,110 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:41,160 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:33:41,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:41,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:41,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:41,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:41,162 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 5 states. [2019-12-27 17:33:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:42,085 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-27 17:33:42,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:33:42,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 17:33:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:42,189 INFO L225 Difference]: With dead ends: 24942 [2019-12-27 17:33:42,189 INFO L226 Difference]: Without dead ends: 24928 [2019-12-27 17:33:42,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-27 17:33:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-27 17:33:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-27 17:33:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-27 17:33:43,126 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-27 17:33:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:43,127 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-27 17:33:43,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-27 17:33:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:33:43,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:43,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:43,130 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 17:33:43,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-27 17:33:43,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:43,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026697005] [2019-12-27 17:33:43,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:43,196 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 17:33:43,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026697005] [2019-12-27 17:33:43,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:43,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:43,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [828247546] [2019-12-27 17:33:43,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:43,200 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:43,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:33:43,202 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:43,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:43,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:43,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:43,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:43,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:43,207 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-27 17:33:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:43,278 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-27 17:33:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:43,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:33:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:43,317 INFO L225 Difference]: With dead ends: 12675 [2019-12-27 17:33:43,317 INFO L226 Difference]: Without dead ends: 12675 [2019-12-27 17:33:43,317 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 17:33:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-27 17:33:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-27 17:33:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-27 17:33:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-27 17:33:44,527 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-27 17:33:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:44,528 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-27 17:33:44,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-27 17:33:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:33:44,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:44,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:44,530 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 17:33:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-27 17:33:44,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:44,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909439017] [2019-12-27 17:33:44,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:33:44,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909439017] [2019-12-27 17:33:44,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:44,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:44,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [635916928] [2019-12-27 17:33:44,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:44,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:44,592 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 17:33:44,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:44,593 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:44,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:33:44,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:44,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:33:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:33:44,594 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-27 17:33:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:44,618 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-27 17:33:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:33:44,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:33:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:44,625 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 17:33:44,626 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 17:33:44,626 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 17:33:44,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 17:33:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-27 17:33:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-27 17:33:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-27 17:33:44,660 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-27 17:33:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:44,660 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-27 17:33:44,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:33:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-27 17:33:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:33:44,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:44,663 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] [2019-12-27 17:33:44,663 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 17:33:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:44,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-27 17:33:44,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:44,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27514751] [2019-12-27 17:33:44,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:44,753 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 17:33:44,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27514751] [2019-12-27 17:33:44,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:44,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:33:44,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413227258] [2019-12-27 17:33:44,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:44,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:44,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 17:33:44,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:44,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:33:44,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:33:44,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:44,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:33:44,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:44,794 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 6 states. [2019-12-27 17:33:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:44,825 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 17:33:44,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:33:44,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 17:33:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:44,827 INFO L225 Difference]: With dead ends: 653 [2019-12-27 17:33:44,827 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 17:33:44,827 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 17:33:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 17:33:44,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 17:33:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 17:33:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 17:33:44,838 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 17:33:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:44,838 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 17:33:44,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:33:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 17:33:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:33:44,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:44,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:44,841 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 17:33:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-27 17:33:44,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:44,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490813236] [2019-12-27 17:33:44,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:44,943 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 17:33:44,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490813236] [2019-12-27 17:33:44,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:44,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:33:44,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1437973958] [2019-12-27 17:33:44,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:44,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:45,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 128 transitions. [2019-12-27 17:33:45,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:45,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:45,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:45,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:45,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:45,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:45,013 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 17:33:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:45,060 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-27 17:33:45,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:45,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 17:33:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:45,062 INFO L225 Difference]: With dead ends: 607 [2019-12-27 17:33:45,062 INFO L226 Difference]: Without dead ends: 607 [2019-12-27 17:33:45,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-27 17:33:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-27 17:33:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-27 17:33:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-27 17:33:45,073 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-27 17:33:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:45,073 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-27 17:33:45,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-27 17:33:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:33:45,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:45,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:45,076 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 17:33:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-27 17:33:45,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:45,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745494400] [2019-12-27 17:33:45,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:45,190 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 17:33:45,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745494400] [2019-12-27 17:33:45,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:45,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:33:45,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [178593530] [2019-12-27 17:33:45,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:45,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:45,353 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 128 transitions. [2019-12-27 17:33:45,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:45,356 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:33:45,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:45,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:45,357 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 5 states. [2019-12-27 17:33:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:45,575 INFO L93 Difference]: Finished difference Result 892 states and 2082 transitions. [2019-12-27 17:33:45,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:33:45,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 17:33:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:45,577 INFO L225 Difference]: With dead ends: 892 [2019-12-27 17:33:45,578 INFO L226 Difference]: Without dead ends: 892 [2019-12-27 17:33:45,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-27 17:33:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2019-12-27 17:33:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-27 17:33:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1691 transitions. [2019-12-27 17:33:45,595 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1691 transitions. Word has length 55 [2019-12-27 17:33:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:45,595 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1691 transitions. [2019-12-27 17:33:45,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1691 transitions. [2019-12-27 17:33:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:33:45,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:45,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:45,598 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 17:33:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 297273929, now seen corresponding path program 2 times [2019-12-27 17:33:45,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:45,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28474933] [2019-12-27 17:33:45,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:45,729 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 17:33:45,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28474933] [2019-12-27 17:33:45,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:45,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:33:45,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1675867188] [2019-12-27 17:33:45,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:45,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:45,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 126 transitions. [2019-12-27 17:33:45,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:45,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:33:45,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:33:45,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:45,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:33:45,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:33:45,894 INFO L87 Difference]: Start difference. First operand 717 states and 1691 transitions. Second operand 10 states. [2019-12-27 17:33:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:47,003 INFO L93 Difference]: Finished difference Result 1612 states and 3598 transitions. [2019-12-27 17:33:47,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:33:47,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 17:33:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:47,008 INFO L225 Difference]: With dead ends: 1612 [2019-12-27 17:33:47,008 INFO L226 Difference]: Without dead ends: 1612 [2019-12-27 17:33:47,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:33:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2019-12-27 17:33:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 759. [2019-12-27 17:33:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 17:33:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1794 transitions. [2019-12-27 17:33:47,027 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1794 transitions. Word has length 55 [2019-12-27 17:33:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:47,028 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1794 transitions. [2019-12-27 17:33:47,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:33:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1794 transitions. [2019-12-27 17:33:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 17:33:47,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:47,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:47,031 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 17:33:47,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1649215159, now seen corresponding path program 3 times [2019-12-27 17:33:47,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:47,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505556309] [2019-12-27 17:33:47,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:47,116 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 17:33:47,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505556309] [2019-12-27 17:33:47,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:47,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:47,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [875203172] [2019-12-27 17:33:47,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:47,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:47,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 119 transitions. [2019-12-27 17:33:47,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:47,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:33:47,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:47,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:47,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:47,232 INFO L87 Difference]: Start difference. First operand 759 states and 1794 transitions. Second operand 5 states. [2019-12-27 17:33:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:47,421 INFO L93 Difference]: Finished difference Result 834 states and 1898 transitions. [2019-12-27 17:33:47,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:33:47,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 17:33:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:47,425 INFO L225 Difference]: With dead ends: 834 [2019-12-27 17:33:47,426 INFO L226 Difference]: Without dead ends: 834 [2019-12-27 17:33:47,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:33:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-12-27 17:33:47,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 663. [2019-12-27 17:33:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-27 17:33:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1530 transitions. [2019-12-27 17:33:47,440 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1530 transitions. Word has length 55 [2019-12-27 17:33:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:47,440 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 1530 transitions. [2019-12-27 17:33:47,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1530 transitions. [2019-12-27 17:33:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 17:33:47,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:47,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:47,443 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 17:33:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 1 times [2019-12-27 17:33:47,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:47,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509559347] [2019-12-27 17:33:47,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:47,592 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 17:33:47,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509559347] [2019-12-27 17:33:47,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:47,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:47,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [699253964] [2019-12-27 17:33:47,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:47,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:47,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 113 transitions. [2019-12-27 17:33:47,653 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:47,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:47,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:47,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:47,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:47,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:47,654 INFO L87 Difference]: Start difference. First operand 663 states and 1530 transitions. Second operand 3 states. [2019-12-27 17:33:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:47,689 INFO L93 Difference]: Finished difference Result 662 states and 1528 transitions. [2019-12-27 17:33:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:47,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 17:33:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:47,692 INFO L225 Difference]: With dead ends: 662 [2019-12-27 17:33:47,692 INFO L226 Difference]: Without dead ends: 662 [2019-12-27 17:33:47,693 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 17:33:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-27 17:33:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 473. [2019-12-27 17:33:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-27 17:33:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1090 transitions. [2019-12-27 17:33:47,702 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1090 transitions. Word has length 56 [2019-12-27 17:33:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:47,703 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1090 transitions. [2019-12-27 17:33:47,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1090 transitions. [2019-12-27 17:33:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:33:47,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:47,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:47,705 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 17:33:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-27 17:33:47,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:47,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961898376] [2019-12-27 17:33:47,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:47,945 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 17:33:47,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961898376] [2019-12-27 17:33:47,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:47,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:33:47,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090869024] [2019-12-27 17:33:47,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:47,962 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:48,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 116 transitions. [2019-12-27 17:33:48,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:48,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:33:48,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:33:48,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:48,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:33:48,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:33:48,005 INFO L87 Difference]: Start difference. First operand 473 states and 1090 transitions. Second operand 12 states. [2019-12-27 17:33:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:48,743 INFO L93 Difference]: Finished difference Result 1088 states and 2214 transitions. [2019-12-27 17:33:48,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 17:33:48,745 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 17:33:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:48,748 INFO L225 Difference]: With dead ends: 1088 [2019-12-27 17:33:48,748 INFO L226 Difference]: Without dead ends: 578 [2019-12-27 17:33:48,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-27 17:33:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-12-27 17:33:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2019-12-27 17:33:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-27 17:33:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-27 17:33:48,757 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 57 [2019-12-27 17:33:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:48,757 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-27 17:33:48,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:33:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-27 17:33:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:33:48,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:48,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:48,759 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 17:33:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:48,760 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-27 17:33:48,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:48,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503648741] [2019-12-27 17:33:48,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:48,879 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 17:33:48,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503648741] [2019-12-27 17:33:48,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:48,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:33:48,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1402042296] [2019-12-27 17:33:48,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:48,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:49,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 170 transitions. [2019-12-27 17:33:49,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:49,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:49,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:33:49,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:49,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:33:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:49,021 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 6 states. [2019-12-27 17:33:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:49,085 INFO L93 Difference]: Finished difference Result 644 states and 1366 transitions. [2019-12-27 17:33:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:33:49,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 17:33:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:49,086 INFO L225 Difference]: With dead ends: 644 [2019-12-27 17:33:49,086 INFO L226 Difference]: Without dead ends: 231 [2019-12-27 17:33:49,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:33:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-27 17:33:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2019-12-27 17:33:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-27 17:33:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-27 17:33:49,091 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-27 17:33:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:49,092 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-27 17:33:49,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:33:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-27 17:33:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:33:49,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:49,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:49,093 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-27 17:33:49,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:49,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859517210] [2019-12-27 17:33:49,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:49,305 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 17:33:49,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859517210] [2019-12-27 17:33:49,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:49,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:33:49,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1692867066] [2019-12-27 17:33:49,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:49,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:49,416 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 163 transitions. [2019-12-27 17:33:49,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:49,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:33:49,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:33:49,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:49,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:33:49,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:33:49,491 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 15 states. [2019-12-27 17:33:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:51,184 INFO L93 Difference]: Finished difference Result 535 states and 905 transitions. [2019-12-27 17:33:51,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 17:33:51,184 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 17:33:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:51,186 INFO L225 Difference]: With dead ends: 535 [2019-12-27 17:33:51,186 INFO L226 Difference]: Without dead ends: 505 [2019-12-27 17:33:51,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 17:33:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-12-27 17:33:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 307. [2019-12-27 17:33:51,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-27 17:33:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-27 17:33:51,195 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-27 17:33:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:51,195 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-27 17:33:51,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:33:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-27 17:33:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:33:51,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:51,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:51,197 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:51,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 4 times [2019-12-27 17:33:51,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:51,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396407323] [2019-12-27 17:33:51,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:51,787 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 17:33:51,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396407323] [2019-12-27 17:33:51,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:51,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 17:33:51,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [781682002] [2019-12-27 17:33:51,788 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:51,798 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:51,844 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 115 states and 151 transitions. [2019-12-27 17:33:51,844 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:51,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:33:52,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 17:33:52,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 17:33:52,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 17:33:52,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:33:52,003 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 19 states. [2019-12-27 17:33:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:53,407 INFO L93 Difference]: Finished difference Result 590 states and 1013 transitions. [2019-12-27 17:33:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 17:33:53,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2019-12-27 17:33:53,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:53,409 INFO L225 Difference]: With dead ends: 590 [2019-12-27 17:33:53,409 INFO L226 Difference]: Without dead ends: 560 [2019-12-27 17:33:53,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 17:33:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-12-27 17:33:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 329. [2019-12-27 17:33:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 17:33:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 577 transitions. [2019-12-27 17:33:53,418 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 577 transitions. Word has length 57 [2019-12-27 17:33:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:53,418 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 577 transitions. [2019-12-27 17:33:53,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 17:33:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 577 transitions. [2019-12-27 17:33:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:33:53,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:53,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:53,420 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1124170117, now seen corresponding path program 5 times [2019-12-27 17:33:53,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:53,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495656324] [2019-12-27 17:33:53,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:53,763 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 17:33:53,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495656324] [2019-12-27 17:33:53,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:53,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:33:53,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548736483] [2019-12-27 17:33:53,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:53,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:53,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 184 transitions. [2019-12-27 17:33:53,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:53,949 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:33:53,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:33:53,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:53,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:33:53,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:33:53,951 INFO L87 Difference]: Start difference. First operand 329 states and 577 transitions. Second operand 13 states. [2019-12-27 17:33:54,229 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-27 17:33:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:54,532 INFO L93 Difference]: Finished difference Result 429 states and 730 transitions. [2019-12-27 17:33:54,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:33:54,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 17:33:54,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:54,533 INFO L225 Difference]: With dead ends: 429 [2019-12-27 17:33:54,533 INFO L226 Difference]: Without dead ends: 399 [2019-12-27 17:33:54,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:33:54,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-12-27 17:33:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 315. [2019-12-27 17:33:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-27 17:33:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-27 17:33:54,542 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-27 17:33:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:54,542 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-27 17:33:54,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:33:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-27 17:33:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 17:33:54,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:54,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:33:54,544 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 6 times [2019-12-27 17:33:54,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:54,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436102030] [2019-12-27 17:33:54,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:33:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:33:54,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:33:54,693 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:33:54,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= v_~y$w_buff1~0_200 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1510~0.base_26|)) (= v_~y$w_buff0_used~0_650 0) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1510~0.base_26| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1510~0.base_26| 4) |v_#length_23|) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= v_~y$r_buff0_thd2~0_88 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1510~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1510~0.base_26|) |v_ULTIMATE.start_main_~#t1510~0.offset_19| 0)) |v_#memory_int_23|) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= |v_ULTIMATE.start_main_~#t1510~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1510~0.base_26|) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1511~0.offset=|v_ULTIMATE.start_main_~#t1511~0.offset_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ULTIMATE.start_main_~#t1510~0.base=|v_ULTIMATE.start_main_~#t1510~0.base_26|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_~#t1512~0.base=|v_ULTIMATE.start_main_~#t1512~0.base_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ULTIMATE.start_main_~#t1510~0.offset=|v_ULTIMATE.start_main_~#t1510~0.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_~#t1512~0.offset=|v_ULTIMATE.start_main_~#t1512~0.offset_14|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ULTIMATE.start_main_~#t1511~0.base=|v_ULTIMATE.start_main_~#t1511~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1511~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1510~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1512~0.base, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1510~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1512~0.offset, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1511~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:33:54,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1511~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1511~0.offset_11| 0) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1511~0.base_13|) 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1511~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1511~0.base_13|) |v_ULTIMATE.start_main_~#t1511~0.offset_11| 1))) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1511~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1511~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1511~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1511~0.offset=|v_ULTIMATE.start_main_~#t1511~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1511~0.base=|v_ULTIMATE.start_main_~#t1511~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1511~0.offset, #length, ULTIMATE.start_main_~#t1511~0.base] because there is no mapped edge [2019-12-27 17:33:54,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1512~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1512~0.base_12|) |v_ULTIMATE.start_main_~#t1512~0.offset_10| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1512~0.base_12|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1512~0.base_12|) 0) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1512~0.base_12| 1) |v_#valid_38|) (not (= |v_ULTIMATE.start_main_~#t1512~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1512~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1512~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1512~0.base=|v_ULTIMATE.start_main_~#t1512~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1512~0.offset=|v_ULTIMATE.start_main_~#t1512~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1512~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1512~0.offset, #length] because there is no mapped edge [2019-12-27 17:33:54,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:33:54,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 17:33:54,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1194287836 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1194287836 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1194287836 |P2Thread1of1ForFork0_#t~ite11_Out1194287836|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out1194287836|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1194287836, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1194287836} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1194287836, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1194287836|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1194287836} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 17:33:54,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-921550225 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-921550225 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-921550225| ~y~0_In-921550225) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out-921550225| ~y$w_buff1~0_In-921550225) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-921550225, ~y$w_buff1~0=~y$w_buff1~0_In-921550225, ~y~0=~y~0_In-921550225, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-921550225} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-921550225, ~y$w_buff1~0=~y$w_buff1~0_In-921550225, ~y~0=~y~0_In-921550225, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-921550225|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-921550225} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:33:54,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:33:54,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1882004727 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1882004727 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out1882004727|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1882004727 |P1Thread1of1ForFork2_#t~ite5_Out1882004727|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1882004727, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1882004727} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1882004727, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1882004727, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1882004727|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 17:33:54,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In627471216 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In627471216 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In627471216 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In627471216 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out627471216|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite6_Out627471216| ~y$w_buff1_used~0_In627471216)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In627471216, ~y$w_buff0_used~0=~y$w_buff0_used~0_In627471216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In627471216, ~y$w_buff1_used~0=~y$w_buff1_used~0_In627471216} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In627471216, ~y$w_buff0_used~0=~y$w_buff0_used~0_In627471216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In627471216, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out627471216|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In627471216} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 17:33:54,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In769901210 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In769901210 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out769901210| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out769901210| ~y$r_buff0_thd2~0_In769901210)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In769901210, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In769901210} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In769901210, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In769901210, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out769901210|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 17:33:54,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-2067011017 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2067011017 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-2067011017 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2067011017 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-2067011017|)) (and (= ~y$w_buff1_used~0_In-2067011017 |P2Thread1of1ForFork0_#t~ite12_Out-2067011017|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2067011017, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067011017, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2067011017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067011017} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2067011017, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2067011017, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-2067011017|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2067011017, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067011017} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 17:33:54,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In161174424 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In161174424 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In161174424 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In161174424 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out161174424| ~y$r_buff1_thd2~0_In161174424) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite8_Out161174424| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In161174424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In161174424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In161174424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161174424} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In161174424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In161174424, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out161174424|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In161174424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161174424} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:33:54,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 17:33:54,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-407115209 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-407115209 256)))) (or (and (= ~y$r_buff0_thd3~0_Out-407115209 ~y$r_buff0_thd3~0_In-407115209) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-407115209 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-407115209, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-407115209} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-407115209, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-407115209, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-407115209|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 17:33:54,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-511636979 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-511636979 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-511636979 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-511636979 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out-511636979| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out-511636979| ~y$r_buff1_thd3~0_In-511636979) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-511636979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-511636979, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-511636979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-511636979} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-511636979|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-511636979, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-511636979, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-511636979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-511636979} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 17:33:54,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 17:33:54,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:33:54,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1371551923 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1371551923 256)))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out1371551923| ~y$w_buff1~0_In1371551923) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite18_Out1371551923| ~y~0_In1371551923) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1371551923, ~y~0=~y~0_In1371551923, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1371551923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1371551923} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1371551923, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1371551923|, ~y~0=~y~0_In1371551923, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1371551923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1371551923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 17:33:54,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 17:33:54,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1031737523 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1031737523 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-1031737523| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-1031737523| ~y$w_buff0_used~0_In-1031737523)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1031737523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1031737523} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1031737523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1031737523, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1031737523|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:33:54,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1373352400 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1373352400 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1373352400 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1373352400 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1373352400 |ULTIMATE.start_main_#t~ite21_Out1373352400|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out1373352400|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1373352400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1373352400, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1373352400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1373352400} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1373352400, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1373352400, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1373352400|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1373352400, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1373352400} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:33:54,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1244207321 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1244207321 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1244207321| ~y$r_buff0_thd0~0_In1244207321) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1244207321|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1244207321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1244207321} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1244207321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1244207321, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1244207321|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:33:54,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1094081979 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1094081979 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1094081979 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1094081979 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1094081979|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-1094081979 |ULTIMATE.start_main_#t~ite23_Out-1094081979|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1094081979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1094081979, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1094081979, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1094081979} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1094081979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1094081979, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1094081979, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1094081979|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1094081979} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:33:54,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-723407219 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-723407219| |ULTIMATE.start_main_#t~ite30_Out-723407219|) .cse0 (= |ULTIMATE.start_main_#t~ite29_Out-723407219| ~y$w_buff0~0_In-723407219) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-723407219 256)))) (or (= (mod ~y$w_buff0_used~0_In-723407219 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-723407219 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-723407219 256)))))) (and (= |ULTIMATE.start_main_#t~ite30_Out-723407219| ~y$w_buff0~0_In-723407219) (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In-723407219| |ULTIMATE.start_main_#t~ite29_Out-723407219|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-723407219, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-723407219|, ~y$w_buff0~0=~y$w_buff0~0_In-723407219, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-723407219, ~weak$$choice2~0=~weak$$choice2~0_In-723407219, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-723407219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-723407219} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-723407219|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-723407219, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-723407219|, ~y$w_buff0~0=~y$w_buff0~0_In-723407219, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-723407219, ~weak$$choice2~0=~weak$$choice2~0_In-723407219, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-723407219, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-723407219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 17:33:54,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:33:54,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:33:54,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:33:54,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:33:54 BasicIcfg [2019-12-27 17:33:54,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:33:54,869 INFO L168 Benchmark]: Toolchain (without parser) took 24226.99 ms. Allocated memory was 139.5 MB in the beginning and 1.0 GB in the end (delta: 861.9 MB). Free memory was 102.4 MB in the beginning and 725.2 MB in the end (delta: -622.8 MB). Peak memory consumption was 239.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:33:54,870 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:33:54,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.74 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 157.5 MB in the end (delta: -55.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:33:54,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.16 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:33:54,878 INFO L168 Benchmark]: Boogie Preprocessor took 39.38 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:33:54,879 INFO L168 Benchmark]: RCFGBuilder took 879.86 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 105.5 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:33:54,880 INFO L168 Benchmark]: TraceAbstraction took 22389.47 ms. Allocated memory was 203.4 MB in the beginning and 1.0 GB in the end (delta: 798.0 MB). Free memory was 104.9 MB in the beginning and 725.2 MB in the end (delta: -620.3 MB). Peak memory consumption was 177.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:33:54,889 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.74 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 157.5 MB in the end (delta: -55.5 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.16 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.38 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 151.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 879.86 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 105.5 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22389.47 ms. Allocated memory was 203.4 MB in the beginning and 1.0 GB in the end (delta: 798.0 MB). Free memory was 104.9 MB in the beginning and 725.2 MB in the end (delta: -620.3 MB). Peak memory consumption was 177.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1510, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1511, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1512, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1527 SDtfs, 2301 SDslu, 4714 SDs, 0 SdLazy, 3509 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 51 SyntacticMatches, 28 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 4914 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 691 NumberOfCodeBlocks, 691 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 619 ConstructedInterpolants, 0 QuantifiedInterpolants, 148939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...