/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/rfi000_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:49:02,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:49:02,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:49:02,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:49:02,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:49:02,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:49:02,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:49:02,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:49:02,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:49:02,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:49:02,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:49:02,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:49:02,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:49:02,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:49:02,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:49:02,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:49:02,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:49:02,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:49:02,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:49:02,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:49:02,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:49:02,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:49:02,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:49:02,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:49:02,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:49:02,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:49:02,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:49:02,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:49:02,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:49:02,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:49:02,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:49:02,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:49:02,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:49:02,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:49:02,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:49:02,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:49:02,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:49:02,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:49:02,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:49:02,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:49:02,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:49:02,531 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:49:02,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:49:02,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:49:02,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:49:02,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:49:02,557 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:49:02,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:49:02,558 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:49:02,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:49:02,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:49:02,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:49:02,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:49:02,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:49:02,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:49:02,560 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:49:02,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:49:02,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:49:02,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:49:02,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:49:02,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:49:02,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:49:02,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:49:02,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:49:02,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:49:02,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:49:02,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:49:02,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:49:02,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:49:02,563 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:49:02,563 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:49:02,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:49:02,565 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:49:02,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:49:02,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:49:02,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:49:02,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:49:02,881 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:49:02,882 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:49:02,882 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-27 21:49:02,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ab01486/fabf54d01f44416599db7eea08c1ed20/FLAGa3a741d9f [2019-12-27 21:49:03,480 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:49:03,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.opt.i [2019-12-27 21:49:03,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ab01486/fabf54d01f44416599db7eea08c1ed20/FLAGa3a741d9f [2019-12-27 21:49:03,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ab01486/fabf54d01f44416599db7eea08c1ed20 [2019-12-27 21:49:03,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:49:03,791 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:49:03,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:49:03,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:49:03,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:49:03,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:49:03" (1/1) ... [2019-12-27 21:49:03,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129bb515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:03, skipping insertion in model container [2019-12-27 21:49:03,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:49:03" (1/1) ... [2019-12-27 21:49:03,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:49:03,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:49:04,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:49:04,356 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:49:04,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:49:04,555 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:49:04,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04 WrapperNode [2019-12-27 21:49:04,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:49:04,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:49:04,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:49:04,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:49:04,568 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:49:04" (1/1) ... [2019-12-27 21:49:04,590 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:49:04" (1/1) ... [2019-12-27 21:49:04,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:49:04,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:49:04,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:49:04,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:49:04,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (1/1) ... [2019-12-27 21:49:04,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (1/1) ... [2019-12-27 21:49:04,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (1/1) ... [2019-12-27 21:49:04,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (1/1) ... [2019-12-27 21:49:04,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (1/1) ... [2019-12-27 21:49:04,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (1/1) ... [2019-12-27 21:49:04,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (1/1) ... [2019-12-27 21:49:04,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:49:04,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:49:04,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:49:04,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:49:04,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (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:49:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:49:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:49:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:49:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:49:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:49:04,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:49:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:49:04,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:49:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:49:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:49:04,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:49:04,742 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:49:05,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:49:05,482 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:49:05,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:49:05 BoogieIcfgContainer [2019-12-27 21:49:05,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:49:05,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:49:05,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:49:05,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:49:05,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:49:03" (1/3) ... [2019-12-27 21:49:05,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eee0409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:49:05, skipping insertion in model container [2019-12-27 21:49:05,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:49:04" (2/3) ... [2019-12-27 21:49:05,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eee0409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:49:05, skipping insertion in model container [2019-12-27 21:49:05,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:49:05" (3/3) ... [2019-12-27 21:49:05,492 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_power.opt.i [2019-12-27 21:49:05,502 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:49:05,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:49:05,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:49:05,513 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:49:05,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,569 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,591 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,591 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,595 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,596 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:49:05,615 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:49:05,634 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:49:05,634 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:49:05,635 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:49:05,635 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:49:05,635 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:49:05,635 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:49:05,635 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:49:05,635 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:49:05,653 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:49:05,655 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:49:05,759 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:49:05,759 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:49:05,775 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:49:05,796 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:49:05,839 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:49:05,840 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:49:05,845 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:49:05,858 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 21:49:05,859 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:49:08,613 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:49:08,733 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:49:08,752 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51265 [2019-12-27 21:49:08,752 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-27 21:49:08,756 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 21:49:09,286 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-27 21:49:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-27 21:49:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:49:09,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:09,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:49:09,296 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:09,303 INFO L82 PathProgramCache]: Analyzing trace with hash 691080428, now seen corresponding path program 1 times [2019-12-27 21:49:09,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:09,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379422319] [2019-12-27 21:49:09,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:09,529 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:49:09,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379422319] [2019-12-27 21:49:09,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:09,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:49:09,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [31275334] [2019-12-27 21:49:09,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:09,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:09,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:49:09,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:09,555 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:09,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:09,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:09,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:09,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:09,571 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-27 21:49:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:09,902 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-27 21:49:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:09,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:49:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:10,020 INFO L225 Difference]: With dead ends: 9416 [2019-12-27 21:49:10,020 INFO L226 Difference]: Without dead ends: 9234 [2019-12-27 21:49:10,022 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:49:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-27 21:49:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-27 21:49:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 21:49:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-27 21:49:10,524 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-27 21:49:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:10,525 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-27 21:49:10,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-27 21:49:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:49:10,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:10,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:10,532 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:10,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash -530442671, now seen corresponding path program 1 times [2019-12-27 21:49:10,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:10,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360852470] [2019-12-27 21:49:10,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:10,687 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:49:10,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360852470] [2019-12-27 21:49:10,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:10,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:10,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418105541] [2019-12-27 21:49:10,688 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:10,690 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:10,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:49:10,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:10,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:10,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:10,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:10,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:10,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:10,732 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 5 states. [2019-12-27 21:49:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:11,207 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-27 21:49:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:49:11,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:49:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:11,283 INFO L225 Difference]: With dead ends: 14362 [2019-12-27 21:49:11,283 INFO L226 Difference]: Without dead ends: 14355 [2019-12-27 21:49:11,284 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:49:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-27 21:49:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-27 21:49:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-27 21:49:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-27 21:49:12,379 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-27 21:49:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:12,380 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-27 21:49:12,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-27 21:49:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:49:12,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:12,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:49:12,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash -963171175, now seen corresponding path program 1 times [2019-12-27 21:49:12,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:12,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096275340] [2019-12-27 21:49:12,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:12,429 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:49:12,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096275340] [2019-12-27 21:49:12,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:12,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:12,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [619877460] [2019-12-27 21:49:12,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:12,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:12,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:49:12,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:12,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:12,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:12,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:12,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:12,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:12,438 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-27 21:49:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:12,467 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-27 21:49:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:12,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:49:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:12,472 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 21:49:12,472 INFO L226 Difference]: Without dead ends: 1778 [2019-12-27 21:49:12,473 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:49:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-27 21:49:12,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-27 21:49:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-27 21:49:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-27 21:49:12,528 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-27 21:49:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:12,529 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-27 21:49:12,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-27 21:49:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 21:49:12,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:12,533 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] [2019-12-27 21:49:12,533 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash 966140781, now seen corresponding path program 1 times [2019-12-27 21:49:12,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:12,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812565386] [2019-12-27 21:49:12,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:12,636 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:49:12,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812565386] [2019-12-27 21:49:12,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:12,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:12,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [697849245] [2019-12-27 21:49:12,638 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:12,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:12,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 21:49:12,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:12,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:12,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:12,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:12,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:12,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:12,669 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 5 states. [2019-12-27 21:49:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:12,692 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-27 21:49:12,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:49:12,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 21:49:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:12,694 INFO L225 Difference]: With dead ends: 371 [2019-12-27 21:49:12,694 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 21:49:12,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 21:49:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-27 21:49:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 21:49:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-27 21:49:12,702 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-27 21:49:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:12,702 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-27 21:49:12,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-27 21:49:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:12,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:12,704 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] [2019-12-27 21:49:12,704 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:12,705 INFO L82 PathProgramCache]: Analyzing trace with hash -813009935, now seen corresponding path program 1 times [2019-12-27 21:49:12,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:12,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978563656] [2019-12-27 21:49:12,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:12,831 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:49:12,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978563656] [2019-12-27 21:49:12,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:12,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:12,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484234536] [2019-12-27 21:49:12,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:12,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:12,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 21:49:12,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:12,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:12,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:12,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:12,891 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-27 21:49:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:12,952 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-27 21:49:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:12,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:49:12,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:12,953 INFO L225 Difference]: With dead ends: 345 [2019-12-27 21:49:12,953 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 21:49:12,954 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:49:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 21:49:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 21:49:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 21:49:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-27 21:49:12,961 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-27 21:49:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:12,961 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-27 21:49:12,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-27 21:49:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:12,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:12,963 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] [2019-12-27 21:49:12,964 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1499321922, now seen corresponding path program 1 times [2019-12-27 21:49:12,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:12,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966406514] [2019-12-27 21:49:12,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:13,032 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:49:13,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966406514] [2019-12-27 21:49:13,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:13,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:49:13,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1692948185] [2019-12-27 21:49:13,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:13,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:13,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 21:49:13,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:13,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:13,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:13,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:13,139 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-27 21:49:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:13,187 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-27 21:49:13,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:13,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:49:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:13,189 INFO L225 Difference]: With dead ends: 345 [2019-12-27 21:49:13,189 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 21:49:13,189 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:49:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 21:49:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 21:49:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 21:49:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-27 21:49:13,198 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-27 21:49:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:13,199 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-27 21:49:13,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-27 21:49:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:13,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:13,200 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] [2019-12-27 21:49:13,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:13,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1504614149, now seen corresponding path program 1 times [2019-12-27 21:49:13,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:13,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249023079] [2019-12-27 21:49:13,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:13,301 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:49:13,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249023079] [2019-12-27 21:49:13,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:13,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:49:13,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1620903846] [2019-12-27 21:49:13,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:13,318 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:13,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 21:49:13,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:13,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:13,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:13,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:13,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:13,355 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 5 states. [2019-12-27 21:49:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:13,618 INFO L93 Difference]: Finished difference Result 475 states and 866 transitions. [2019-12-27 21:49:13,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:49:13,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 21:49:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:13,619 INFO L225 Difference]: With dead ends: 475 [2019-12-27 21:49:13,620 INFO L226 Difference]: Without dead ends: 475 [2019-12-27 21:49:13,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:49:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-12-27 21:49:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 360. [2019-12-27 21:49:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-12-27 21:49:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 661 transitions. [2019-12-27 21:49:13,628 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 661 transitions. Word has length 52 [2019-12-27 21:49:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:13,628 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 661 transitions. [2019-12-27 21:49:13,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 661 transitions. [2019-12-27 21:49:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:13,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:13,630 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] [2019-12-27 21:49:13,630 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:13,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -378391557, now seen corresponding path program 2 times [2019-12-27 21:49:13,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:13,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960003874] [2019-12-27 21:49:13,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:13,777 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:49:13,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960003874] [2019-12-27 21:49:13,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:13,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:49:13,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466227407] [2019-12-27 21:49:13,778 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:13,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:13,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 115 transitions. [2019-12-27 21:49:13,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:13,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:49:13,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:49:13,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:13,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:49:13,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:49:13,850 INFO L87 Difference]: Start difference. First operand 360 states and 661 transitions. Second operand 6 states. [2019-12-27 21:49:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:14,250 INFO L93 Difference]: Finished difference Result 462 states and 842 transitions. [2019-12-27 21:49:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:49:14,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 21:49:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:14,252 INFO L225 Difference]: With dead ends: 462 [2019-12-27 21:49:14,252 INFO L226 Difference]: Without dead ends: 462 [2019-12-27 21:49:14,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:49:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-12-27 21:49:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 395. [2019-12-27 21:49:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-12-27 21:49:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 726 transitions. [2019-12-27 21:49:14,261 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 726 transitions. Word has length 52 [2019-12-27 21:49:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:14,261 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 726 transitions. [2019-12-27 21:49:14,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:49:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 726 transitions. [2019-12-27 21:49:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:14,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:14,263 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] [2019-12-27 21:49:14,263 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1056283141, now seen corresponding path program 3 times [2019-12-27 21:49:14,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:14,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026272810] [2019-12-27 21:49:14,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:14,360 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:49:14,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026272810] [2019-12-27 21:49:14,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:14,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:49:14,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1603663869] [2019-12-27 21:49:14,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:14,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:14,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 100 transitions. [2019-12-27 21:49:14,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:14,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:49:14,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:49:14,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:14,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:49:14,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:49:14,466 INFO L87 Difference]: Start difference. First operand 395 states and 726 transitions. Second operand 8 states. [2019-12-27 21:49:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:15,221 INFO L93 Difference]: Finished difference Result 550 states and 979 transitions. [2019-12-27 21:49:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:49:15,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 21:49:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:15,226 INFO L225 Difference]: With dead ends: 550 [2019-12-27 21:49:15,226 INFO L226 Difference]: Without dead ends: 550 [2019-12-27 21:49:15,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:49:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-12-27 21:49:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 379. [2019-12-27 21:49:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 21:49:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 677 transitions. [2019-12-27 21:49:15,240 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 677 transitions. Word has length 52 [2019-12-27 21:49:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:15,240 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 677 transitions. [2019-12-27 21:49:15,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:49:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 677 transitions. [2019-12-27 21:49:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:49:15,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:15,242 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] [2019-12-27 21:49:15,242 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:15,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1549888961, now seen corresponding path program 4 times [2019-12-27 21:49:15,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:15,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301387504] [2019-12-27 21:49:15,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:49:15,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301387504] [2019-12-27 21:49:15,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:15,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:49:15,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1642327236] [2019-12-27 21:49:15,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:15,420 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:15,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 94 transitions. [2019-12-27 21:49:15,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:15,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:49:15,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:49:15,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:15,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:49:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:49:15,564 INFO L87 Difference]: Start difference. First operand 379 states and 677 transitions. Second operand 9 states. [2019-12-27 21:49:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:16,482 INFO L93 Difference]: Finished difference Result 659 states and 1175 transitions. [2019-12-27 21:49:16,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:49:16,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-27 21:49:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:16,484 INFO L225 Difference]: With dead ends: 659 [2019-12-27 21:49:16,485 INFO L226 Difference]: Without dead ends: 659 [2019-12-27 21:49:16,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:49:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-12-27 21:49:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 379. [2019-12-27 21:49:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 21:49:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 677 transitions. [2019-12-27 21:49:16,494 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 677 transitions. Word has length 52 [2019-12-27 21:49:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:16,494 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 677 transitions. [2019-12-27 21:49:16,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:49:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 677 transitions. [2019-12-27 21:49:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:49:16,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:16,496 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] [2019-12-27 21:49:16,496 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash 305711121, now seen corresponding path program 1 times [2019-12-27 21:49:16,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:16,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811955881] [2019-12-27 21:49:16,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:16,717 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:49:16,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811955881] [2019-12-27 21:49:16,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:16,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:49:16,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1050848172] [2019-12-27 21:49:16,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:16,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:16,770 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 21:49:16,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:16,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:49:16,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:49:16,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:49:16,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:16,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:49:16,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:49:16,832 INFO L87 Difference]: Start difference. First operand 379 states and 677 transitions. Second operand 10 states. [2019-12-27 21:49:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:18,007 INFO L93 Difference]: Finished difference Result 666 states and 1183 transitions. [2019-12-27 21:49:18,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:49:18,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 21:49:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:18,010 INFO L225 Difference]: With dead ends: 666 [2019-12-27 21:49:18,010 INFO L226 Difference]: Without dead ends: 666 [2019-12-27 21:49:18,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:49:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-12-27 21:49:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 379. [2019-12-27 21:49:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 21:49:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 684 transitions. [2019-12-27 21:49:18,019 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 684 transitions. Word has length 53 [2019-12-27 21:49:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:18,019 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 684 transitions. [2019-12-27 21:49:18,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:49:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 684 transitions. [2019-12-27 21:49:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:49:18,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:18,021 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] [2019-12-27 21:49:18,021 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:18,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:18,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1624929181, now seen corresponding path program 2 times [2019-12-27 21:49:18,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:18,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285421748] [2019-12-27 21:49:18,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:18,133 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:49:18,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285421748] [2019-12-27 21:49:18,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:18,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:49:18,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567815515] [2019-12-27 21:49:18,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:18,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:18,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 103 transitions. [2019-12-27 21:49:18,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:18,197 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:49:18,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:49:18,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:49:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:49:18,199 INFO L87 Difference]: Start difference. First operand 379 states and 684 transitions. Second operand 5 states. [2019-12-27 21:49:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:18,234 INFO L93 Difference]: Finished difference Result 634 states and 1128 transitions. [2019-12-27 21:49:18,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:49:18,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 21:49:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:18,236 INFO L225 Difference]: With dead ends: 634 [2019-12-27 21:49:18,236 INFO L226 Difference]: Without dead ends: 272 [2019-12-27 21:49:18,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:49:18,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-27 21:49:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-12-27 21:49:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-12-27 21:49:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 470 transitions. [2019-12-27 21:49:18,241 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 470 transitions. Word has length 53 [2019-12-27 21:49:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:18,242 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 470 transitions. [2019-12-27 21:49:18,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:49:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 470 transitions. [2019-12-27 21:49:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:49:18,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:18,243 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] [2019-12-27 21:49:18,243 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:18,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:18,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1313923440, now seen corresponding path program 1 times [2019-12-27 21:49:18,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:18,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866664730] [2019-12-27 21:49:18,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:18,346 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:49:18,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866664730] [2019-12-27 21:49:18,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:18,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:18,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519121542] [2019-12-27 21:49:18,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:18,360 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:18,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 21:49:18,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:18,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:18,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:18,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:18,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:18,403 INFO L87 Difference]: Start difference. First operand 272 states and 470 transitions. Second operand 3 states. [2019-12-27 21:49:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:18,417 INFO L93 Difference]: Finished difference Result 247 states and 418 transitions. [2019-12-27 21:49:18,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:18,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:49:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:18,418 INFO L225 Difference]: With dead ends: 247 [2019-12-27 21:49:18,419 INFO L226 Difference]: Without dead ends: 247 [2019-12-27 21:49:18,419 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:49:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-27 21:49:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-12-27 21:49:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-12-27 21:49:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 418 transitions. [2019-12-27 21:49:18,425 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 418 transitions. Word has length 53 [2019-12-27 21:49:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:18,425 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 418 transitions. [2019-12-27 21:49:18,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 418 transitions. [2019-12-27 21:49:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:49:18,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:18,426 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] [2019-12-27 21:49:18,426 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash -92518571, now seen corresponding path program 3 times [2019-12-27 21:49:18,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:18,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374931951] [2019-12-27 21:49:18,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:49:18,490 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:49:18,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374931951] [2019-12-27 21:49:18,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:49:18,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:49:18,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46960978] [2019-12-27 21:49:18,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:49:18,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:49:18,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 105 transitions. [2019-12-27 21:49:18,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:49:18,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:49:18,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:49:18,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:49:18,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:49:18,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:49:18,544 INFO L87 Difference]: Start difference. First operand 247 states and 418 transitions. Second operand 3 states. [2019-12-27 21:49:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:49:18,592 INFO L93 Difference]: Finished difference Result 246 states and 416 transitions. [2019-12-27 21:49:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:49:18,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 21:49:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:49:18,593 INFO L225 Difference]: With dead ends: 246 [2019-12-27 21:49:18,593 INFO L226 Difference]: Without dead ends: 246 [2019-12-27 21:49:18,594 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:49:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-27 21:49:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 197. [2019-12-27 21:49:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-27 21:49:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 332 transitions. [2019-12-27 21:49:18,598 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 332 transitions. Word has length 53 [2019-12-27 21:49:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:49:18,599 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 332 transitions. [2019-12-27 21:49:18,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:49:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions. [2019-12-27 21:49:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 21:49:18,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:49:18,600 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] [2019-12-27 21:49:18,600 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:49:18,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:49:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash 599019040, now seen corresponding path program 1 times [2019-12-27 21:49:18,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:49:18,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391469319] [2019-12-27 21:49:18,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:49:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:49:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:49:18,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:49:18,753 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:49:18,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_44| 0 0))) (and (= v_~x$w_buff1_used~0_59 0) (= v_~x$r_buff1_thd1~0_19 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1587~0.base_18|) (= v_~x$flush_delayed~0_15 0) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_21) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1587~0.base_18| 4) |v_#length_15|) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= 0 v_~x$w_buff0~0_24) (= 0 v_~x$r_buff0_thd0~0_77) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_18|)) (= 0 |v_ULTIMATE.start_main_~#t1587~0.offset_13|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff1_thd0~0_48 0) (= v_~y~0_13 0) (= v_~x$r_buff1_thd2~0_19 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1587~0.base_18| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1587~0.base_18|) |v_ULTIMATE.start_main_~#t1587~0.offset_13| 0)) |v_#memory_int_15|) (= 0 v_~x$r_buff0_thd1~0_21) (= 0 v_~x$r_buff0_thd2~0_28) (= 0 v_~x$w_buff0_used~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_12 0) (= |v_#valid_42| (store .cse0 |v_ULTIMATE.start_main_~#t1587~0.base_18| 1)) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1587~0.offset=|v_ULTIMATE.start_main_~#t1587~0.offset_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_10|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_8|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_8|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_77, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_6|, ~x$w_buff1~0=v_~x$w_buff1~0_21, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_59, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~x~0=v_~x~0_27, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_10|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_11|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_16|, ~y~0=v_~y~0_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_10|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_~#t1587~0.base=|v_ULTIMATE.start_main_~#t1587~0.base_18|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1587~0.offset, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1588~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1587~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:49:18,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L787-1-->L789: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1588~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1588~0.base_10|) |v_ULTIMATE.start_main_~#t1588~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1588~0.offset_9| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1588~0.base_10| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1588~0.base_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10| 1)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1588~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1588~0.offset=|v_ULTIMATE.start_main_~#t1588~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, ULTIMATE.start_main_~#t1588~0.base=|v_ULTIMATE.start_main_~#t1588~0.base_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1588~0.offset, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1588~0.base, #length] because there is no mapped edge [2019-12-27 21:49:18,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L4-->L764: Formula: (and (= ~y~0_Out-1574997452 ~__unbuffered_p1_EBX~0_Out-1574997452) (= ~x$r_buff0_thd1~0_In-1574997452 ~x$r_buff1_thd1~0_Out-1574997452) (= ~__unbuffered_p1_EAX~0_Out-1574997452 ~y~0_Out-1574997452) (= ~x$r_buff0_thd2~0_Out-1574997452 1) (= ~y~0_Out-1574997452 1) (= ~x$r_buff1_thd0~0_Out-1574997452 ~x$r_buff0_thd0~0_In-1574997452) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1574997452 0)) (= ~x$r_buff1_thd2~0_Out-1574997452 ~x$r_buff0_thd2~0_In-1574997452)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1574997452, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1574997452, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1574997452, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1574997452} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1574997452, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1574997452, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1574997452, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1574997452, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1574997452, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1574997452, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1574997452, ~y~0=~y~0_Out-1574997452, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1574997452, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1574997452} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:49:18,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-2097660462 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2097660462 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-2097660462| ~x~0_In-2097660462) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-2097660462 |P0Thread1of1ForFork0_#t~ite3_Out-2097660462|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2097660462, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2097660462, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2097660462, ~x~0=~x~0_In-2097660462} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-2097660462|, ~x$w_buff1~0=~x$w_buff1~0_In-2097660462, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2097660462, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2097660462, ~x~0=~x~0_In-2097660462} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 21:49:18,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_15 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 21:49:18,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1436157767 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1436157767 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1436157767| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1436157767 |P0Thread1of1ForFork0_#t~ite5_Out1436157767|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1436157767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1436157767} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1436157767|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1436157767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1436157767} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:49:18,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-237345346 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-237345346 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-237345346 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-237345346 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-237345346|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-237345346 |P0Thread1of1ForFork0_#t~ite6_Out-237345346|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-237345346, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-237345346, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-237345346, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-237345346} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-237345346|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-237345346, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-237345346, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-237345346, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-237345346} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:49:18,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-328024554 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-328024554 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-328024554|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_In-328024554 |P0Thread1of1ForFork0_#t~ite7_Out-328024554|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-328024554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-328024554} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-328024554, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-328024554|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-328024554} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:49:18,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2101616438 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2101616438 256)))) (or (and (= ~x$w_buff0_used~0_In2101616438 |P1Thread1of1ForFork1_#t~ite11_Out2101616438|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out2101616438| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2101616438, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2101616438} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out2101616438|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2101616438, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2101616438} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:49:18,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1855320924 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1855320924 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1855320924 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1855320924 256) 0))) (or (and (= ~x$w_buff1_used~0_In1855320924 |P1Thread1of1ForFork1_#t~ite12_Out1855320924|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1855320924|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1855320924, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1855320924, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1855320924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1855320924} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1855320924, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1855320924, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1855320924|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1855320924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1855320924} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:49:18,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1774722415 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1774722415 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-1774722415 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1774722415 ~x$r_buff0_thd2~0_In-1774722415) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1774722415, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1774722415} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1774722415|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1774722415, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1774722415} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 21:49:18,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1707663347 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1707663347 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1707663347 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1707663347 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1707663347| ~x$r_buff1_thd2~0_In1707663347) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out1707663347| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1707663347, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1707663347, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1707663347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1707663347} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1707663347, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1707663347, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1707663347, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1707663347|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1707663347} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:49:18,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:49:18,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In1970435657 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1970435657 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1970435657 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1970435657 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1970435657|)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1970435657| ~x$r_buff1_thd1~0_In1970435657) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1970435657, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1970435657, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1970435657, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1970435657} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1970435657, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1970435657|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1970435657, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1970435657, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1970435657} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:49:18,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L734-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:49:18,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:49:18,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1353306951 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1353306951 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1353306951 |ULTIMATE.start_main_#t~ite17_Out-1353306951|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-1353306951 |ULTIMATE.start_main_#t~ite17_Out-1353306951|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1353306951, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1353306951, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1353306951, ~x~0=~x~0_In-1353306951} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1353306951|, ~x$w_buff1~0=~x$w_buff1~0_In-1353306951, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1353306951, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1353306951, ~x~0=~x~0_In-1353306951} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 21:49:18,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_18 |v_ULTIMATE.start_main_#t~ite17_7|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_6|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 21:49:18,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2105889312 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2105889312 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out-2105889312|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2105889312 |ULTIMATE.start_main_#t~ite19_Out-2105889312|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2105889312, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2105889312} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2105889312, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2105889312|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2105889312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:49:18,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1302902893 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1302902893 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1302902893 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1302902893 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out1302902893| ~x$w_buff1_used~0_In1302902893) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1302902893|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1302902893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1302902893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1302902893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1302902893} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1302902893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1302902893, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1302902893|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1302902893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1302902893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:49:18,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In396704840 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In396704840 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out396704840| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out396704840| ~x$r_buff0_thd0~0_In396704840)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In396704840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In396704840} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In396704840, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out396704840|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In396704840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:49:18,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-776347410 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-776347410 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-776347410 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-776347410 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-776347410| 0)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-776347410 |ULTIMATE.start_main_#t~ite22_Out-776347410|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-776347410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-776347410, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-776347410, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-776347410} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-776347410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-776347410, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-776347410, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-776347410|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-776347410} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:49:18,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (= v_~x$r_buff0_thd0~0_69 v_~x$r_buff0_thd0~0_70) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:49:18,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-->L817-1: Formula: (and (= 0 v_~x$flush_delayed~0_9) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~x$flush_delayed~0_10 256))) (= v_~x$mem_tmp~0_6 v_~x~0_22)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_8|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:49:18,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 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_11, 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:49:18,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:49:18 BasicIcfg [2019-12-27 21:49:18,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:49:18,892 INFO L168 Benchmark]: Toolchain (without parser) took 15095.98 ms. Allocated memory was 144.7 MB in the beginning and 611.8 MB in the end (delta: 467.1 MB). Free memory was 101.5 MB in the beginning and 172.7 MB in the end (delta: -71.2 MB). Peak memory consumption was 395.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:18,893 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 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:49:18,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.88 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 154.6 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:49:18,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.51 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.7 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:49:18,900 INFO L168 Benchmark]: Boogie Preprocessor took 45.60 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 149.0 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:49:18,900 INFO L168 Benchmark]: RCFGBuilder took 810.76 ms. Allocated memory is still 202.4 MB. Free memory was 149.0 MB in the beginning and 104.5 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:18,901 INFO L168 Benchmark]: TraceAbstraction took 13400.46 ms. Allocated memory was 202.4 MB in the beginning and 611.8 MB in the end (delta: 409.5 MB). Free memory was 103.9 MB in the beginning and 172.7 MB in the end (delta: -68.9 MB). Peak memory consumption was 340.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:49:18,906 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.22 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.88 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 154.6 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 69.51 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.60 ms. Allocated memory is still 202.4 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.76 ms. Allocated memory is still 202.4 MB. Free memory was 149.0 MB in the beginning and 104.5 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13400.46 ms. Allocated memory was 202.4 MB in the beginning and 611.8 MB in the end (delta: 409.5 MB). Free memory was 103.9 MB in the beginning and 172.7 MB in the end (delta: -68.9 MB). Peak memory consumption was 340.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 24 ChoiceCompositions, 3733 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51265 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1587, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1588, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1500 SDtfs, 961 SDslu, 3032 SDs, 0 SdLazy, 2379 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 48 SyntacticMatches, 21 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred 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: 1.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 2329 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 68430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...