/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/mix012_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 00:37:20,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 00:37:20,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 00:37:20,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 00:37:20,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 00:37:20,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 00:37:20,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 00:37:20,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 00:37:20,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 00:37:20,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 00:37:20,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 00:37:20,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 00:37:20,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 00:37:20,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 00:37:20,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 00:37:20,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 00:37:20,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 00:37:20,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 00:37:20,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 00:37:20,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 00:37:20,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 00:37:20,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 00:37:20,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 00:37:20,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 00:37:20,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 00:37:20,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 00:37:20,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 00:37:20,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 00:37:20,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 00:37:20,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 00:37:20,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 00:37:20,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 00:37:20,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 00:37:20,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 00:37:20,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 00:37:20,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 00:37:20,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 00:37:20,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 00:37:20,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 00:37:20,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 00:37:20,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 00:37:20,648 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 00:37:20,668 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 00:37:20,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 00:37:20,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 00:37:20,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 00:37:20,671 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 00:37:20,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 00:37:20,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 00:37:20,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 00:37:20,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 00:37:20,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 00:37:20,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 00:37:20,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 00:37:20,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 00:37:20,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 00:37:20,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 00:37:20,674 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 00:37:20,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 00:37:20,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 00:37:20,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 00:37:20,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 00:37:20,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 00:37:20,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 00:37:20,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 00:37:20,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 00:37:20,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 00:37:20,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 00:37:20,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 00:37:20,677 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 00:37:20,677 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 00:37:20,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 00:37:20,678 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 00:37:20,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 00:37:20,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 00:37:20,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 00:37:20,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 00:37:20,961 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 00:37:20,962 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 00:37:20,962 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_tso.oepc.i [2019-12-28 00:37:21,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e793251a6/7e30cbfcb61243c48cc9f8de8d355a1e/FLAG9839a2b56 [2019-12-28 00:37:21,619 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 00:37:21,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_tso.oepc.i [2019-12-28 00:37:21,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e793251a6/7e30cbfcb61243c48cc9f8de8d355a1e/FLAG9839a2b56 [2019-12-28 00:37:21,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e793251a6/7e30cbfcb61243c48cc9f8de8d355a1e [2019-12-28 00:37:21,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 00:37:21,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 00:37:21,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 00:37:21,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 00:37:21,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 00:37:21,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:37:21" (1/1) ... [2019-12-28 00:37:21,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24328a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:21, skipping insertion in model container [2019-12-28 00:37:21,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:37:21" (1/1) ... [2019-12-28 00:37:21,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 00:37:21,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 00:37:22,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:37:22,485 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 00:37:22,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 00:37:22,652 INFO L208 MainTranslator]: Completed translation [2019-12-28 00:37:22,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22 WrapperNode [2019-12-28 00:37:22,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 00:37:22,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 00:37:22,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 00:37:22,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 00:37:22,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 00:37:22,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 00:37:22,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 00:37:22,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 00:37:22,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (1/1) ... [2019-12-28 00:37:22,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 00:37:22,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 00:37:22,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 00:37:22,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 00:37:22,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (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 00:37:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 00:37:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 00:37:22,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 00:37:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 00:37:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 00:37:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 00:37:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 00:37:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 00:37:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 00:37:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 00:37:22,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 00:37:22,831 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 00:37:23,491 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 00:37:23,492 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 00:37:23,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:37:23 BoogieIcfgContainer [2019-12-28 00:37:23,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 00:37:23,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 00:37:23,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 00:37:23,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 00:37:23,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:37:21" (1/3) ... [2019-12-28 00:37:23,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d572183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:37:23, skipping insertion in model container [2019-12-28 00:37:23,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:37:22" (2/3) ... [2019-12-28 00:37:23,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d572183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:37:23, skipping insertion in model container [2019-12-28 00:37:23,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:37:23" (3/3) ... [2019-12-28 00:37:23,505 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_tso.oepc.i [2019-12-28 00:37:23,515 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 00:37:23,515 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 00:37:23,529 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 00:37:23,530 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 00:37:23,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,586 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,587 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,587 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,652 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,653 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,677 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 00:37:23,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 00:37:23,713 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 00:37:23,713 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 00:37:23,713 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 00:37:23,714 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 00:37:23,714 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 00:37:23,714 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 00:37:23,714 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 00:37:23,714 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 00:37:23,730 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-28 00:37:26,063 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-28 00:37:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-28 00:37:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-28 00:37:26,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:26,073 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] [2019-12-28 00:37:26,074 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:26,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1564572936, now seen corresponding path program 1 times [2019-12-28 00:37:26,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:26,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926167269] [2019-12-28 00:37:26,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:26,403 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 00:37:26,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926167269] [2019-12-28 00:37:26,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:26,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:37:26,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475900776] [2019-12-28 00:37:26,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:26,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:26,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 35 transitions. [2019-12-28 00:37:26,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:26,453 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:26,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:37:26,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:37:26,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:37:26,479 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-28 00:37:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:28,141 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-28 00:37:28,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:37:28,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-28 00:37:28,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:28,442 INFO L225 Difference]: With dead ends: 33592 [2019-12-28 00:37:28,442 INFO L226 Difference]: Without dead ends: 25704 [2019-12-28 00:37:28,444 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 00:37:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-28 00:37:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-28 00:37:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-28 00:37:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-28 00:37:30,208 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-28 00:37:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:30,209 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-28 00:37:30,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:37:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-28 00:37:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 00:37:30,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:30,223 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] [2019-12-28 00:37:30,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:30,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1980442200, now seen corresponding path program 1 times [2019-12-28 00:37:30,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:30,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63027252] [2019-12-28 00:37:30,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:30,396 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 00:37:30,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63027252] [2019-12-28 00:37:30,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:30,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:37:30,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1219720315] [2019-12-28 00:37:30,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:30,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:30,410 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 00:37:30,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:30,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:30,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:37:30,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:30,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:37:30,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:37:30,414 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-28 00:37:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:31,304 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-28 00:37:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:37:31,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-28 00:37:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:32,769 INFO L225 Difference]: With dead ends: 41082 [2019-12-28 00:37:32,769 INFO L226 Difference]: Without dead ends: 40546 [2019-12-28 00:37:32,770 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 00:37:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-28 00:37:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-28 00:37:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-28 00:37:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-28 00:37:34,232 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-28 00:37:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:34,234 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-28 00:37:34,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:37:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-28 00:37:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 00:37:34,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:34,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:34,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:34,244 INFO L82 PathProgramCache]: Analyzing trace with hash 645631914, now seen corresponding path program 1 times [2019-12-28 00:37:34,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:34,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796536698] [2019-12-28 00:37:34,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:34,365 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 00:37:34,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796536698] [2019-12-28 00:37:34,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:34,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:37:34,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1496297273] [2019-12-28 00:37:34,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:34,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:34,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 00:37:34,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:34,381 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:34,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:37:34,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:34,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:37:34,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:37:34,382 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-28 00:37:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:35,237 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-28 00:37:35,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:37:35,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 00:37:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:35,426 INFO L225 Difference]: With dead ends: 49779 [2019-12-28 00:37:35,426 INFO L226 Difference]: Without dead ends: 49275 [2019-12-28 00:37:35,426 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 00:37:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-28 00:37:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-28 00:37:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-28 00:37:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-28 00:37:38,181 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-28 00:37:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:38,182 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-28 00:37:38,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:37:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-28 00:37:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 00:37:38,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:38,191 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] [2019-12-28 00:37:38,191 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:38,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1346758064, now seen corresponding path program 1 times [2019-12-28 00:37:38,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:38,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836335153] [2019-12-28 00:37:38,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:38,247 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 00:37:38,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836335153] [2019-12-28 00:37:38,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:38,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:37:38,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [18810290] [2019-12-28 00:37:38,248 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:38,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:38,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 00:37:38,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:38,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:38,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:37:38,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:38,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:37:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:37:38,261 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-28 00:37:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:38,867 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-28 00:37:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:37:38,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-28 00:37:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:39,046 INFO L225 Difference]: With dead ends: 61088 [2019-12-28 00:37:39,047 INFO L226 Difference]: Without dead ends: 61088 [2019-12-28 00:37:39,047 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 00:37:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-28 00:37:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-28 00:37:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-28 00:37:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-28 00:37:42,170 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-28 00:37:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:42,170 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-28 00:37:42,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:37:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-28 00:37:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:37:42,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:42,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:42,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:42,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash 551995902, now seen corresponding path program 1 times [2019-12-28 00:37:42,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:42,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223362174] [2019-12-28 00:37:42,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:42,240 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 00:37:42,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223362174] [2019-12-28 00:37:42,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:42,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:37:42,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121335577] [2019-12-28 00:37:42,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:42,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:42,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 00:37:42,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:42,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:42,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:37:42,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:42,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:37:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:37:42,257 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 3 states. [2019-12-28 00:37:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:43,170 INFO L93 Difference]: Finished difference Result 53337 states and 193528 transitions. [2019-12-28 00:37:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:37:43,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-28 00:37:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:43,287 INFO L225 Difference]: With dead ends: 53337 [2019-12-28 00:37:43,287 INFO L226 Difference]: Without dead ends: 53337 [2019-12-28 00:37:43,288 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 00:37:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53337 states. [2019-12-28 00:37:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53337 to 50675. [2019-12-28 00:37:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50675 states. [2019-12-28 00:37:46,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50675 states to 50675 states and 183848 transitions. [2019-12-28 00:37:46,719 INFO L78 Accepts]: Start accepts. Automaton has 50675 states and 183848 transitions. Word has length 54 [2019-12-28 00:37:46,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:46,720 INFO L462 AbstractCegarLoop]: Abstraction has 50675 states and 183848 transitions. [2019-12-28 00:37:46,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:37:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50675 states and 183848 transitions. [2019-12-28 00:37:46,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:37:46,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:46,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:46,734 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:46,734 INFO L82 PathProgramCache]: Analyzing trace with hash -962055554, now seen corresponding path program 1 times [2019-12-28 00:37:46,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:46,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345707330] [2019-12-28 00:37:46,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:46,854 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 00:37:46,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345707330] [2019-12-28 00:37:46,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:46,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:37:46,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1895897035] [2019-12-28 00:37:46,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:46,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:46,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 00:37:46,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:46,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:46,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:37:46,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:46,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:37:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:37:46,871 INFO L87 Difference]: Start difference. First operand 50675 states and 183848 transitions. Second operand 6 states. [2019-12-28 00:37:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:47,742 INFO L93 Difference]: Finished difference Result 65267 states and 234906 transitions. [2019-12-28 00:37:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:37:47,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 00:37:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:47,880 INFO L225 Difference]: With dead ends: 65267 [2019-12-28 00:37:47,880 INFO L226 Difference]: Without dead ends: 65267 [2019-12-28 00:37:47,880 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 00:37:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65267 states. [2019-12-28 00:37:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65267 to 59950. [2019-12-28 00:37:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-28 00:37:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-28 00:37:49,338 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-28 00:37:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:49,338 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-28 00:37:49,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:37:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-28 00:37:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:37:49,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:49,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:49,353 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1535960383, now seen corresponding path program 1 times [2019-12-28 00:37:49,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:49,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406193015] [2019-12-28 00:37:49,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:49,477 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 00:37:49,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406193015] [2019-12-28 00:37:49,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:49,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:37:49,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983629745] [2019-12-28 00:37:49,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:49,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:49,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 00:37:49,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:49,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:49,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:37:49,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:37:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:37:49,495 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-12-28 00:37:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:51,306 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-12-28 00:37:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 00:37:51,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-28 00:37:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:51,491 INFO L225 Difference]: With dead ends: 83686 [2019-12-28 00:37:51,491 INFO L226 Difference]: Without dead ends: 83686 [2019-12-28 00:37:51,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:37:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-12-28 00:37:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-12-28 00:37:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-12-28 00:37:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-12-28 00:37:55,314 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-12-28 00:37:55,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:55,314 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-12-28 00:37:55,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:37:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-12-28 00:37:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:37:55,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:55,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:55,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:55,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1871503232, now seen corresponding path program 1 times [2019-12-28 00:37:55,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:55,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744219943] [2019-12-28 00:37:55,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:55,400 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 00:37:55,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744219943] [2019-12-28 00:37:55,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:55,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:37:55,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1807820154] [2019-12-28 00:37:55,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:55,406 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:55,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 66 transitions. [2019-12-28 00:37:55,412 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:55,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:37:55,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:37:55,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:55,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:37:55,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:37:55,454 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 4 states. [2019-12-28 00:37:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:55,527 INFO L93 Difference]: Finished difference Result 12160 states and 37830 transitions. [2019-12-28 00:37:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:37:55,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-28 00:37:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:55,557 INFO L225 Difference]: With dead ends: 12160 [2019-12-28 00:37:55,558 INFO L226 Difference]: Without dead ends: 10675 [2019-12-28 00:37:55,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 00:37:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10675 states. [2019-12-28 00:37:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10675 to 10626. [2019-12-28 00:37:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10626 states. [2019-12-28 00:37:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 32592 transitions. [2019-12-28 00:37:55,856 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 32592 transitions. Word has length 54 [2019-12-28 00:37:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:55,856 INFO L462 AbstractCegarLoop]: Abstraction has 10626 states and 32592 transitions. [2019-12-28 00:37:55,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:37:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 32592 transitions. [2019-12-28 00:37:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 00:37:55,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:55,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:55,861 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:55,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:55,861 INFO L82 PathProgramCache]: Analyzing trace with hash 683903899, now seen corresponding path program 1 times [2019-12-28 00:37:55,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:55,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136916720] [2019-12-28 00:37:55,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:55,946 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 00:37:55,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136916720] [2019-12-28 00:37:55,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:55,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:37:55,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [414161121] [2019-12-28 00:37:55,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:55,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:55,966 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 55 states and 54 transitions. [2019-12-28 00:37:55,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:55,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:55,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:37:55,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:55,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:37:55,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:37:55,967 INFO L87 Difference]: Start difference. First operand 10626 states and 32592 transitions. Second operand 6 states. [2019-12-28 00:37:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:56,441 INFO L93 Difference]: Finished difference Result 13183 states and 39873 transitions. [2019-12-28 00:37:56,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:37:56,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 00:37:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:56,468 INFO L225 Difference]: With dead ends: 13183 [2019-12-28 00:37:56,468 INFO L226 Difference]: Without dead ends: 13120 [2019-12-28 00:37:56,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-28 00:37:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-12-28 00:37:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 11049. [2019-12-28 00:37:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11049 states. [2019-12-28 00:37:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11049 states to 11049 states and 33786 transitions. [2019-12-28 00:37:57,154 INFO L78 Accepts]: Start accepts. Automaton has 11049 states and 33786 transitions. Word has length 54 [2019-12-28 00:37:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:57,155 INFO L462 AbstractCegarLoop]: Abstraction has 11049 states and 33786 transitions. [2019-12-28 00:37:57,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:37:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 11049 states and 33786 transitions. [2019-12-28 00:37:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 00:37:57,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:57,161 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] [2019-12-28 00:37:57,161 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:57,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1727879850, now seen corresponding path program 1 times [2019-12-28 00:37:57,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:57,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267139631] [2019-12-28 00:37:57,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:57,259 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 00:37:57,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267139631] [2019-12-28 00:37:57,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:57,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:37:57,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129998867] [2019-12-28 00:37:57,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:57,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:57,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 62 transitions. [2019-12-28 00:37:57,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:57,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:37:57,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:37:57,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:57,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:37:57,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:37:57,281 INFO L87 Difference]: Start difference. First operand 11049 states and 33786 transitions. Second operand 6 states. [2019-12-28 00:37:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:57,708 INFO L93 Difference]: Finished difference Result 13540 states and 40805 transitions. [2019-12-28 00:37:57,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 00:37:57,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 00:37:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:57,744 INFO L225 Difference]: With dead ends: 13540 [2019-12-28 00:37:57,744 INFO L226 Difference]: Without dead ends: 13479 [2019-12-28 00:37:57,744 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 00:37:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13479 states. [2019-12-28 00:37:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13479 to 12787. [2019-12-28 00:37:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12787 states. [2019-12-28 00:37:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12787 states to 12787 states and 38735 transitions. [2019-12-28 00:37:58,018 INFO L78 Accepts]: Start accepts. Automaton has 12787 states and 38735 transitions. Word has length 62 [2019-12-28 00:37:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:58,018 INFO L462 AbstractCegarLoop]: Abstraction has 12787 states and 38735 transitions. [2019-12-28 00:37:58,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:37:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 12787 states and 38735 transitions. [2019-12-28 00:37:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 00:37:58,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:58,028 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 00:37:58,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash -903159920, now seen corresponding path program 1 times [2019-12-28 00:37:58,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:58,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566255330] [2019-12-28 00:37:58,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:58,097 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 00:37:58,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566255330] [2019-12-28 00:37:58,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:58,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:37:58,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [603077532] [2019-12-28 00:37:58,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:58,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:58,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 00:37:58,131 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:58,219 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 00:37:58,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:37:58,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:58,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:37:58,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:37:58,221 INFO L87 Difference]: Start difference. First operand 12787 states and 38735 transitions. Second operand 7 states. [2019-12-28 00:37:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:58,610 INFO L93 Difference]: Finished difference Result 15674 states and 46880 transitions. [2019-12-28 00:37:58,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:37:58,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 00:37:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:58,632 INFO L225 Difference]: With dead ends: 15674 [2019-12-28 00:37:58,633 INFO L226 Difference]: Without dead ends: 15674 [2019-12-28 00:37:58,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:37:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15674 states. [2019-12-28 00:37:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15674 to 14153. [2019-12-28 00:37:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14153 states. [2019-12-28 00:37:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 42469 transitions. [2019-12-28 00:37:58,829 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 42469 transitions. Word has length 66 [2019-12-28 00:37:58,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:58,830 INFO L462 AbstractCegarLoop]: Abstraction has 14153 states and 42469 transitions. [2019-12-28 00:37:58,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:37:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 42469 transitions. [2019-12-28 00:37:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 00:37:58,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:58,837 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 00:37:58,838 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:58,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1314598033, now seen corresponding path program 1 times [2019-12-28 00:37:58,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:58,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258708886] [2019-12-28 00:37:58,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:58,900 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 00:37:58,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258708886] [2019-12-28 00:37:58,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:58,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:37:58,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1688249752] [2019-12-28 00:37:58,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:58,912 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:58,933 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 119 states and 170 transitions. [2019-12-28 00:37:58,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:37:58,944 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:37:58,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:37:58,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:37:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:37:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:37:58,945 INFO L87 Difference]: Start difference. First operand 14153 states and 42469 transitions. Second operand 4 states. [2019-12-28 00:37:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:37:59,232 INFO L93 Difference]: Finished difference Result 14686 states and 43876 transitions. [2019-12-28 00:37:59,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:37:59,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-28 00:37:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:37:59,253 INFO L225 Difference]: With dead ends: 14686 [2019-12-28 00:37:59,253 INFO L226 Difference]: Without dead ends: 14686 [2019-12-28 00:37:59,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 00:37:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14686 states. [2019-12-28 00:37:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14686 to 14437. [2019-12-28 00:37:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14437 states. [2019-12-28 00:37:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14437 states to 14437 states and 43213 transitions. [2019-12-28 00:37:59,434 INFO L78 Accepts]: Start accepts. Automaton has 14437 states and 43213 transitions. Word has length 66 [2019-12-28 00:37:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:37:59,434 INFO L462 AbstractCegarLoop]: Abstraction has 14437 states and 43213 transitions. [2019-12-28 00:37:59,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:37:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 14437 states and 43213 transitions. [2019-12-28 00:37:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:37:59,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:37:59,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 00:37:59,442 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:37:59,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:37:59,442 INFO L82 PathProgramCache]: Analyzing trace with hash 789260736, now seen corresponding path program 1 times [2019-12-28 00:37:59,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:37:59,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810174474] [2019-12-28 00:37:59,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:37:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:37:59,924 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 00:37:59,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810174474] [2019-12-28 00:37:59,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:37:59,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:37:59,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2035881776] [2019-12-28 00:37:59,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:37:59,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:37:59,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:37:59,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:00,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:38:00,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:38:00,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:38:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:38:00,041 INFO L87 Difference]: Start difference. First operand 14437 states and 43213 transitions. Second operand 8 states. [2019-12-28 00:38:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:00,813 INFO L93 Difference]: Finished difference Result 15429 states and 45576 transitions. [2019-12-28 00:38:00,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:38:00,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-28 00:38:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:00,836 INFO L225 Difference]: With dead ends: 15429 [2019-12-28 00:38:00,836 INFO L226 Difference]: Without dead ends: 15429 [2019-12-28 00:38:00,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:38:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-12-28 00:38:01,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 15010. [2019-12-28 00:38:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15010 states. [2019-12-28 00:38:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15010 states to 15010 states and 44510 transitions. [2019-12-28 00:38:01,030 INFO L78 Accepts]: Start accepts. Automaton has 15010 states and 44510 transitions. Word has length 68 [2019-12-28 00:38:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:01,030 INFO L462 AbstractCegarLoop]: Abstraction has 15010 states and 44510 transitions. [2019-12-28 00:38:01,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:38:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15010 states and 44510 transitions. [2019-12-28 00:38:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:38:01,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:01,038 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] [2019-12-28 00:38:01,038 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:01,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:01,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1287948607, now seen corresponding path program 1 times [2019-12-28 00:38:01,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:01,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992937546] [2019-12-28 00:38:01,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:01,128 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 00:38:01,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992937546] [2019-12-28 00:38:01,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:01,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:38:01,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1998898858] [2019-12-28 00:38:01,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:01,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:01,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:38:01,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:01,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:38:01,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:38:01,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:38:01,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:38:01,219 INFO L87 Difference]: Start difference. First operand 15010 states and 44510 transitions. Second operand 8 states. [2019-12-28 00:38:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:01,814 INFO L93 Difference]: Finished difference Result 17281 states and 49779 transitions. [2019-12-28 00:38:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:38:01,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-28 00:38:01,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:01,838 INFO L225 Difference]: With dead ends: 17281 [2019-12-28 00:38:01,838 INFO L226 Difference]: Without dead ends: 17281 [2019-12-28 00:38:01,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:38:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17281 states. [2019-12-28 00:38:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17281 to 15702. [2019-12-28 00:38:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15702 states. [2019-12-28 00:38:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15702 states to 15702 states and 45760 transitions. [2019-12-28 00:38:02,039 INFO L78 Accepts]: Start accepts. Automaton has 15702 states and 45760 transitions. Word has length 68 [2019-12-28 00:38:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:02,039 INFO L462 AbstractCegarLoop]: Abstraction has 15702 states and 45760 transitions. [2019-12-28 00:38:02,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:38:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 15702 states and 45760 transitions. [2019-12-28 00:38:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:38:02,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:02,048 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] [2019-12-28 00:38:02,048 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1076597694, now seen corresponding path program 1 times [2019-12-28 00:38:02,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:02,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107548379] [2019-12-28 00:38:02,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:02,118 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 00:38:02,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107548379] [2019-12-28 00:38:02,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:02,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:38:02,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1696033029] [2019-12-28 00:38:02,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:02,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:02,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:38:02,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:02,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:38:02,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:38:02,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:02,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:38:02,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:38:02,197 INFO L87 Difference]: Start difference. First operand 15702 states and 45760 transitions. Second operand 6 states. [2019-12-28 00:38:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:02,631 INFO L93 Difference]: Finished difference Result 20231 states and 58824 transitions. [2019-12-28 00:38:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:38:02,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 00:38:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:02,660 INFO L225 Difference]: With dead ends: 20231 [2019-12-28 00:38:02,661 INFO L226 Difference]: Without dead ends: 20231 [2019-12-28 00:38:02,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:38:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20231 states. [2019-12-28 00:38:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20231 to 18521. [2019-12-28 00:38:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18521 states. [2019-12-28 00:38:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18521 states to 18521 states and 53710 transitions. [2019-12-28 00:38:03,305 INFO L78 Accepts]: Start accepts. Automaton has 18521 states and 53710 transitions. Word has length 68 [2019-12-28 00:38:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:03,305 INFO L462 AbstractCegarLoop]: Abstraction has 18521 states and 53710 transitions. [2019-12-28 00:38:03,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:38:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18521 states and 53710 transitions. [2019-12-28 00:38:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:38:03,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:03,316 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] [2019-12-28 00:38:03,316 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:03,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:03,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1587131871, now seen corresponding path program 1 times [2019-12-28 00:38:03,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:03,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165152061] [2019-12-28 00:38:03,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:03,386 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 00:38:03,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165152061] [2019-12-28 00:38:03,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:03,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:38:03,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40662678] [2019-12-28 00:38:03,388 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:03,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:03,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:38:03,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:03,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 00:38:03,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:38:03,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:03,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:38:03,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:38:03,462 INFO L87 Difference]: Start difference. First operand 18521 states and 53710 transitions. Second operand 7 states. [2019-12-28 00:38:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:04,107 INFO L93 Difference]: Finished difference Result 25228 states and 72837 transitions. [2019-12-28 00:38:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 00:38:04,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-28 00:38:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:04,146 INFO L225 Difference]: With dead ends: 25228 [2019-12-28 00:38:04,146 INFO L226 Difference]: Without dead ends: 25228 [2019-12-28 00:38:04,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:38:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25228 states. [2019-12-28 00:38:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25228 to 20409. [2019-12-28 00:38:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20409 states. [2019-12-28 00:38:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20409 states to 20409 states and 58984 transitions. [2019-12-28 00:38:04,434 INFO L78 Accepts]: Start accepts. Automaton has 20409 states and 58984 transitions. Word has length 68 [2019-12-28 00:38:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:04,434 INFO L462 AbstractCegarLoop]: Abstraction has 20409 states and 58984 transitions. [2019-12-28 00:38:04,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:38:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 20409 states and 58984 transitions. [2019-12-28 00:38:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:38:04,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:04,443 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] [2019-12-28 00:38:04,443 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:04,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 900380962, now seen corresponding path program 1 times [2019-12-28 00:38:04,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:04,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067964540] [2019-12-28 00:38:04,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:04,538 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 00:38:04,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067964540] [2019-12-28 00:38:04,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:04,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:38:04,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280285667] [2019-12-28 00:38:04,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:04,553 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:04,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:38:04,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:04,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:38:04,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:38:04,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:04,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:38:04,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:38:04,584 INFO L87 Difference]: Start difference. First operand 20409 states and 58984 transitions. Second operand 6 states. [2019-12-28 00:38:05,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:05,669 INFO L93 Difference]: Finished difference Result 26880 states and 78478 transitions. [2019-12-28 00:38:05,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:38:05,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 00:38:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:05,707 INFO L225 Difference]: With dead ends: 26880 [2019-12-28 00:38:05,707 INFO L226 Difference]: Without dead ends: 26769 [2019-12-28 00:38:05,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:38:05,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26769 states. [2019-12-28 00:38:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26769 to 24702. [2019-12-28 00:38:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24702 states. [2019-12-28 00:38:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24702 states to 24702 states and 71782 transitions. [2019-12-28 00:38:06,441 INFO L78 Accepts]: Start accepts. Automaton has 24702 states and 71782 transitions. Word has length 68 [2019-12-28 00:38:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:06,441 INFO L462 AbstractCegarLoop]: Abstraction has 24702 states and 71782 transitions. [2019-12-28 00:38:06,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:38:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 24702 states and 71782 transitions. [2019-12-28 00:38:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:38:06,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:06,450 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] [2019-12-28 00:38:06,450 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:06,450 INFO L82 PathProgramCache]: Analyzing trace with hash -896570397, now seen corresponding path program 1 times [2019-12-28 00:38:06,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:06,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483232312] [2019-12-28 00:38:06,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:06,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 00:38:06,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483232312] [2019-12-28 00:38:06,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:06,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 00:38:06,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866228212] [2019-12-28 00:38:06,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:06,576 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:06,593 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:38:06,593 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:06,735 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 00:38:06,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 00:38:06,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:06,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 00:38:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-28 00:38:06,736 INFO L87 Difference]: Start difference. First operand 24702 states and 71782 transitions. Second operand 12 states. [2019-12-28 00:38:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:08,132 INFO L93 Difference]: Finished difference Result 30982 states and 89506 transitions. [2019-12-28 00:38:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 00:38:08,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-28 00:38:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:08,175 INFO L225 Difference]: With dead ends: 30982 [2019-12-28 00:38:08,175 INFO L226 Difference]: Without dead ends: 30982 [2019-12-28 00:38:08,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:38:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30982 states. [2019-12-28 00:38:08,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30982 to 27343. [2019-12-28 00:38:08,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-28 00:38:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 79281 transitions. [2019-12-28 00:38:08,558 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 79281 transitions. Word has length 68 [2019-12-28 00:38:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:08,558 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 79281 transitions. [2019-12-28 00:38:08,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 00:38:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 79281 transitions. [2019-12-28 00:38:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:38:08,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:08,567 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] [2019-12-28 00:38:08,568 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:08,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:08,568 INFO L82 PathProgramCache]: Analyzing trace with hash -9066716, now seen corresponding path program 1 times [2019-12-28 00:38:08,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:08,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474141170] [2019-12-28 00:38:08,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:08,641 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 00:38:08,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474141170] [2019-12-28 00:38:08,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:08,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:38:08,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389023391] [2019-12-28 00:38:08,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:08,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:08,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 172 transitions. [2019-12-28 00:38:08,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:08,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:38:08,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:38:08,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:38:08,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:38:08,695 INFO L87 Difference]: Start difference. First operand 27343 states and 79281 transitions. Second operand 6 states. [2019-12-28 00:38:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:08,763 INFO L93 Difference]: Finished difference Result 7438 states and 17579 transitions. [2019-12-28 00:38:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 00:38:08,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-28 00:38:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:08,773 INFO L225 Difference]: With dead ends: 7438 [2019-12-28 00:38:08,773 INFO L226 Difference]: Without dead ends: 6196 [2019-12-28 00:38:08,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:38:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2019-12-28 00:38:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 5051. [2019-12-28 00:38:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5051 states. [2019-12-28 00:38:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 11647 transitions. [2019-12-28 00:38:08,865 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 11647 transitions. Word has length 68 [2019-12-28 00:38:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:08,865 INFO L462 AbstractCegarLoop]: Abstraction has 5051 states and 11647 transitions. [2019-12-28 00:38:08,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:38:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 11647 transitions. [2019-12-28 00:38:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-28 00:38:08,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:08,871 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] [2019-12-28 00:38:08,872 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:08,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:08,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1271293831, now seen corresponding path program 1 times [2019-12-28 00:38:08,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:08,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727090328] [2019-12-28 00:38:08,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:08,935 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 00:38:08,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727090328] [2019-12-28 00:38:08,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:08,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:38:08,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970061362] [2019-12-28 00:38:08,937 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:08,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:08,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 68 transitions. [2019-12-28 00:38:08,966 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:08,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:38:08,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:38:08,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:08,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:38:08,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:38:08,967 INFO L87 Difference]: Start difference. First operand 5051 states and 11647 transitions. Second operand 3 states. [2019-12-28 00:38:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:09,010 INFO L93 Difference]: Finished difference Result 6708 states and 15325 transitions. [2019-12-28 00:38:09,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:38:09,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-28 00:38:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:09,021 INFO L225 Difference]: With dead ends: 6708 [2019-12-28 00:38:09,021 INFO L226 Difference]: Without dead ends: 6708 [2019-12-28 00:38:09,021 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 00:38:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2019-12-28 00:38:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 4999. [2019-12-28 00:38:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-12-28 00:38:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 11249 transitions. [2019-12-28 00:38:09,103 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 11249 transitions. Word has length 68 [2019-12-28 00:38:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:09,104 INFO L462 AbstractCegarLoop]: Abstraction has 4999 states and 11249 transitions. [2019-12-28 00:38:09,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:38:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 11249 transitions. [2019-12-28 00:38:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-28 00:38:09,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:09,111 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] [2019-12-28 00:38:09,111 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 186991737, now seen corresponding path program 1 times [2019-12-28 00:38:09,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:09,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342521659] [2019-12-28 00:38:09,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:09,189 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 00:38:09,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342521659] [2019-12-28 00:38:09,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:09,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:38:09,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [368618714] [2019-12-28 00:38:09,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:09,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:09,541 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 74 transitions. [2019-12-28 00:38:09,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:09,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:38:09,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:38:09,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:09,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:38:09,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:38:09,544 INFO L87 Difference]: Start difference. First operand 4999 states and 11249 transitions. Second operand 7 states. [2019-12-28 00:38:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:10,116 INFO L93 Difference]: Finished difference Result 5810 states and 12970 transitions. [2019-12-28 00:38:10,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:38:10,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-28 00:38:10,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:10,126 INFO L225 Difference]: With dead ends: 5810 [2019-12-28 00:38:10,127 INFO L226 Difference]: Without dead ends: 5757 [2019-12-28 00:38:10,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 00:38:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-12-28 00:38:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5015. [2019-12-28 00:38:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5015 states. [2019-12-28 00:38:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 11212 transitions. [2019-12-28 00:38:10,227 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 11212 transitions. Word has length 74 [2019-12-28 00:38:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:10,227 INFO L462 AbstractCegarLoop]: Abstraction has 5015 states and 11212 transitions. [2019-12-28 00:38:10,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:38:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 11212 transitions. [2019-12-28 00:38:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 00:38:10,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:10,235 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 00:38:10,236 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:10,236 INFO L82 PathProgramCache]: Analyzing trace with hash 316232134, now seen corresponding path program 1 times [2019-12-28 00:38:10,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:10,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226183794] [2019-12-28 00:38:10,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:10,297 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 00:38:10,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226183794] [2019-12-28 00:38:10,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:10,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 00:38:10,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631205005] [2019-12-28 00:38:10,298 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:10,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:10,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 273 transitions. [2019-12-28 00:38:10,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:10,435 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 00:38:10,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 00:38:10,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:10,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 00:38:10,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 00:38:10,436 INFO L87 Difference]: Start difference. First operand 5015 states and 11212 transitions. Second operand 3 states. [2019-12-28 00:38:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:10,606 INFO L93 Difference]: Finished difference Result 6355 states and 13991 transitions. [2019-12-28 00:38:10,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 00:38:10,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-28 00:38:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:10,616 INFO L225 Difference]: With dead ends: 6355 [2019-12-28 00:38:10,616 INFO L226 Difference]: Without dead ends: 6355 [2019-12-28 00:38:10,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 00:38:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-12-28 00:38:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5918. [2019-12-28 00:38:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5918 states. [2019-12-28 00:38:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5918 states to 5918 states and 13072 transitions. [2019-12-28 00:38:10,703 INFO L78 Accepts]: Start accepts. Automaton has 5918 states and 13072 transitions. Word has length 93 [2019-12-28 00:38:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:10,703 INFO L462 AbstractCegarLoop]: Abstraction has 5918 states and 13072 transitions. [2019-12-28 00:38:10,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 00:38:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5918 states and 13072 transitions. [2019-12-28 00:38:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-28 00:38:10,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:10,711 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 00:38:10,712 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1415085423, now seen corresponding path program 1 times [2019-12-28 00:38:10,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:10,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063771867] [2019-12-28 00:38:10,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:10,771 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 00:38:10,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063771867] [2019-12-28 00:38:10,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:10,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 00:38:10,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [165780473] [2019-12-28 00:38:10,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:10,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:10,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 196 transitions. [2019-12-28 00:38:10,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:10,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:38:10,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 00:38:10,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 00:38:10,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 00:38:10,886 INFO L87 Difference]: Start difference. First operand 5918 states and 13072 transitions. Second operand 4 states. [2019-12-28 00:38:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:11,003 INFO L93 Difference]: Finished difference Result 6314 states and 13994 transitions. [2019-12-28 00:38:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 00:38:11,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-28 00:38:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:11,011 INFO L225 Difference]: With dead ends: 6314 [2019-12-28 00:38:11,012 INFO L226 Difference]: Without dead ends: 6314 [2019-12-28 00:38:11,012 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 00:38:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-12-28 00:38:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 5757. [2019-12-28 00:38:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-12-28 00:38:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 12813 transitions. [2019-12-28 00:38:11,102 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 12813 transitions. Word has length 93 [2019-12-28 00:38:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:11,102 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 12813 transitions. [2019-12-28 00:38:11,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 00:38:11,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 12813 transitions. [2019-12-28 00:38:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:38:11,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:11,111 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 00:38:11,111 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:11,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1096662197, now seen corresponding path program 1 times [2019-12-28 00:38:11,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:11,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740993048] [2019-12-28 00:38:11,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:11,185 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 00:38:11,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740993048] [2019-12-28 00:38:11,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:11,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:38:11,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [511824580] [2019-12-28 00:38:11,186 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:11,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:11,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 279 transitions. [2019-12-28 00:38:11,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:11,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 00:38:11,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:38:11,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:38:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:38:11,325 INFO L87 Difference]: Start difference. First operand 5757 states and 12813 transitions. Second operand 5 states. [2019-12-28 00:38:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:12,011 INFO L93 Difference]: Finished difference Result 12046 states and 26381 transitions. [2019-12-28 00:38:12,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 00:38:12,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-28 00:38:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:12,024 INFO L225 Difference]: With dead ends: 12046 [2019-12-28 00:38:12,024 INFO L226 Difference]: Without dead ends: 12032 [2019-12-28 00:38:12,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 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 00:38:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2019-12-28 00:38:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 7935. [2019-12-28 00:38:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-12-28 00:38:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 17552 transitions. [2019-12-28 00:38:12,118 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 17552 transitions. Word has length 95 [2019-12-28 00:38:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:12,119 INFO L462 AbstractCegarLoop]: Abstraction has 7935 states and 17552 transitions. [2019-12-28 00:38:12,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:38:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 17552 transitions. [2019-12-28 00:38:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:38:12,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:12,129 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 00:38:12,129 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash 148102284, now seen corresponding path program 1 times [2019-12-28 00:38:12,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:12,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923254330] [2019-12-28 00:38:12,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 00:38:12,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923254330] [2019-12-28 00:38:12,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:12,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:38:12,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908190372] [2019-12-28 00:38:12,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:12,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:12,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 279 transitions. [2019-12-28 00:38:12,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:12,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-28 00:38:12,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 00:38:12,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:12,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 00:38:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:38:12,811 INFO L87 Difference]: Start difference. First operand 7935 states and 17552 transitions. Second operand 11 states. [2019-12-28 00:38:13,234 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-28 00:38:16,046 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-28 00:38:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:16,757 INFO L93 Difference]: Finished difference Result 16786 states and 36940 transitions. [2019-12-28 00:38:16,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 00:38:16,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-28 00:38:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:16,776 INFO L225 Difference]: With dead ends: 16786 [2019-12-28 00:38:16,776 INFO L226 Difference]: Without dead ends: 16786 [2019-12-28 00:38:16,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=1069, Unknown=0, NotChecked=0, Total=1332 [2019-12-28 00:38:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16786 states. [2019-12-28 00:38:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16786 to 7937. [2019-12-28 00:38:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-28 00:38:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17521 transitions. [2019-12-28 00:38:16,901 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17521 transitions. Word has length 95 [2019-12-28 00:38:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:16,902 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17521 transitions. [2019-12-28 00:38:16,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 00:38:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17521 transitions. [2019-12-28 00:38:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:38:16,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:16,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, 1, 1, 1, 1, 1, 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 00:38:16,912 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2039041963, now seen corresponding path program 1 times [2019-12-28 00:38:16,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:16,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678621962] [2019-12-28 00:38:16,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:17,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 00:38:17,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678621962] [2019-12-28 00:38:17,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:17,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 00:38:17,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2026852263] [2019-12-28 00:38:17,053 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:17,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:17,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 204 transitions. [2019-12-28 00:38:17,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:17,231 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:38:17,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 00:38:17,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 00:38:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-28 00:38:17,232 INFO L87 Difference]: Start difference. First operand 7937 states and 17521 transitions. Second operand 11 states. [2019-12-28 00:38:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:20,511 INFO L93 Difference]: Finished difference Result 13822 states and 30343 transitions. [2019-12-28 00:38:20,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 00:38:20,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-28 00:38:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:20,526 INFO L225 Difference]: With dead ends: 13822 [2019-12-28 00:38:20,527 INFO L226 Difference]: Without dead ends: 13777 [2019-12-28 00:38:20,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2019-12-28 00:38:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13777 states. [2019-12-28 00:38:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13777 to 9183. [2019-12-28 00:38:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9183 states. [2019-12-28 00:38:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9183 states to 9183 states and 20300 transitions. [2019-12-28 00:38:20,645 INFO L78 Accepts]: Start accepts. Automaton has 9183 states and 20300 transitions. Word has length 95 [2019-12-28 00:38:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:20,645 INFO L462 AbstractCegarLoop]: Abstraction has 9183 states and 20300 transitions. [2019-12-28 00:38:20,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 00:38:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9183 states and 20300 transitions. [2019-12-28 00:38:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:38:20,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:20,654 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 00:38:20,654 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash 458973974, now seen corresponding path program 1 times [2019-12-28 00:38:20,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:20,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095734988] [2019-12-28 00:38:20,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:20,764 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 00:38:20,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095734988] [2019-12-28 00:38:20,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:20,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 00:38:20,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2025639309] [2019-12-28 00:38:20,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:20,781 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:20,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 204 transitions. [2019-12-28 00:38:20,854 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:20,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 00:38:20,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 00:38:20,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:20,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 00:38:20,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 00:38:20,856 INFO L87 Difference]: Start difference. First operand 9183 states and 20300 transitions. Second operand 8 states. [2019-12-28 00:38:21,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:21,536 INFO L93 Difference]: Finished difference Result 14977 states and 33367 transitions. [2019-12-28 00:38:21,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 00:38:21,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-28 00:38:21,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:21,553 INFO L225 Difference]: With dead ends: 14977 [2019-12-28 00:38:21,553 INFO L226 Difference]: Without dead ends: 14977 [2019-12-28 00:38:21,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:38:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14977 states. [2019-12-28 00:38:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14977 to 9566. [2019-12-28 00:38:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9566 states. [2019-12-28 00:38:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9566 states to 9566 states and 21253 transitions. [2019-12-28 00:38:21,677 INFO L78 Accepts]: Start accepts. Automaton has 9566 states and 21253 transitions. Word has length 95 [2019-12-28 00:38:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:21,677 INFO L462 AbstractCegarLoop]: Abstraction has 9566 states and 21253 transitions. [2019-12-28 00:38:21,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 00:38:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 9566 states and 21253 transitions. [2019-12-28 00:38:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:38:21,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:21,685 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 00:38:21,685 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:21,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1346477655, now seen corresponding path program 1 times [2019-12-28 00:38:21,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:21,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758802301] [2019-12-28 00:38:21,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:21,810 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 00:38:21,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758802301] [2019-12-28 00:38:21,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:21,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 00:38:21,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219033654] [2019-12-28 00:38:21,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:21,828 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:21,904 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 204 transitions. [2019-12-28 00:38:21,904 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:21,906 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 00:38:21,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 00:38:21,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 00:38:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 00:38:21,907 INFO L87 Difference]: Start difference. First operand 9566 states and 21253 transitions. Second operand 7 states. [2019-12-28 00:38:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:22,075 INFO L93 Difference]: Finished difference Result 9640 states and 21553 transitions. [2019-12-28 00:38:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:38:22,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-28 00:38:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:22,085 INFO L225 Difference]: With dead ends: 9640 [2019-12-28 00:38:22,085 INFO L226 Difference]: Without dead ends: 9640 [2019-12-28 00:38:22,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-28 00:38:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2019-12-28 00:38:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 7361. [2019-12-28 00:38:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7361 states. [2019-12-28 00:38:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7361 states to 7361 states and 16388 transitions. [2019-12-28 00:38:22,171 INFO L78 Accepts]: Start accepts. Automaton has 7361 states and 16388 transitions. Word has length 95 [2019-12-28 00:38:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:22,172 INFO L462 AbstractCegarLoop]: Abstraction has 7361 states and 16388 transitions. [2019-12-28 00:38:22,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 00:38:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 7361 states and 16388 transitions. [2019-12-28 00:38:22,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-28 00:38:22,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:22,181 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 00:38:22,181 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:22,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:22,181 INFO L82 PathProgramCache]: Analyzing trace with hash -385497897, now seen corresponding path program 1 times [2019-12-28 00:38:22,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:22,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282231850] [2019-12-28 00:38:22,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:22,274 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 00:38:22,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282231850] [2019-12-28 00:38:22,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:22,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 00:38:22,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1483606541] [2019-12-28 00:38:22,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:22,291 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:22,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 204 transitions. [2019-12-28 00:38:22,360 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:22,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:38:22,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 00:38:22,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:22,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 00:38:22,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 00:38:22,361 INFO L87 Difference]: Start difference. First operand 7361 states and 16388 transitions. Second operand 6 states. [2019-12-28 00:38:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:22,489 INFO L93 Difference]: Finished difference Result 7091 states and 15614 transitions. [2019-12-28 00:38:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 00:38:22,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-28 00:38:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:22,498 INFO L225 Difference]: With dead ends: 7091 [2019-12-28 00:38:22,498 INFO L226 Difference]: Without dead ends: 7091 [2019-12-28 00:38:22,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 00:38:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7091 states. [2019-12-28 00:38:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7091 to 4428. [2019-12-28 00:38:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2019-12-28 00:38:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 9770 transitions. [2019-12-28 00:38:22,556 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 9770 transitions. Word has length 95 [2019-12-28 00:38:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:22,557 INFO L462 AbstractCegarLoop]: Abstraction has 4428 states and 9770 transitions. [2019-12-28 00:38:22,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 00:38:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 9770 transitions. [2019-12-28 00:38:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 00:38:22,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:22,561 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, 1, 1] [2019-12-28 00:38:22,561 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 881537949, now seen corresponding path program 1 times [2019-12-28 00:38:22,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:22,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013300958] [2019-12-28 00:38:22,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:22,670 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 00:38:22,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013300958] [2019-12-28 00:38:22,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:22,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 00:38:22,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [76174764] [2019-12-28 00:38:22,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:22,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:23,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 281 transitions. [2019-12-28 00:38:23,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:23,143 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 00:38:23,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 00:38:23,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:23,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 00:38:23,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 00:38:23,145 INFO L87 Difference]: Start difference. First operand 4428 states and 9770 transitions. Second operand 5 states. [2019-12-28 00:38:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:23,204 INFO L93 Difference]: Finished difference Result 4428 states and 9761 transitions. [2019-12-28 00:38:23,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 00:38:23,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-28 00:38:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:23,212 INFO L225 Difference]: With dead ends: 4428 [2019-12-28 00:38:23,213 INFO L226 Difference]: Without dead ends: 4428 [2019-12-28 00:38:23,214 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 00:38:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2019-12-28 00:38:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4428. [2019-12-28 00:38:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4428 states. [2019-12-28 00:38:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4428 states to 4428 states and 9761 transitions. [2019-12-28 00:38:23,292 INFO L78 Accepts]: Start accepts. Automaton has 4428 states and 9761 transitions. Word has length 97 [2019-12-28 00:38:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:23,293 INFO L462 AbstractCegarLoop]: Abstraction has 4428 states and 9761 transitions. [2019-12-28 00:38:23,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 00:38:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4428 states and 9761 transitions. [2019-12-28 00:38:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 00:38:23,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:23,301 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, 1, 1] [2019-12-28 00:38:23,301 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:23,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1769041630, now seen corresponding path program 1 times [2019-12-28 00:38:23,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:23,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431279078] [2019-12-28 00:38:23,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 00:38:23,543 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 00:38:23,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431279078] [2019-12-28 00:38:23,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 00:38:23,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 00:38:23,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278611470] [2019-12-28 00:38:23,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 00:38:23,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 00:38:23,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 281 transitions. [2019-12-28 00:38:23,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 00:38:23,895 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 00:38:23,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 00:38:23,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 00:38:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 00:38:23,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-28 00:38:23,896 INFO L87 Difference]: Start difference. First operand 4428 states and 9761 transitions. Second operand 15 states. [2019-12-28 00:38:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 00:38:28,645 INFO L93 Difference]: Finished difference Result 18034 states and 40205 transitions. [2019-12-28 00:38:28,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-28 00:38:28,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-12-28 00:38:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 00:38:28,659 INFO L225 Difference]: With dead ends: 18034 [2019-12-28 00:38:28,659 INFO L226 Difference]: Without dead ends: 12220 [2019-12-28 00:38:28,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=269, Invalid=1537, Unknown=0, NotChecked=0, Total=1806 [2019-12-28 00:38:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12220 states. [2019-12-28 00:38:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12220 to 4522. [2019-12-28 00:38:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4522 states. [2019-12-28 00:38:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4522 states to 4522 states and 9896 transitions. [2019-12-28 00:38:28,741 INFO L78 Accepts]: Start accepts. Automaton has 4522 states and 9896 transitions. Word has length 97 [2019-12-28 00:38:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 00:38:28,741 INFO L462 AbstractCegarLoop]: Abstraction has 4522 states and 9896 transitions. [2019-12-28 00:38:28,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 00:38:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4522 states and 9896 transitions. [2019-12-28 00:38:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-28 00:38:28,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 00:38:28,746 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, 1, 1] [2019-12-28 00:38:28,746 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 00:38:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 00:38:28,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1980984750, now seen corresponding path program 2 times [2019-12-28 00:38:28,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 00:38:28,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232368508] [2019-12-28 00:38:28,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 00:38:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:38:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 00:38:28,827 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 00:38:28,827 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 00:38:29,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:38:29 BasicIcfg [2019-12-28 00:38:29,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 00:38:29,024 INFO L168 Benchmark]: Toolchain (without parser) took 67122.61 ms. Allocated memory was 137.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 100.7 MB in the beginning and 743.3 MB in the end (delta: -642.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-28 00:38:29,025 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 00:38:29,029 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.08 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 157.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-28 00:38:29,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.89 ms. Allocated memory is still 202.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 00:38:29,030 INFO L168 Benchmark]: Boogie Preprocessor took 37.31 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 00:38:29,030 INFO L168 Benchmark]: RCFGBuilder took 733.79 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 108.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-28 00:38:29,030 INFO L168 Benchmark]: TraceAbstraction took 65527.83 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.5 MB in the beginning and 743.3 MB in the end (delta: -635.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-28 00:38:29,034 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.08 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 157.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.89 ms. Allocated memory is still 202.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.31 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 733.79 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 108.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65527.83 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.5 MB in the beginning and 743.3 MB in the end (delta: -635.8 MB). Peak memory consumption was 1.7 GB. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L715] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L716] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L717] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L718] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L719] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L720] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L798] 0 pthread_t t317; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L799] FCALL, FORK 0 pthread_create(&t317, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L731] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L732] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L733] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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] [L740] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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] [L800] 0 pthread_t t318; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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] [L801] FCALL, FORK 0 pthread_create(&t318, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L764] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L740] 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) [L741] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 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 [!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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 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 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] 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 [!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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 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 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 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) [L765] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, 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] 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)) [L766] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, 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] [L766] 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)) [L767] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, 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] [L767] 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)) [L768] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, 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] [L768] 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)) [L769] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, 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] [L769] 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)) [L770] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, 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] [L770] 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)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L772] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, 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] [L772] 2 y = y$flush_delayed ? y$mem_tmp : y [L773] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=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] [L776] 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) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=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] [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=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] [L778] 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 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=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] [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=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] [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 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) [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 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 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 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 [L814] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 65.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 31.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9441 SDtfs, 11428 SDslu, 27884 SDs, 0 SdLazy, 16344 SolverSat, 664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 177 SyntacticMatches, 20 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 100936 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2309 NumberOfCodeBlocks, 2309 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2181 ConstructedInterpolants, 0 QuantifiedInterpolants, 439879 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...