/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:18:56,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:18:56,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:18:56,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:18:56,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:18:56,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:18:56,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:18:56,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:18:56,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:18:56,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:18:56,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:18:56,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:18:56,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:18:56,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:18:56,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:18:56,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:18:56,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:18:56,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:18:56,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:18:56,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:18:56,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:18:56,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:18:56,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:18:56,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:18:56,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:18:56,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:18:56,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:18:56,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:18:56,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:18:56,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:18:56,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:18:56,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:18:56,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:18:56,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:18:56,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:18:56,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:18:56,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:18:56,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:18:56,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:18:56,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:18:56,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:18:56,634 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-NoLbe-MCR.epf [2019-12-28 03:18:56,658 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:18:56,658 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:18:56,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:18:56,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:18:56,661 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:18:56,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:18:56,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:18:56,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:18:56,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:18:56,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:18:56,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:18:56,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:18:56,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:18:56,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:18:56,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:18:56,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:18:56,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:18:56,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:18:56,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:18:56,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:18:56,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:18:56,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:18:56,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:18:56,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:18:56,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:18:56,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:18:56,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:18:56,668 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:18:56,668 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:18:56,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:18:56,669 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:18:56,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:18:56,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:18:56,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:18:56,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:18:56,960 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:18:56,961 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:18:56,962 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i [2019-12-28 03:18:57,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200fbc9d5/6490e473638d4d508962c273f50b3c04/FLAG614856a3c [2019-12-28 03:18:57,568 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:18:57,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.oepc.i [2019-12-28 03:18:57,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200fbc9d5/6490e473638d4d508962c273f50b3c04/FLAG614856a3c [2019-12-28 03:18:57,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200fbc9d5/6490e473638d4d508962c273f50b3c04 [2019-12-28 03:18:57,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:18:57,849 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:18:57,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:18:57,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:18:57,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:18:57,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:18:57" (1/1) ... [2019-12-28 03:18:57,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:57, skipping insertion in model container [2019-12-28 03:18:57,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:18:57" (1/1) ... [2019-12-28 03:18:57,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:18:57,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:18:58,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:18:58,465 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:18:58,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:18:58,643 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:18:58,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58 WrapperNode [2019-12-28 03:18:58,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:18:58,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:18:58,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:18:58,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:18:58,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:18:58,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:18:58,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:18:58,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:18:58,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (1/1) ... [2019-12-28 03:18:58,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:18:58,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:18:58,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:18:58,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:18:58,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (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-28 03:18:58,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:18:58,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:18:58,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:18:58,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:18:58,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:18:58,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:18:58,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:18:58,812 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:18:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:18:58,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:18:58,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:18:58,814 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:18:59,545 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:18:59,545 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:18:59,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:18:59 BoogieIcfgContainer [2019-12-28 03:18:59,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:18:59,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:18:59,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:18:59,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:18:59,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:18:57" (1/3) ... [2019-12-28 03:18:59,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40998073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:18:59, skipping insertion in model container [2019-12-28 03:18:59,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:18:58" (2/3) ... [2019-12-28 03:18:59,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40998073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:18:59, skipping insertion in model container [2019-12-28 03:18:59,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:18:59" (3/3) ... [2019-12-28 03:18:59,560 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc.i [2019-12-28 03:18:59,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:18:59,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:18:59,585 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:18:59,586 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:18:59,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,646 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,647 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,664 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,664 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,733 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,734 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,734 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,740 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,743 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:18:59,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:18:59,780 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:18:59,781 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:18:59,781 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:18:59,781 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:18:59,781 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:18:59,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:18:59,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:18:59,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:18:59,795 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-28 03:19:02,138 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-12-28 03:19:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-12-28 03:19:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-28 03:19:02,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:02,147 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] [2019-12-28 03:19:02,148 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:02,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash -334571497, now seen corresponding path program 1 times [2019-12-28 03:19:02,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:02,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105107396] [2019-12-28 03:19:02,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:02,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-28 03:19:02,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105107396] [2019-12-28 03:19:02,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:02,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:02,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1485730287] [2019-12-28 03:19:02,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:02,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:02,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-28 03:19:02,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:02,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:02,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:02,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:02,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:02,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:02,478 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-12-28 03:19:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:03,808 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-12-28 03:19:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:19:03,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-28 03:19:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:04,069 INFO L225 Difference]: With dead ends: 33590 [2019-12-28 03:19:04,070 INFO L226 Difference]: Without dead ends: 25702 [2019-12-28 03:19:04,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-12-28 03:19:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-12-28 03:19:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-12-28 03:19:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-12-28 03:19:05,775 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-12-28 03:19:05,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:05,776 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-12-28 03:19:05,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-12-28 03:19:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 03:19:05,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:05,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:05,788 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1021806200, now seen corresponding path program 1 times [2019-12-28 03:19:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:05,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618141760] [2019-12-28 03:19:05,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:05,950 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-28 03:19:05,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618141760] [2019-12-28 03:19:05,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:05,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:05,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970100256] [2019-12-28 03:19:05,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:05,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:05,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 03:19:05,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:05,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:05,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:05,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:05,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:05,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:05,970 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-12-28 03:19:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:08,117 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-12-28 03:19:08,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:08,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 03:19:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:08,333 INFO L225 Difference]: With dead ends: 41080 [2019-12-28 03:19:08,334 INFO L226 Difference]: Without dead ends: 40544 [2019-12-28 03:19:08,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-12-28 03:19:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-12-28 03:19:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-12-28 03:19:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-12-28 03:19:09,751 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-12-28 03:19:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:09,752 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-12-28 03:19:09,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-12-28 03:19:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 03:19:09,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:09,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:09,759 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:09,760 INFO L82 PathProgramCache]: Analyzing trace with hash -169129071, now seen corresponding path program 1 times [2019-12-28 03:19:09,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:09,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305517323] [2019-12-28 03:19:09,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:09,891 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-28 03:19:09,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305517323] [2019-12-28 03:19:09,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:09,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:09,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365114300] [2019-12-28 03:19:09,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:09,899 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:09,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-28 03:19:09,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:09,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:09,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:09,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:09,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:09,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:09,907 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-12-28 03:19:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:10,831 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-12-28 03:19:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:10,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 03:19:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:11,126 INFO L225 Difference]: With dead ends: 49777 [2019-12-28 03:19:11,127 INFO L226 Difference]: Without dead ends: 49273 [2019-12-28 03:19:11,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-12-28 03:19:13,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-12-28 03:19:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-12-28 03:19:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-12-28 03:19:14,030 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-12-28 03:19:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:14,031 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-12-28 03:19:14,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-12-28 03:19:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:19:14,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:14,040 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] [2019-12-28 03:19:14,041 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:14,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1646950391, now seen corresponding path program 1 times [2019-12-28 03:19:14,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:14,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607645420] [2019-12-28 03:19:14,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:14,096 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-28 03:19:14,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607645420] [2019-12-28 03:19:14,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:14,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:19:14,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508924289] [2019-12-28 03:19:14,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:14,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:14,110 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 03:19:14,110 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:14,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:14,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:19:14,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:14,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:19:14,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:14,112 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-12-28 03:19:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:14,774 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-12-28 03:19:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:19:14,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-28 03:19:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:14,974 INFO L225 Difference]: With dead ends: 61086 [2019-12-28 03:19:14,974 INFO L226 Difference]: Without dead ends: 61086 [2019-12-28 03:19:14,974 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-28 03:19:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-12-28 03:19:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-12-28 03:19:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-12-28 03:19:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-12-28 03:19:17,942 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-12-28 03:19:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:17,943 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-12-28 03:19:17,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:19:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-12-28 03:19:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 03:19:17,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:17,959 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-28 03:19:17,959 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash 2087627749, now seen corresponding path program 1 times [2019-12-28 03:19:17,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:17,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452756034] [2019-12-28 03:19:17,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:18,130 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-28 03:19:18,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452756034] [2019-12-28 03:19:18,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:18,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:18,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1751102880] [2019-12-28 03:19:18,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:18,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:18,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 64 transitions. [2019-12-28 03:19:18,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:18,145 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:18,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:18,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:18,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:18,146 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-12-28 03:19:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:19,144 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-12-28 03:19:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:19,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-28 03:19:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:19,783 INFO L225 Difference]: With dead ends: 63755 [2019-12-28 03:19:19,783 INFO L226 Difference]: Without dead ends: 63755 [2019-12-28 03:19:19,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-12-28 03:19:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-12-28 03:19:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-12-28 03:19:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-12-28 03:19:23,521 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-12-28 03:19:23,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:23,521 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-12-28 03:19:23,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-12-28 03:19:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 03:19:23,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:23,541 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-28 03:19:23,541 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:23,542 INFO L82 PathProgramCache]: Analyzing trace with hash 290676390, now seen corresponding path program 1 times [2019-12-28 03:19:23,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:23,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140480533] [2019-12-28 03:19:23,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:23,654 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-28 03:19:23,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140480533] [2019-12-28 03:19:23,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:23,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:19:23,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [152262553] [2019-12-28 03:19:23,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:23,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:23,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 64 transitions. [2019-12-28 03:19:23,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:23,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:23,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:19:23,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:23,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:19:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:23,669 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-12-28 03:19:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:25,132 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-12-28 03:19:25,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:19:25,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-28 03:19:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:25,316 INFO L225 Difference]: With dead ends: 83684 [2019-12-28 03:19:25,316 INFO L226 Difference]: Without dead ends: 83684 [2019-12-28 03:19:25,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:19:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-12-28 03:19:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-12-28 03:19:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-12-28 03:19:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-12-28 03:19:30,542 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-12-28 03:19:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:30,543 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-12-28 03:19:30,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:19:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-12-28 03:19:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 03:19:30,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:30,558 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-28 03:19:30,558 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:30,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:30,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180071, now seen corresponding path program 1 times [2019-12-28 03:19:30,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:30,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538339172] [2019-12-28 03:19:30,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:30,615 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-28 03:19:30,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538339172] [2019-12-28 03:19:30,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:30,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:19:30,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913541389] [2019-12-28 03:19:30,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:30,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:30,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 64 transitions. [2019-12-28 03:19:30,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:30,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:30,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:19:30,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:30,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:19:30,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:30,629 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 3 states. [2019-12-28 03:19:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:30,897 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-12-28 03:19:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:19:30,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-28 03:19:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:31,011 INFO L225 Difference]: With dead ends: 54020 [2019-12-28 03:19:31,011 INFO L226 Difference]: Without dead ends: 54020 [2019-12-28 03:19:31,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:31,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-12-28 03:19:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-12-28 03:19:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-12-28 03:19:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-12-28 03:19:32,336 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-12-28 03:19:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:32,337 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-12-28 03:19:32,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:19:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-12-28 03:19:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-28 03:19:32,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:32,346 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-28 03:19:32,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:32,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1257036994, now seen corresponding path program 1 times [2019-12-28 03:19:32,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:32,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276832810] [2019-12-28 03:19:32,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:32,444 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-28 03:19:32,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276832810] [2019-12-28 03:19:32,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:32,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:32,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198721429] [2019-12-28 03:19:32,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:32,452 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:32,459 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 52 transitions. [2019-12-28 03:19:32,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:32,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:32,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:32,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:32,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:32,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:32,461 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-12-28 03:19:33,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:33,248 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-12-28 03:19:33,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:19:33,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-28 03:19:33,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:33,394 INFO L225 Difference]: With dead ends: 68645 [2019-12-28 03:19:33,394 INFO L226 Difference]: Without dead ends: 68077 [2019-12-28 03:19:33,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:19:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-12-28 03:19:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-12-28 03:19:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-12-28 03:19:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-12-28 03:19:34,949 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-12-28 03:19:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:34,950 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-12-28 03:19:34,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-12-28 03:19:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:19:34,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:34,961 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-28 03:19:34,961 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:34,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:34,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2126518202, now seen corresponding path program 1 times [2019-12-28 03:19:34,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:34,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530235520] [2019-12-28 03:19:34,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:35,106 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-28 03:19:35,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530235520] [2019-12-28 03:19:35,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:35,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:35,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [813861288] [2019-12-28 03:19:35,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:35,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:35,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 03:19:35,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:35,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:35,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:35,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:35,127 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 6 states. [2019-12-28 03:19:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:36,017 INFO L93 Difference]: Finished difference Result 67848 states and 231359 transitions. [2019-12-28 03:19:36,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:36,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 03:19:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:36,175 INFO L225 Difference]: With dead ends: 67848 [2019-12-28 03:19:36,176 INFO L226 Difference]: Without dead ends: 67848 [2019-12-28 03:19:36,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67848 states. [2019-12-28 03:19:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67848 to 59080. [2019-12-28 03:19:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59080 states. [2019-12-28 03:19:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59080 states to 59080 states and 204129 transitions. [2019-12-28 03:19:37,786 INFO L78 Accepts]: Start accepts. Automaton has 59080 states and 204129 transitions. Word has length 53 [2019-12-28 03:19:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:37,786 INFO L462 AbstractCegarLoop]: Abstraction has 59080 states and 204129 transitions. [2019-12-28 03:19:37,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 59080 states and 204129 transitions. [2019-12-28 03:19:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:19:37,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:37,797 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-28 03:19:37,797 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:37,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:37,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1239014521, now seen corresponding path program 1 times [2019-12-28 03:19:37,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:37,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031905603] [2019-12-28 03:19:37,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:37,857 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-28 03:19:37,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031905603] [2019-12-28 03:19:37,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:37,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:37,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933736593] [2019-12-28 03:19:37,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:37,863 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:37,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 03:19:37,870 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:37,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:37,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:37,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:37,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:37,871 INFO L87 Difference]: Start difference. First operand 59080 states and 204129 transitions. Second operand 4 states. [2019-12-28 03:19:37,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:37,939 INFO L93 Difference]: Finished difference Result 10211 states and 31245 transitions. [2019-12-28 03:19:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:37,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-28 03:19:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:37,956 INFO L225 Difference]: With dead ends: 10211 [2019-12-28 03:19:37,956 INFO L226 Difference]: Without dead ends: 8506 [2019-12-28 03:19:37,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2019-12-28 03:19:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8458. [2019-12-28 03:19:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8458 states. [2019-12-28 03:19:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 25324 transitions. [2019-12-28 03:19:38,077 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 25324 transitions. Word has length 53 [2019-12-28 03:19:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:38,077 INFO L462 AbstractCegarLoop]: Abstraction has 8458 states and 25324 transitions. [2019-12-28 03:19:38,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 25324 transitions. [2019-12-28 03:19:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:19:38,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:38,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:38,080 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:38,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash -575967074, now seen corresponding path program 1 times [2019-12-28 03:19:38,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:38,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238416111] [2019-12-28 03:19:38,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:38,134 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-28 03:19:38,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238416111] [2019-12-28 03:19:38,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:38,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:38,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1546783729] [2019-12-28 03:19:38,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:38,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:38,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 60 transitions. [2019-12-28 03:19:38,155 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:38,155 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:38,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:38,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:38,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:38,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:38,156 INFO L87 Difference]: Start difference. First operand 8458 states and 25324 transitions. Second operand 4 states. [2019-12-28 03:19:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:38,282 INFO L93 Difference]: Finished difference Result 9705 states and 29103 transitions. [2019-12-28 03:19:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:38,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-28 03:19:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:38,300 INFO L225 Difference]: With dead ends: 9705 [2019-12-28 03:19:38,301 INFO L226 Difference]: Without dead ends: 9705 [2019-12-28 03:19:38,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-12-28 03:19:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 8878. [2019-12-28 03:19:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-28 03:19:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 26587 transitions. [2019-12-28 03:19:38,514 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 26587 transitions. Word has length 60 [2019-12-28 03:19:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:38,515 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 26587 transitions. [2019-12-28 03:19:38,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 26587 transitions. [2019-12-28 03:19:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:19:38,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:38,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:38,519 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:38,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1166843261, now seen corresponding path program 1 times [2019-12-28 03:19:38,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:38,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84756206] [2019-12-28 03:19:38,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:38,604 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-28 03:19:38,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84756206] [2019-12-28 03:19:38,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:38,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:38,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1313697663] [2019-12-28 03:19:38,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:38,615 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:38,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 60 transitions. [2019-12-28 03:19:38,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:38,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:38,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:38,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:38,629 INFO L87 Difference]: Start difference. First operand 8878 states and 26587 transitions. Second operand 6 states. [2019-12-28 03:19:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:39,038 INFO L93 Difference]: Finished difference Result 11194 states and 33074 transitions. [2019-12-28 03:19:39,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:19:39,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 03:19:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:39,056 INFO L225 Difference]: With dead ends: 11194 [2019-12-28 03:19:39,057 INFO L226 Difference]: Without dead ends: 11133 [2019-12-28 03:19:39,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:19:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2019-12-28 03:19:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 10409. [2019-12-28 03:19:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10409 states. [2019-12-28 03:19:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 30941 transitions. [2019-12-28 03:19:39,209 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 30941 transitions. Word has length 60 [2019-12-28 03:19:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:39,209 INFO L462 AbstractCegarLoop]: Abstraction has 10409 states and 30941 transitions. [2019-12-28 03:19:39,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 30941 transitions. [2019-12-28 03:19:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:39,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:39,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:39,215 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:39,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash -45860868, now seen corresponding path program 1 times [2019-12-28 03:19:39,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:39,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025539805] [2019-12-28 03:19:39,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:39,272 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-28 03:19:39,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025539805] [2019-12-28 03:19:39,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:39,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:39,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2078246049] [2019-12-28 03:19:39,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:39,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:39,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:39,308 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:39,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:39,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:39,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:39,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:39,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:39,310 INFO L87 Difference]: Start difference. First operand 10409 states and 30941 transitions. Second operand 4 states. [2019-12-28 03:19:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:39,593 INFO L93 Difference]: Finished difference Result 13382 states and 39332 transitions. [2019-12-28 03:19:39,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:19:39,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 03:19:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:39,612 INFO L225 Difference]: With dead ends: 13382 [2019-12-28 03:19:39,612 INFO L226 Difference]: Without dead ends: 13382 [2019-12-28 03:19:39,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2019-12-28 03:19:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 11723. [2019-12-28 03:19:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11723 states. [2019-12-28 03:19:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11723 states to 11723 states and 34576 transitions. [2019-12-28 03:19:39,774 INFO L78 Accepts]: Start accepts. Automaton has 11723 states and 34576 transitions. Word has length 66 [2019-12-28 03:19:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:39,774 INFO L462 AbstractCegarLoop]: Abstraction has 11723 states and 34576 transitions. [2019-12-28 03:19:39,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 11723 states and 34576 transitions. [2019-12-28 03:19:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:39,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:39,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:39,782 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 915753149, now seen corresponding path program 1 times [2019-12-28 03:19:39,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:39,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048516095] [2019-12-28 03:19:39,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:39,877 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-28 03:19:39,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048516095] [2019-12-28 03:19:39,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:39,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:39,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [907388586] [2019-12-28 03:19:39,879 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:39,889 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:39,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:39,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:39,911 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:39,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:39,912 INFO L87 Difference]: Start difference. First operand 11723 states and 34576 transitions. Second operand 6 states. [2019-12-28 03:19:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:40,484 INFO L93 Difference]: Finished difference Result 12872 states and 37333 transitions. [2019-12-28 03:19:40,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:40,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 03:19:40,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:40,502 INFO L225 Difference]: With dead ends: 12872 [2019-12-28 03:19:40,502 INFO L226 Difference]: Without dead ends: 12872 [2019-12-28 03:19:40,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2019-12-28 03:19:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 12572. [2019-12-28 03:19:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12572 states. [2019-12-28 03:19:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12572 states to 12572 states and 36575 transitions. [2019-12-28 03:19:40,662 INFO L78 Accepts]: Start accepts. Automaton has 12572 states and 36575 transitions. Word has length 66 [2019-12-28 03:19:40,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:40,662 INFO L462 AbstractCegarLoop]: Abstraction has 12572 states and 36575 transitions. [2019-12-28 03:19:40,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 12572 states and 36575 transitions. [2019-12-28 03:19:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:40,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:40,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:40,670 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:40,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:40,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1608854846, now seen corresponding path program 1 times [2019-12-28 03:19:40,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:40,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224617198] [2019-12-28 03:19:40,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:40,794 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-28 03:19:40,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224617198] [2019-12-28 03:19:40,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:40,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:40,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577746235] [2019-12-28 03:19:40,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:40,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:40,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:40,819 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:40,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:40,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:40,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:40,821 INFO L87 Difference]: Start difference. First operand 12572 states and 36575 transitions. Second operand 6 states. [2019-12-28 03:19:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:41,287 INFO L93 Difference]: Finished difference Result 14461 states and 40823 transitions. [2019-12-28 03:19:41,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:19:41,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-28 03:19:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:41,309 INFO L225 Difference]: With dead ends: 14461 [2019-12-28 03:19:41,310 INFO L226 Difference]: Without dead ends: 14461 [2019-12-28 03:19:41,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:19:41,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14461 states. [2019-12-28 03:19:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14461 to 13135. [2019-12-28 03:19:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13135 states. [2019-12-28 03:19:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13135 states to 13135 states and 37544 transitions. [2019-12-28 03:19:41,589 INFO L78 Accepts]: Start accepts. Automaton has 13135 states and 37544 transitions. Word has length 66 [2019-12-28 03:19:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:41,589 INFO L462 AbstractCegarLoop]: Abstraction has 13135 states and 37544 transitions. [2019-12-28 03:19:41,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states and 37544 transitions. [2019-12-28 03:19:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:41,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:41,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:41,597 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash -468354497, now seen corresponding path program 1 times [2019-12-28 03:19:41,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:41,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712027153] [2019-12-28 03:19:41,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:41,669 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-28 03:19:41,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712027153] [2019-12-28 03:19:41,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:41,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:41,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [556289515] [2019-12-28 03:19:41,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:41,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:41,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:41,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:41,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:41,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:41,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:41,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:41,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:41,701 INFO L87 Difference]: Start difference. First operand 13135 states and 37544 transitions. Second operand 5 states. [2019-12-28 03:19:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:42,091 INFO L93 Difference]: Finished difference Result 16961 states and 48256 transitions. [2019-12-28 03:19:42,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:19:42,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 03:19:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:42,114 INFO L225 Difference]: With dead ends: 16961 [2019-12-28 03:19:42,114 INFO L226 Difference]: Without dead ends: 16961 [2019-12-28 03:19:42,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16961 states. [2019-12-28 03:19:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16961 to 15665. [2019-12-28 03:19:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15665 states. [2019-12-28 03:19:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15665 states to 15665 states and 44441 transitions. [2019-12-28 03:19:42,325 INFO L78 Accepts]: Start accepts. Automaton has 15665 states and 44441 transitions. Word has length 66 [2019-12-28 03:19:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:42,325 INFO L462 AbstractCegarLoop]: Abstraction has 15665 states and 44441 transitions. [2019-12-28 03:19:42,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 15665 states and 44441 transitions. [2019-12-28 03:19:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:42,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:42,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:42,335 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -978888674, now seen corresponding path program 1 times [2019-12-28 03:19:42,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:42,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070340154] [2019-12-28 03:19:42,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:42,409 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-28 03:19:42,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070340154] [2019-12-28 03:19:42,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:42,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:42,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [927604499] [2019-12-28 03:19:42,411 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:42,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:42,440 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:42,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:42,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:42,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:42,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:42,442 INFO L87 Difference]: Start difference. First operand 15665 states and 44441 transitions. Second operand 4 states. [2019-12-28 03:19:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:43,024 INFO L93 Difference]: Finished difference Result 19289 states and 54888 transitions. [2019-12-28 03:19:43,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:43,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 03:19:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:43,051 INFO L225 Difference]: With dead ends: 19289 [2019-12-28 03:19:43,051 INFO L226 Difference]: Without dead ends: 19112 [2019-12-28 03:19:43,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19112 states. [2019-12-28 03:19:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19112 to 18239. [2019-12-28 03:19:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18239 states. [2019-12-28 03:19:43,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18239 states to 18239 states and 51794 transitions. [2019-12-28 03:19:43,297 INFO L78 Accepts]: Start accepts. Automaton has 18239 states and 51794 transitions. Word has length 66 [2019-12-28 03:19:43,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:43,297 INFO L462 AbstractCegarLoop]: Abstraction has 18239 states and 51794 transitions. [2019-12-28 03:19:43,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:43,298 INFO L276 IsEmpty]: Start isEmpty. Operand 18239 states and 51794 transitions. [2019-12-28 03:19:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:43,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:43,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:43,305 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127263, now seen corresponding path program 1 times [2019-12-28 03:19:43,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:43,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229298743] [2019-12-28 03:19:43,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:43,398 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-28 03:19:43,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229298743] [2019-12-28 03:19:43,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:43,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:43,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [243396131] [2019-12-28 03:19:43,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:43,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:43,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:43,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:43,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:43,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:43,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:43,435 INFO L87 Difference]: Start difference. First operand 18239 states and 51794 transitions. Second operand 5 states. [2019-12-28 03:19:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:43,534 INFO L93 Difference]: Finished difference Result 17360 states and 47983 transitions. [2019-12-28 03:19:43,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:43,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 03:19:43,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:43,556 INFO L225 Difference]: With dead ends: 17360 [2019-12-28 03:19:43,557 INFO L226 Difference]: Without dead ends: 17360 [2019-12-28 03:19:43,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17360 states. [2019-12-28 03:19:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17360 to 14709. [2019-12-28 03:19:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14709 states. [2019-12-28 03:19:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14709 states to 14709 states and 40517 transitions. [2019-12-28 03:19:43,905 INFO L78 Accepts]: Start accepts. Automaton has 14709 states and 40517 transitions. Word has length 66 [2019-12-28 03:19:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:43,906 INFO L462 AbstractCegarLoop]: Abstraction has 14709 states and 40517 transitions. [2019-12-28 03:19:43,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 14709 states and 40517 transitions. [2019-12-28 03:19:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:43,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:43,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:43,912 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1888336352, now seen corresponding path program 1 times [2019-12-28 03:19:43,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:43,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602445031] [2019-12-28 03:19:43,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:43,991 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-28 03:19:43,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602445031] [2019-12-28 03:19:43,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:43,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:43,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643753944] [2019-12-28 03:19:43,992 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:44,002 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:44,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 03:19:44,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:44,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:44,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:44,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:44,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:44,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:44,029 INFO L87 Difference]: Start difference. First operand 14709 states and 40517 transitions. Second operand 5 states. [2019-12-28 03:19:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:44,108 INFO L93 Difference]: Finished difference Result 5310 states and 12561 transitions. [2019-12-28 03:19:44,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:19:44,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-28 03:19:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:44,118 INFO L225 Difference]: With dead ends: 5310 [2019-12-28 03:19:44,119 INFO L226 Difference]: Without dead ends: 4638 [2019-12-28 03:19:44,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:44,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2019-12-28 03:19:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4536. [2019-12-28 03:19:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4536 states. [2019-12-28 03:19:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 10379 transitions. [2019-12-28 03:19:44,207 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 10379 transitions. Word has length 66 [2019-12-28 03:19:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:44,207 INFO L462 AbstractCegarLoop]: Abstraction has 4536 states and 10379 transitions. [2019-12-28 03:19:44,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 10379 transitions. [2019-12-28 03:19:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:19:44,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:44,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:44,216 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:44,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1090796306, now seen corresponding path program 1 times [2019-12-28 03:19:44,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:44,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82869538] [2019-12-28 03:19:44,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:44,272 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-28 03:19:44,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82869538] [2019-12-28 03:19:44,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:44,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:19:44,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1337248942] [2019-12-28 03:19:44,274 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:44,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:44,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 03:19:44,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:44,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:44,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:19:44,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:44,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:19:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:19:44,313 INFO L87 Difference]: Start difference. First operand 4536 states and 10379 transitions. Second operand 3 states. [2019-12-28 03:19:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:44,368 INFO L93 Difference]: Finished difference Result 5477 states and 12304 transitions. [2019-12-28 03:19:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:19:44,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-28 03:19:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:44,379 INFO L225 Difference]: With dead ends: 5477 [2019-12-28 03:19:44,379 INFO L226 Difference]: Without dead ends: 5477 [2019-12-28 03:19:44,379 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-28 03:19:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2019-12-28 03:19:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 4471. [2019-12-28 03:19:44,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-12-28 03:19:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 9941 transitions. [2019-12-28 03:19:44,474 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 9941 transitions. Word has length 66 [2019-12-28 03:19:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:44,475 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 9941 transitions. [2019-12-28 03:19:44,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:19:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 9941 transitions. [2019-12-28 03:19:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-28 03:19:44,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:44,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:44,482 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2889151, now seen corresponding path program 1 times [2019-12-28 03:19:44,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:44,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283215418] [2019-12-28 03:19:44,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:44,565 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-28 03:19:44,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283215418] [2019-12-28 03:19:44,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:44,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:44,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [914456076] [2019-12-28 03:19:44,567 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:44,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:44,604 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 72 transitions. [2019-12-28 03:19:44,604 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:44,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:44,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:44,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:44,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:44,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:44,606 INFO L87 Difference]: Start difference. First operand 4471 states and 9941 transitions. Second operand 5 states. [2019-12-28 03:19:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:44,792 INFO L93 Difference]: Finished difference Result 5528 states and 12358 transitions. [2019-12-28 03:19:44,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:19:44,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-28 03:19:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:44,800 INFO L225 Difference]: With dead ends: 5528 [2019-12-28 03:19:44,800 INFO L226 Difference]: Without dead ends: 5528 [2019-12-28 03:19:44,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:19:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2019-12-28 03:19:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 4891. [2019-12-28 03:19:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4891 states. [2019-12-28 03:19:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 10899 transitions. [2019-12-28 03:19:44,885 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 10899 transitions. Word has length 72 [2019-12-28 03:19:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:44,885 INFO L462 AbstractCegarLoop]: Abstraction has 4891 states and 10899 transitions. [2019-12-28 03:19:44,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 10899 transitions. [2019-12-28 03:19:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-28 03:19:44,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:44,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:19:44,892 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:44,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1739921184, now seen corresponding path program 1 times [2019-12-28 03:19:44,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:44,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743416981] [2019-12-28 03:19:44,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:44,956 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-28 03:19:44,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743416981] [2019-12-28 03:19:44,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:44,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:19:44,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932669980] [2019-12-28 03:19:44,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:44,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:44,991 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 72 transitions. [2019-12-28 03:19:44,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:44,992 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:44,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:19:44,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:44,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:19:44,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:44,993 INFO L87 Difference]: Start difference. First operand 4891 states and 10899 transitions. Second operand 7 states. [2019-12-28 03:19:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:45,477 INFO L93 Difference]: Finished difference Result 5664 states and 12503 transitions. [2019-12-28 03:19:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:19:45,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-28 03:19:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:45,485 INFO L225 Difference]: With dead ends: 5664 [2019-12-28 03:19:45,485 INFO L226 Difference]: Without dead ends: 5611 [2019-12-28 03:19:45,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:19:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5611 states. [2019-12-28 03:19:45,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5611 to 4978. [2019-12-28 03:19:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4978 states. [2019-12-28 03:19:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 10988 transitions. [2019-12-28 03:19:45,536 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 10988 transitions. Word has length 72 [2019-12-28 03:19:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:45,536 INFO L462 AbstractCegarLoop]: Abstraction has 4978 states and 10988 transitions. [2019-12-28 03:19:45,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:19:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 10988 transitions. [2019-12-28 03:19:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 03:19:45,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:45,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:45,541 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:45,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:45,541 INFO L82 PathProgramCache]: Analyzing trace with hash 984950180, now seen corresponding path program 1 times [2019-12-28 03:19:45,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:45,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196865416] [2019-12-28 03:19:45,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:45,606 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-28 03:19:45,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196865416] [2019-12-28 03:19:45,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:45,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:45,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1534140200] [2019-12-28 03:19:45,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:45,637 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:45,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 213 transitions. [2019-12-28 03:19:45,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:45,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:45,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:45,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:45,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:45,717 INFO L87 Difference]: Start difference. First operand 4978 states and 10988 transitions. Second operand 5 states. [2019-12-28 03:19:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:46,031 INFO L93 Difference]: Finished difference Result 5853 states and 12861 transitions. [2019-12-28 03:19:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:46,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-28 03:19:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:46,039 INFO L225 Difference]: With dead ends: 5853 [2019-12-28 03:19:46,040 INFO L226 Difference]: Without dead ends: 5853 [2019-12-28 03:19:46,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2019-12-28 03:19:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5100. [2019-12-28 03:19:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5100 states. [2019-12-28 03:19:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5100 states to 5100 states and 11254 transitions. [2019-12-28 03:19:46,093 INFO L78 Accepts]: Start accepts. Automaton has 5100 states and 11254 transitions. Word has length 93 [2019-12-28 03:19:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:46,093 INFO L462 AbstractCegarLoop]: Abstraction has 5100 states and 11254 transitions. [2019-12-28 03:19:46,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5100 states and 11254 transitions. [2019-12-28 03:19:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 03:19:46,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:46,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:46,099 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1723297044, now seen corresponding path program 1 times [2019-12-28 03:19:46,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:46,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165975394] [2019-12-28 03:19:46,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:46,164 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-28 03:19:46,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165975394] [2019-12-28 03:19:46,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:46,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:46,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1262686648] [2019-12-28 03:19:46,165 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:46,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:46,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 176 transitions. [2019-12-28 03:19:46,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:46,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:46,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:46,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:46,256 INFO L87 Difference]: Start difference. First operand 5100 states and 11254 transitions. Second operand 4 states. [2019-12-28 03:19:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:46,348 INFO L93 Difference]: Finished difference Result 6027 states and 13222 transitions. [2019-12-28 03:19:46,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:19:46,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-28 03:19:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:46,354 INFO L225 Difference]: With dead ends: 6027 [2019-12-28 03:19:46,354 INFO L226 Difference]: Without dead ends: 6027 [2019-12-28 03:19:46,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2019-12-28 03:19:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 5294. [2019-12-28 03:19:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5294 states. [2019-12-28 03:19:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 11660 transitions. [2019-12-28 03:19:46,409 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 11660 transitions. Word has length 93 [2019-12-28 03:19:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:46,409 INFO L462 AbstractCegarLoop]: Abstraction has 5294 states and 11660 transitions. [2019-12-28 03:19:46,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 11660 transitions. [2019-12-28 03:19:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:46,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:46,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:46,416 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1904590348, now seen corresponding path program 1 times [2019-12-28 03:19:46,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:46,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420339268] [2019-12-28 03:19:46,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:46,482 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-28 03:19:46,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420339268] [2019-12-28 03:19:46,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:46,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:19:46,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980764226] [2019-12-28 03:19:46,483 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:46,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:46,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 219 transitions. [2019-12-28 03:19:46,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:46,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:19:46,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:19:46,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:46,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:19:46,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:46,699 INFO L87 Difference]: Start difference. First operand 5294 states and 11660 transitions. Second operand 5 states. [2019-12-28 03:19:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:46,819 INFO L93 Difference]: Finished difference Result 5703 states and 12543 transitions. [2019-12-28 03:19:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:19:46,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-28 03:19:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:46,841 INFO L225 Difference]: With dead ends: 5703 [2019-12-28 03:19:46,841 INFO L226 Difference]: Without dead ends: 5703 [2019-12-28 03:19:46,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-12-28 03:19:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 4394. [2019-12-28 03:19:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4394 states. [2019-12-28 03:19:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4394 states to 4394 states and 9662 transitions. [2019-12-28 03:19:46,941 INFO L78 Accepts]: Start accepts. Automaton has 4394 states and 9662 transitions. Word has length 95 [2019-12-28 03:19:46,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:46,942 INFO L462 AbstractCegarLoop]: Abstraction has 4394 states and 9662 transitions. [2019-12-28 03:19:46,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:19:46,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4394 states and 9662 transitions. [2019-12-28 03:19:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:46,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:46,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:46,950 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1915906475, now seen corresponding path program 1 times [2019-12-28 03:19:46,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:46,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191775325] [2019-12-28 03:19:46,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:47,051 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-28 03:19:47,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191775325] [2019-12-28 03:19:47,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:47,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:47,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557453260] [2019-12-28 03:19:47,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:47,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:47,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 219 transitions. [2019-12-28 03:19:47,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:47,171 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:47,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:19:47,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:19:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:19:47,173 INFO L87 Difference]: Start difference. First operand 4394 states and 9662 transitions. Second operand 6 states. [2019-12-28 03:19:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:47,398 INFO L93 Difference]: Finished difference Result 4573 states and 10026 transitions. [2019-12-28 03:19:47,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:19:47,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 03:19:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:47,404 INFO L225 Difference]: With dead ends: 4573 [2019-12-28 03:19:47,404 INFO L226 Difference]: Without dead ends: 4573 [2019-12-28 03:19:47,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:19:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2019-12-28 03:19:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4299. [2019-12-28 03:19:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-12-28 03:19:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 9454 transitions. [2019-12-28 03:19:47,475 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 9454 transitions. Word has length 95 [2019-12-28 03:19:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:47,475 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 9454 transitions. [2019-12-28 03:19:47,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:19:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 9454 transitions. [2019-12-28 03:19:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:47,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:47,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:47,483 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 958249678, now seen corresponding path program 1 times [2019-12-28 03:19:47,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:47,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723759591] [2019-12-28 03:19:47,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:47,557 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-28 03:19:47,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723759591] [2019-12-28 03:19:47,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:47,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:19:47,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898086303] [2019-12-28 03:19:47,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:47,582 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:47,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:47,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:47,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:19:47,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:19:47,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:19:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:19:47,694 INFO L87 Difference]: Start difference. First operand 4299 states and 9454 transitions. Second operand 4 states. [2019-12-28 03:19:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:47,923 INFO L93 Difference]: Finished difference Result 5486 states and 12027 transitions. [2019-12-28 03:19:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:19:47,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-28 03:19:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:47,930 INFO L225 Difference]: With dead ends: 5486 [2019-12-28 03:19:47,931 INFO L226 Difference]: Without dead ends: 5446 [2019-12-28 03:19:47,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:19:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states. [2019-12-28 03:19:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 5157. [2019-12-28 03:19:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5157 states. [2019-12-28 03:19:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5157 states to 5157 states and 11315 transitions. [2019-12-28 03:19:47,983 INFO L78 Accepts]: Start accepts. Automaton has 5157 states and 11315 transitions. Word has length 95 [2019-12-28 03:19:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:47,983 INFO L462 AbstractCegarLoop]: Abstraction has 5157 states and 11315 transitions. [2019-12-28 03:19:47,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:19:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5157 states and 11315 transitions. [2019-12-28 03:19:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:47,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:47,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:47,990 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:47,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1118959665, now seen corresponding path program 1 times [2019-12-28 03:19:47,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:47,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911587733] [2019-12-28 03:19:47,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:48,137 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-28 03:19:48,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911587733] [2019-12-28 03:19:48,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:48,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:19:48,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004460845] [2019-12-28 03:19:48,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:48,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:48,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:48,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:48,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 03:19:48,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:19:48,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:19:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:19:48,325 INFO L87 Difference]: Start difference. First operand 5157 states and 11315 transitions. Second operand 11 states. [2019-12-28 03:19:49,513 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-12-28 03:19:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:50,453 INFO L93 Difference]: Finished difference Result 7391 states and 16086 transitions. [2019-12-28 03:19:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-28 03:19:50,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-28 03:19:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:50,467 INFO L225 Difference]: With dead ends: 7391 [2019-12-28 03:19:50,468 INFO L226 Difference]: Without dead ends: 7391 [2019-12-28 03:19:50,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-12-28 03:19:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2019-12-28 03:19:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 5596. [2019-12-28 03:19:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5596 states. [2019-12-28 03:19:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 12221 transitions. [2019-12-28 03:19:50,611 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 12221 transitions. Word has length 95 [2019-12-28 03:19:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:50,612 INFO L462 AbstractCegarLoop]: Abstraction has 5596 states and 12221 transitions. [2019-12-28 03:19:50,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:19:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 12221 transitions. [2019-12-28 03:19:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:50,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:50,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:50,622 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:50,623 INFO L82 PathProgramCache]: Analyzing trace with hash -907608752, now seen corresponding path program 1 times [2019-12-28 03:19:50,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:50,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257895002] [2019-12-28 03:19:50,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:50,838 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-28 03:19:50,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257895002] [2019-12-28 03:19:50,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:50,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:19:50,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097299229] [2019-12-28 03:19:50,839 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:50,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:51,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 311 transitions. [2019-12-28 03:19:51,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:51,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:19:51,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 03:19:51,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:51,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 03:19:51,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:19:51,149 INFO L87 Difference]: Start difference. First operand 5596 states and 12221 transitions. Second operand 12 states. [2019-12-28 03:19:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:53,862 INFO L93 Difference]: Finished difference Result 19757 states and 43693 transitions. [2019-12-28 03:19:53,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-28 03:19:53,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-12-28 03:19:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:53,878 INFO L225 Difference]: With dead ends: 19757 [2019-12-28 03:19:53,878 INFO L226 Difference]: Without dead ends: 12343 [2019-12-28 03:19:53,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2019-12-28 03:19:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12343 states. [2019-12-28 03:19:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12343 to 5570. [2019-12-28 03:19:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5570 states. [2019-12-28 03:19:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 12102 transitions. [2019-12-28 03:19:53,974 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 12102 transitions. Word has length 95 [2019-12-28 03:19:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:53,974 INFO L462 AbstractCegarLoop]: Abstraction has 5570 states and 12102 transitions. [2019-12-28 03:19:53,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 03:19:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 12102 transitions. [2019-12-28 03:19:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:53,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:53,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:53,979 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1011747509, now seen corresponding path program 1 times [2019-12-28 03:19:53,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:53,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596739105] [2019-12-28 03:19:53,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:54,051 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-28 03:19:54,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596739105] [2019-12-28 03:19:54,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:54,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:19:54,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2100188781] [2019-12-28 03:19:54,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:54,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:54,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 199 transitions. [2019-12-28 03:19:54,169 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:54,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:19:54,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:19:54,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:19:54,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:54,204 INFO L87 Difference]: Start difference. First operand 5570 states and 12102 transitions. Second operand 7 states. [2019-12-28 03:19:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:55,027 INFO L93 Difference]: Finished difference Result 7434 states and 16035 transitions. [2019-12-28 03:19:55,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 03:19:55,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-28 03:19:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:55,036 INFO L225 Difference]: With dead ends: 7434 [2019-12-28 03:19:55,036 INFO L226 Difference]: Without dead ends: 7385 [2019-12-28 03:19:55,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:19:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7385 states. [2019-12-28 03:19:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7385 to 5261. [2019-12-28 03:19:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5261 states. [2019-12-28 03:19:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 11470 transitions. [2019-12-28 03:19:55,097 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 11470 transitions. Word has length 95 [2019-12-28 03:19:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:55,098 INFO L462 AbstractCegarLoop]: Abstraction has 5261 states and 11470 transitions. [2019-12-28 03:19:55,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:19:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 11470 transitions. [2019-12-28 03:19:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:55,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:55,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:55,103 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 444367885, now seen corresponding path program 1 times [2019-12-28 03:19:55,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:55,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938497025] [2019-12-28 03:19:55,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:19:55,209 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-28 03:19:55,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938497025] [2019-12-28 03:19:55,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:19:55,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:19:55,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1466760008] [2019-12-28 03:19:55,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:19:55,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:19:55,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 199 transitions. [2019-12-28 03:19:55,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:19:55,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:19:55,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:19:55,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:19:55,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:19:55,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:19:55,387 INFO L87 Difference]: Start difference. First operand 5261 states and 11470 transitions. Second operand 7 states. [2019-12-28 03:19:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:19:55,797 INFO L93 Difference]: Finished difference Result 5611 states and 12174 transitions. [2019-12-28 03:19:55,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:19:55,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-28 03:19:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:19:55,804 INFO L225 Difference]: With dead ends: 5611 [2019-12-28 03:19:55,804 INFO L226 Difference]: Without dead ends: 5611 [2019-12-28 03:19:55,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:19:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5611 states. [2019-12-28 03:19:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5611 to 5193. [2019-12-28 03:19:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2019-12-28 03:19:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 11309 transitions. [2019-12-28 03:19:55,880 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 11309 transitions. Word has length 95 [2019-12-28 03:19:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:19:55,881 INFO L462 AbstractCegarLoop]: Abstraction has 5193 states and 11309 transitions. [2019-12-28 03:19:55,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:19:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 11309 transitions. [2019-12-28 03:19:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 03:19:55,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:19:55,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:19:55,888 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:19:55,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:19:55,888 INFO L82 PathProgramCache]: Analyzing trace with hash -4328754, now seen corresponding path program 2 times [2019-12-28 03:19:55,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:19:55,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245702567] [2019-12-28 03:19:55,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:19:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:19:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:19:56,014 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:19:56,014 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:19:56,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:19:56 BasicIcfg [2019-12-28 03:19:56,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:19:56,201 INFO L168 Benchmark]: Toolchain (without parser) took 58352.84 ms. Allocated memory was 145.8 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 959.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:56,201 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 03:19:56,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.14 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 158.9 MB in the end (delta: -58.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:56,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.07 ms. Allocated memory is still 203.9 MB. Free memory was 158.9 MB in the beginning and 156.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:56,203 INFO L168 Benchmark]: Boogie Preprocessor took 36.10 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:56,204 INFO L168 Benchmark]: RCFGBuilder took 802.31 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 109.7 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:56,204 INFO L168 Benchmark]: TraceAbstraction took 56650.40 ms. Allocated memory was 203.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 109.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 910.5 MB. Max. memory is 7.1 GB. [2019-12-28 03:19:56,207 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 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.14 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.5 MB in the beginning and 158.9 MB in the end (delta: -58.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.07 ms. Allocated memory is still 203.9 MB. Free memory was 158.9 MB in the beginning and 156.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.10 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.31 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 109.7 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56650.40 ms. Allocated memory was 203.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 109.7 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 910.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1445; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1446; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 56.2s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8703 SDtfs, 9403 SDslu, 20688 SDs, 0 SdLazy, 9600 SolverSat, 473 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 105 SyntacticMatches, 26 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 88289 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2224 NumberOfCodeBlocks, 2224 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2098 ConstructedInterpolants, 0 QuantifiedInterpolants, 353648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...