/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:19:59,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:19:59,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:19:59,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:19:59,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:19:59,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:19:59,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:19:59,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:19:59,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:19:59,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:19:59,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:19:59,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:19:59,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:19:59,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:19:59,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:19:59,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:19:59,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:19:59,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:19:59,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:19:59,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:19:59,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:19:59,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:19:59,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:19:59,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:19:59,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:19:59,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:19:59,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:19:59,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:19:59,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:19:59,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:19:59,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:19:59,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:19:59,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:19:59,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:19:59,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:19:59,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:19:59,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:19:59,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:19:59,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:19:59,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:19:59,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:19:59,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:19:59,455 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:19:59,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:19:59,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:19:59,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:19:59,457 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:19:59,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:19:59,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:19:59,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:19:59,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:19:59,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:19:59,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:19:59,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:19:59,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:19:59,459 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:19:59,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:19:59,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:19:59,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:19:59,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:19:59,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:19:59,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:19:59,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:19:59,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:19:59,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:19:59,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:19:59,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:19:59,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:19:59,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:19:59,462 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:19:59,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:19:59,462 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:19:59,462 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:19:59,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:19:59,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:19:59,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:19:59,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:19:59,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:19:59,751 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:19:59,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-27 21:19:59,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9566dc9/a12fd90d108c406f89dd850e9d334461/FLAG3d6325d28 [2019-12-27 21:20:00,454 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:20:00,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-27 21:20:00,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9566dc9/a12fd90d108c406f89dd850e9d334461/FLAG3d6325d28 [2019-12-27 21:20:00,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9566dc9/a12fd90d108c406f89dd850e9d334461 [2019-12-27 21:20:00,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:20:00,718 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:20:00,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:20:00,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:20:00,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:20:00,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:20:00" (1/1) ... [2019-12-27 21:20:00,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c02b278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:00, skipping insertion in model container [2019-12-27 21:20:00,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:20:00" (1/1) ... [2019-12-27 21:20:00,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:20:00,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:20:01,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:20:01,361 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:20:01,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:20:01,525 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:20:01,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01 WrapperNode [2019-12-27 21:20:01,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:20:01,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:20:01,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:20:01,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:20:01,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:20:01,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:20:01,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:20:01,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:20:01,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (1/1) ... [2019-12-27 21:20:01,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:20:01,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:20:01,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:20:01,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:20:01,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (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 21:20:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:20:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:20:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:20:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:20:01,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:20:01,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:20:01,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:20:01,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:20:01,701 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:20:01,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:20:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:20:01,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:20:01,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:20:01,704 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 21:20:02,440 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:20:02,441 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:20:02,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:20:02 BoogieIcfgContainer [2019-12-27 21:20:02,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:20:02,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:20:02,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:20:02,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:20:02,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:20:00" (1/3) ... [2019-12-27 21:20:02,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782f80db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:20:02, skipping insertion in model container [2019-12-27 21:20:02,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:01" (2/3) ... [2019-12-27 21:20:02,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782f80db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:20:02, skipping insertion in model container [2019-12-27 21:20:02,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:20:02" (3/3) ... [2019-12-27 21:20:02,451 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2019-12-27 21:20:02,462 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:20:02,463 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:20:02,471 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:20:02,472 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:20:02,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,510 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,513 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,522 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,522 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,534 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,536 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,536 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:02,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:20:02,596 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:20:02,596 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:20:02,597 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:20:02,597 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:20:02,597 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:20:02,597 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:20:02,597 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:20:02,597 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:20:02,615 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 21:20:02,618 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 21:20:02,728 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 21:20:02,728 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:20:02,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:20:02,760 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 21:20:02,841 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 21:20:02,841 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:20:02,846 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:20:02,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 21:20:02,865 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:20:06,398 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 21:20:06,534 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:20:06,553 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-27 21:20:06,553 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 21:20:06,556 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 21:20:07,701 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-27 21:20:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-27 21:20:07,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:20:07,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:07,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:07,712 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 21:20:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-27 21:20:07,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:07,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545882548] [2019-12-27 21:20:07,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:07,957 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 21:20:07,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545882548] [2019-12-27 21:20:07,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:07,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:20:07,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [370453168] [2019-12-27 21:20:07,960 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:07,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:07,980 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:20:07,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:07,985 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:07,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:07,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:08,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:08,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:08,003 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-27 21:20:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:08,415 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-27 21:20:08,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:08,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:20:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:08,629 INFO L225 Difference]: With dead ends: 17518 [2019-12-27 21:20:08,630 INFO L226 Difference]: Without dead ends: 17154 [2019-12-27 21:20:08,631 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 21:20:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-27 21:20:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-27 21:20:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-27 21:20:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-27 21:20:10,239 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-27 21:20:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:10,242 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-27 21:20:10,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-27 21:20:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:20:10,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:10,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:10,251 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 21:20:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-27 21:20:10,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:10,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172245937] [2019-12-27 21:20:10,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:10,414 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 21:20:10,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172245937] [2019-12-27 21:20:10,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:10,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:20:10,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [18605759] [2019-12-27 21:20:10,415 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:10,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:10,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 21:20:10,423 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:10,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:20:10,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:20:10,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:10,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:20:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:20:10,470 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 5 states. [2019-12-27 21:20:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:11,130 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-27 21:20:11,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:20:11,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 21:20:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:11,241 INFO L225 Difference]: With dead ends: 26570 [2019-12-27 21:20:11,241 INFO L226 Difference]: Without dead ends: 26556 [2019-12-27 21:20:11,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-27 21:20:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-27 21:20:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-27 21:20:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-27 21:20:13,617 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-27 21:20:13,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:13,617 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-27 21:20:13,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:20:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-27 21:20:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:20:13,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:13,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:13,624 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 21:20:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-27 21:20:13,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:13,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7090206] [2019-12-27 21:20:13,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:13,685 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 21:20:13,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7090206] [2019-12-27 21:20:13,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:13,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:20:13,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1433267089] [2019-12-27 21:20:13,687 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:13,690 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:13,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:20:13,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:13,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:13,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:13,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:13,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:13,694 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-27 21:20:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:13,771 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-27 21:20:13,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:13,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:20:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:13,837 INFO L225 Difference]: With dead ends: 13809 [2019-12-27 21:20:13,838 INFO L226 Difference]: Without dead ends: 13809 [2019-12-27 21:20:13,838 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 21:20:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-27 21:20:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-27 21:20:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 21:20:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-27 21:20:14,195 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-27 21:20:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:14,196 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-27 21:20:14,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-27 21:20:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:20:14,197 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:14,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:14,198 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 21:20:14,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:14,198 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-27 21:20:14,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:14,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90133662] [2019-12-27 21:20:14,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:14,255 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 21:20:14,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90133662] [2019-12-27 21:20:14,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:14,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:20:14,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [902058382] [2019-12-27 21:20:14,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:14,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:14,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 21:20:14,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:14,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:20:14,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:20:14,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:14,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:20:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:14,314 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 6 states. [2019-12-27 21:20:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:14,363 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-27 21:20:14,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:20:14,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-27 21:20:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:14,372 INFO L225 Difference]: With dead ends: 2006 [2019-12-27 21:20:14,372 INFO L226 Difference]: Without dead ends: 2006 [2019-12-27 21:20:14,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 21:20:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-27 21:20:14,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-27 21:20:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-27 21:20:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-27 21:20:14,413 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-27 21:20:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:14,414 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-27 21:20:14,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:20:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-27 21:20:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:20:14,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:14,416 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 21:20:14,416 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 21:20:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-27 21:20:14,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:14,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965182522] [2019-12-27 21:20:14,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:14,613 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 21:20:14,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965182522] [2019-12-27 21:20:14,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:14,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:20:14,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568673572] [2019-12-27 21:20:14,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:14,619 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:14,637 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 21:20:14,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:14,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:20:14,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:20:14,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:14,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:20:14,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:20:14,732 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 8 states. [2019-12-27 21:20:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:14,777 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 21:20:14,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:20:14,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-27 21:20:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:14,779 INFO L225 Difference]: With dead ends: 653 [2019-12-27 21:20:14,779 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 21:20:14,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:20:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 21:20:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 21:20:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 21:20:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 21:20:14,790 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 21:20:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:14,791 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 21:20:14,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:20:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 21:20:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:14,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:14,793 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 21:20:14,794 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 21:20:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-27 21:20:14,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:14,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781974344] [2019-12-27 21:20:14,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:14,884 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 21:20:14,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781974344] [2019-12-27 21:20:14,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:14,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:20:14,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281244208] [2019-12-27 21:20:14,886 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:14,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:14,967 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 123 transitions. [2019-12-27 21:20:14,967 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:14,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:14,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:14,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:14,969 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 21:20:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:15,017 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-27 21:20:15,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:15,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:20:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:15,019 INFO L225 Difference]: With dead ends: 609 [2019-12-27 21:20:15,019 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 21:20:15,020 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 21:20:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 21:20:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 21:20:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 21:20:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-27 21:20:15,030 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-27 21:20:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:15,031 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-27 21:20:15,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-27 21:20:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:15,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:15,033 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 21:20:15,033 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 21:20:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-27 21:20:15,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:15,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573736889] [2019-12-27 21:20:15,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:15,113 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 21:20:15,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573736889] [2019-12-27 21:20:15,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:15,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:20:15,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [11965727] [2019-12-27 21:20:15,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:15,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:15,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 123 transitions. [2019-12-27 21:20:15,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:15,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:15,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:15,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:15,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:15,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:15,190 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-27 21:20:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:15,243 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-27 21:20:15,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:15,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:20:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:15,245 INFO L225 Difference]: With dead ends: 609 [2019-12-27 21:20:15,245 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 21:20:15,246 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 21:20:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 21:20:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 21:20:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 21:20:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-27 21:20:15,256 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-27 21:20:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:15,257 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-27 21:20:15,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-27 21:20:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:15,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:15,259 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 21:20:15,259 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 21:20:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-27 21:20:15,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:15,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987687972] [2019-12-27 21:20:15,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:15,381 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 21:20:15,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987687972] [2019-12-27 21:20:15,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:15,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:20:15,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1623353094] [2019-12-27 21:20:15,383 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:15,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:15,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 123 transitions. [2019-12-27 21:20:15,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:15,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:20:15,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:20:15,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:15,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:20:15,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:20:15,517 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-27 21:20:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:15,745 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-27 21:20:15,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:20:15,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 21:20:15,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:15,746 INFO L225 Difference]: With dead ends: 894 [2019-12-27 21:20:15,747 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 21:20:15,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 5 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 21:20:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 21:20:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 21:20:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 21:20:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-27 21:20:15,761 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-27 21:20:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:15,761 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-27 21:20:15,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:20:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-27 21:20:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:15,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:15,767 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 21:20:15,767 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 21:20:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-27 21:20:15,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:15,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536669268] [2019-12-27 21:20:15,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:15,883 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 21:20:15,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536669268] [2019-12-27 21:20:15,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:15,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:20:15,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1804775574] [2019-12-27 21:20:15,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:15,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:15,943 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 111 transitions. [2019-12-27 21:20:15,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:15,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:15,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:15,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:15,945 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 3 states. [2019-12-27 21:20:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:16,002 INFO L93 Difference]: Finished difference Result 719 states and 1687 transitions. [2019-12-27 21:20:16,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:16,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:20:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:16,007 INFO L225 Difference]: With dead ends: 719 [2019-12-27 21:20:16,007 INFO L226 Difference]: Without dead ends: 719 [2019-12-27 21:20:16,008 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 21:20:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-12-27 21:20:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 536. [2019-12-27 21:20:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 21:20:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1264 transitions. [2019-12-27 21:20:16,022 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1264 transitions. Word has length 55 [2019-12-27 21:20:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:16,022 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1264 transitions. [2019-12-27 21:20:16,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1264 transitions. [2019-12-27 21:20:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:20:16,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:16,024 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 21:20:16,025 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 21:20:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash 966806383, now seen corresponding path program 1 times [2019-12-27 21:20:16,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:16,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101200692] [2019-12-27 21:20:16,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:16,151 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 21:20:16,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101200692] [2019-12-27 21:20:16,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:16,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:20:16,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1145505592] [2019-12-27 21:20:16,152 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:16,169 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:16,210 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 111 transitions. [2019-12-27 21:20:16,210 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:16,210 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:16,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:20:16,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:20:16,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:16,211 INFO L87 Difference]: Start difference. First operand 536 states and 1264 transitions. Second operand 6 states. [2019-12-27 21:20:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:16,303 INFO L93 Difference]: Finished difference Result 906 states and 2043 transitions. [2019-12-27 21:20:16,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:20:16,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 21:20:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:16,304 INFO L225 Difference]: With dead ends: 906 [2019-12-27 21:20:16,304 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 21:20:16,305 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 21:20:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 21:20:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 319. [2019-12-27 21:20:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 21:20:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 591 transitions. [2019-12-27 21:20:16,311 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 591 transitions. Word has length 56 [2019-12-27 21:20:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:16,311 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 591 transitions. [2019-12-27 21:20:16,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:20:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 591 transitions. [2019-12-27 21:20:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:20:16,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:16,313 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 21:20:16,313 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 21:20:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash 256747969, now seen corresponding path program 2 times [2019-12-27 21:20:16,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:16,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667435203] [2019-12-27 21:20:16,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:16,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667435203] [2019-12-27 21:20:16,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:16,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:20:16,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2063384376] [2019-12-27 21:20:16,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:16,470 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:16,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 165 transitions. [2019-12-27 21:20:16,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:16,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:20:16,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:20:16,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:20:16,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:20:16,637 INFO L87 Difference]: Start difference. First operand 319 states and 591 transitions. Second operand 4 states. [2019-12-27 21:20:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:16,743 INFO L93 Difference]: Finished difference Result 373 states and 666 transitions. [2019-12-27 21:20:16,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:20:16,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-27 21:20:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:16,745 INFO L225 Difference]: With dead ends: 373 [2019-12-27 21:20:16,745 INFO L226 Difference]: Without dead ends: 373 [2019-12-27 21:20:16,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:20:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-27 21:20:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 280. [2019-12-27 21:20:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-27 21:20:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-27 21:20:16,751 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 56 [2019-12-27 21:20:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:16,751 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-27 21:20:16,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:20:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-27 21:20:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:20:16,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:16,753 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 21:20:16,753 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 21:20:16,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:16,753 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 1 times [2019-12-27 21:20:16,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:16,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132019618] [2019-12-27 21:20:16,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:17,198 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 21:20:17,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132019618] [2019-12-27 21:20:17,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:17,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:20:17,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1482231179] [2019-12-27 21:20:17,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:17,265 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:17,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 133 transitions. [2019-12-27 21:20:17,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:17,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:17,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:20:17,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:17,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:20:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:20:17,348 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 15 states. [2019-12-27 21:20:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:17,991 INFO L93 Difference]: Finished difference Result 440 states and 760 transitions. [2019-12-27 21:20:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:20:17,992 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 21:20:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:17,993 INFO L225 Difference]: With dead ends: 440 [2019-12-27 21:20:17,993 INFO L226 Difference]: Without dead ends: 406 [2019-12-27 21:20:17,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:20:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-27 21:20:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 388. [2019-12-27 21:20:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 21:20:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 686 transitions. [2019-12-27 21:20:18,001 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 686 transitions. Word has length 57 [2019-12-27 21:20:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:18,002 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 686 transitions. [2019-12-27 21:20:18,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:20:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 686 transitions. [2019-12-27 21:20:18,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:20:18,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:18,003 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 21:20:18,003 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 21:20:18,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:18,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 2 times [2019-12-27 21:20:18,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:18,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198030784] [2019-12-27 21:20:18,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:20:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:20:18,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:20:18,191 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:20:18,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$w_buff1~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~y$r_buff0_thd2~0_20 0) (= v_~main$tmp_guard0~0_9 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1211~0.base_25|) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff0_used~0_108 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25|) |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0)) |v_#memory_int_21|) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_9 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1211~0.base_25| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y$r_buff0_thd0~0_80 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25| 1)) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0) (= v_~y$mem_tmp~0_10 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25|)) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~y~0_26 0) (= v_~y$r_buff0_thd1~0_6 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ULTIMATE.start_main_~#t1211~0.base=|v_ULTIMATE.start_main_~#t1211~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_25|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_~#t1211~0.offset=|v_ULTIMATE.start_main_~#t1211~0.offset_19|, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, ULTIMATE.start_main_#t~ite28, #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, ULTIMATE.start_main_~#t1213~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~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, ULTIMATE.start_main_~#t1211~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1212~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_~#t1211~0.offset, 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_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1212~0.offset, 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, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:20:18,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13|) |v_ULTIMATE.start_main_~#t1212~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1212~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1212~0.base_13|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1212~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1212~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_11|, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1212~0.offset, ULTIMATE.start_main_~#t1212~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:20:18,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13|) |v_ULTIMATE.start_main_~#t1213~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1213~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1213~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1213~0.base_13| 0)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1213~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_13|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, ULTIMATE.start_main_~#t1213~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 21:20:18,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6) (= 1 v_~y$w_buff0_used~0_77) (= 2 v_~y$w_buff0~0_14) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_78) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} 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 21:20:18,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 21:20:18,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In330068897 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In330068897 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite11_Out330068897|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In330068897 |P2Thread1of1ForFork0_#t~ite11_Out330068897|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In330068897, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In330068897} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In330068897, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out330068897|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In330068897} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 21:20:18,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-882777905 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-882777905 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-882777905 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-882777905 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-882777905 |P2Thread1of1ForFork0_#t~ite12_Out-882777905|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-882777905|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-882777905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-882777905, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-882777905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882777905} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-882777905, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-882777905, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-882777905|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-882777905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882777905} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:20:18,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1065158720 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1065158720 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1065158720)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1065158720 ~y$r_buff0_thd3~0_Out-1065158720)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065158720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1065158720} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065158720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1065158720, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1065158720|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 21:20:18,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1388419288 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1388419288 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1388419288 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1388419288 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out1388419288| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite14_Out1388419288| ~y$r_buff1_thd3~0_In1388419288) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1388419288, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1388419288, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1388419288, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1388419288} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1388419288|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1388419288, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1388419288, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1388419288, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1388419288} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 21:20:18,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, 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 21:20:18,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In421881176 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In421881176 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In421881176 |P1Thread1of1ForFork2_#t~ite3_Out421881176|) (not .cse1)) (and (= ~y~0_In421881176 |P1Thread1of1ForFork2_#t~ite3_Out421881176|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In421881176, ~y$w_buff1~0=~y$w_buff1~0_In421881176, ~y~0=~y~0_In421881176, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421881176} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In421881176, ~y$w_buff1~0=~y$w_buff1~0_In421881176, ~y~0=~y~0_In421881176, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out421881176|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421881176} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:20:18,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:20:18,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-295985538 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-295985538 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-295985538|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-295985538 |P1Thread1of1ForFork2_#t~ite5_Out-295985538|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-295985538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-295985538} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-295985538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-295985538, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-295985538|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:20:18,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-449946712 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-449946712 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-449946712 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-449946712 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-449946712|)) (and (= ~y$w_buff1_used~0_In-449946712 |P1Thread1of1ForFork2_#t~ite6_Out-449946712|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-449946712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-449946712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-449946712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-449946712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-449946712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-449946712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-449946712, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-449946712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-449946712} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:20:18,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In954430804 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In954430804 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out954430804| ~y$r_buff0_thd2~0_In954430804)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out954430804| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In954430804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In954430804} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In954430804, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In954430804, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out954430804|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:20:18,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1904304452 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1904304452 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1904304452 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1904304452 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1904304452|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite8_Out1904304452| ~y$r_buff1_thd2~0_In1904304452) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1904304452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1904304452, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1904304452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1904304452} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1904304452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1904304452, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1904304452|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1904304452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1904304452} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:20:18,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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 21:20:18,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:20:18,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite18_Out-512625225| |ULTIMATE.start_main_#t~ite19_Out-512625225|)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-512625225 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-512625225 256)))) (or (and (= ~y$w_buff1~0_In-512625225 |ULTIMATE.start_main_#t~ite18_Out-512625225|) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite18_Out-512625225| ~y~0_In-512625225) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-512625225, ~y~0=~y~0_In-512625225, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-512625225, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-512625225} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-512625225, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-512625225|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-512625225|, ~y~0=~y~0_In-512625225, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-512625225, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-512625225} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:20:18,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2086568566 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2086568566 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-2086568566| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-2086568566| ~y$w_buff0_used~0_In-2086568566)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2086568566, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2086568566} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2086568566, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2086568566, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-2086568566|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:20:18,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1990067568 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1990067568 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1990067568 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1990067568 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1990067568| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1990067568 |ULTIMATE.start_main_#t~ite21_Out-1990067568|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1990067568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1990067568, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1990067568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1990067568} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1990067568, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1990067568, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1990067568|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1990067568, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1990067568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:20:18,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1735676395 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1735676395 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out-1735676395|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1735676395 |ULTIMATE.start_main_#t~ite22_Out-1735676395|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1735676395, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1735676395} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1735676395, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1735676395, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1735676395|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:20:18,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-572362998 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-572362998 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-572362998 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-572362998 256)))) (or (and (= ~y$r_buff1_thd0~0_In-572362998 |ULTIMATE.start_main_#t~ite23_Out-572362998|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-572362998|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-572362998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-572362998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-572362998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572362998} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-572362998, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-572362998, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-572362998, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-572362998|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-572362998} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:20:18,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In861535282 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In861535282 256)))) (or (= (mod ~y$w_buff0_used~0_In861535282 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In861535282 256))) (and (= 0 (mod ~y$r_buff1_thd0~0_In861535282 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite33_Out861535282| |ULTIMATE.start_main_#t~ite32_Out861535282|) (= ~y$w_buff1~0_In861535282 |ULTIMATE.start_main_#t~ite32_Out861535282|)) (and (= ~y$w_buff1~0_In861535282 |ULTIMATE.start_main_#t~ite33_Out861535282|) (= |ULTIMATE.start_main_#t~ite32_In861535282| |ULTIMATE.start_main_#t~ite32_Out861535282|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In861535282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In861535282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In861535282, ~weak$$choice2~0=~weak$$choice2~0_In861535282, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In861535282, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In861535282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In861535282} OutVars{~y$w_buff1~0=~y$w_buff1~0_In861535282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In861535282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In861535282, ~weak$$choice2~0=~weak$$choice2~0_In861535282, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out861535282|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In861535282, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out861535282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In861535282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 21:20:18,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1658742535 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1658742535 |ULTIMATE.start_main_#t~ite36_Out-1658742535|) (= |ULTIMATE.start_main_#t~ite35_In-1658742535| |ULTIMATE.start_main_#t~ite35_Out-1658742535|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite36_Out-1658742535| |ULTIMATE.start_main_#t~ite35_Out-1658742535|) (= ~y$w_buff0_used~0_In-1658742535 |ULTIMATE.start_main_#t~ite35_Out-1658742535|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1658742535 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1658742535 256)) (and (= (mod ~y$w_buff1_used~0_In-1658742535 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In-1658742535 256) 0) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658742535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1658742535, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1658742535|, ~weak$$choice2~0=~weak$$choice2~0_In-1658742535, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1658742535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1658742535} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658742535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1658742535, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1658742535|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1658742535|, ~weak$$choice2~0=~weak$$choice2~0_In-1658742535, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1658742535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1658742535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:20:18,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In623985572 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In623985572 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In623985572 256))) (= (mod ~y$w_buff0_used~0_In623985572 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In623985572 256))))) (= |ULTIMATE.start_main_#t~ite39_Out623985572| |ULTIMATE.start_main_#t~ite38_Out623985572|) (= ~y$w_buff1_used~0_In623985572 |ULTIMATE.start_main_#t~ite38_Out623985572|)) (and (not .cse0) (= ~y$w_buff1_used~0_In623985572 |ULTIMATE.start_main_#t~ite39_Out623985572|) (= |ULTIMATE.start_main_#t~ite38_In623985572| |ULTIMATE.start_main_#t~ite38_Out623985572|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In623985572, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In623985572, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In623985572|, ~weak$$choice2~0=~weak$$choice2~0_In623985572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In623985572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In623985572} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In623985572, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out623985572|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In623985572, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out623985572|, ~weak$$choice2~0=~weak$$choice2~0_In623985572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In623985572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In623985572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:20:18,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_64 v_~y$r_buff0_thd0~0_63)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} 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 21:20:18,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L839-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~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 21:20:18,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:20:18,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:20:18 BasicIcfg [2019-12-27 21:20:18,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:20:18,404 INFO L168 Benchmark]: Toolchain (without parser) took 17686.31 ms. Allocated memory was 145.2 MB in the beginning and 928.0 MB in the end (delta: 782.8 MB). Free memory was 101.3 MB in the beginning and 654.7 MB in the end (delta: -553.4 MB). Peak memory consumption was 619.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:18,405 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:20:18,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.81 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 154.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:18,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:18,408 INFO L168 Benchmark]: Boogie Preprocessor took 38.05 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:18,409 INFO L168 Benchmark]: RCFGBuilder took 813.01 ms. Allocated memory is still 202.4 MB. Free memory was 148.6 MB in the beginning and 101.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:18,410 INFO L168 Benchmark]: TraceAbstraction took 15907.32 ms. Allocated memory was 202.4 MB in the beginning and 884.5 MB in the end (delta: 682.1 MB). Free memory was 101.3 MB in the beginning and 220.7 MB in the end (delta: -119.4 MB). Peak memory consumption was 562.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:18,419 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.81 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 154.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.99 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.05 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.01 ms. Allocated memory is still 202.4 MB. Free memory was 148.6 MB in the beginning and 101.3 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15907.32 ms. Allocated memory was 202.4 MB in the beginning and 884.5 MB in the end (delta: 682.1 MB). Free memory was 101.3 MB in the beginning and 220.7 MB in the end (delta: -119.4 MB). Peak memory consumption was 562.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 164 ProgramPointsBefore, 84 ProgramPointsAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4106 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48939 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1211, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L812] FCALL, FORK 0 pthread_create(&t1212, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L814] FCALL, FORK 0 pthread_create(&t1213, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L787] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L787] 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) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L752] 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=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 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 [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 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=1, __unbuffered_p2_EBX=0, a=1, 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] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 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 [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 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 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L831] 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=1, __unbuffered_p2_EBX=0, a=1, 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] [L831] 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) [L832] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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] [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L837] 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=1, __unbuffered_p2_EBX=0, a=1, 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] [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1171 SDtfs, 1134 SDslu, 2264 SDs, 0 SdLazy, 1022 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24300occurred 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: 4.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2842 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 80329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...