/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/mix034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:02:24,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:02:24,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:02:24,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:02:24,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:02:24,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:02:24,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:02:24,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:02:24,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:02:24,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:02:24,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:02:24,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:02:24,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:02:24,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:02:24,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:02:24,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:02:24,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:02:24,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:02:24,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:02:24,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:02:24,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:02:24,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:02:24,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:02:24,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:02:24,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:02:24,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:02:24,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:02:24,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:02:24,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:02:24,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:02:24,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:02:24,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:02:24,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:02:24,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:02:24,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:02:24,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:02:24,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:02:24,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:02:24,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:02:24,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:02:24,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:02:24,629 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 02:02:24,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:02:24,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:02:24,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:02:24,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:02:24,663 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:02:24,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:02:24,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:02:24,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:02:24,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:02:24,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:02:24,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:02:24,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:02:24,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:02:24,664 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:02:24,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:02:24,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:02:24,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:02:24,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:02:24,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:02:24,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:02:24,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:02:24,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:02:24,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:02:24,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:02:24,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:02:24,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:02:24,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:02:24,667 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:02:24,667 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:02:24,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:02:24,668 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:02:24,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:02:24,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:02:24,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:02:24,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:02:24,960 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:02:24,960 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:02:24,961 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-28 02:02:25,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a5af403/35aad744106142c48fa826350a20aa1b/FLAGaf5cf638c [2019-12-28 02:02:25,572 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:02:25,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc.i [2019-12-28 02:02:25,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a5af403/35aad744106142c48fa826350a20aa1b/FLAGaf5cf638c [2019-12-28 02:02:25,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09a5af403/35aad744106142c48fa826350a20aa1b [2019-12-28 02:02:25,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:02:25,870 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:02:25,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:02:25,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:02:25,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:02:25,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:02:25" (1/1) ... [2019-12-28 02:02:25,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78428862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:25, skipping insertion in model container [2019-12-28 02:02:25,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:02:25" (1/1) ... [2019-12-28 02:02:25,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:02:25,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:02:26,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:02:26,542 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:02:26,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:02:26,696 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:02:26,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26 WrapperNode [2019-12-28 02:02:26,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:02:26,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:02:26,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:02:26,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:02:26,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:02:26,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:02:26,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:02:26,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:02:26,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (1/1) ... [2019-12-28 02:02:26,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:02:26,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:02:26,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:02:26,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:02:26,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (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 02:02:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:02:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:02:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:02:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:02:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:02:26,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:02:26,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:02:26,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:02:26,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:02:26,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:02:26,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:02:26,869 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 02:02:27,630 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:02:27,630 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:02:27,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:02:27 BoogieIcfgContainer [2019-12-28 02:02:27,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:02:27,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:02:27,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:02:27,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:02:27,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:02:25" (1/3) ... [2019-12-28 02:02:27,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57efb0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:02:27, skipping insertion in model container [2019-12-28 02:02:27,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:02:26" (2/3) ... [2019-12-28 02:02:27,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57efb0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:02:27, skipping insertion in model container [2019-12-28 02:02:27,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:02:27" (3/3) ... [2019-12-28 02:02:27,642 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_power.oepc.i [2019-12-28 02:02:27,653 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:02:27,653 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:02:27,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:02:27,662 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:02:27,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,702 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,770 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:02:27,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 02:02:27,808 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:02:27,809 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:02:27,809 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:02:27,809 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:02:27,809 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:02:27,809 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:02:27,809 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:02:27,810 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:02:27,826 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 183 transitions [2019-12-28 02:02:29,963 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-12-28 02:02:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-12-28 02:02:29,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-28 02:02:29,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:29,974 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] [2019-12-28 02:02:29,974 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:29,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1674583442, now seen corresponding path program 1 times [2019-12-28 02:02:29,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:29,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569318947] [2019-12-28 02:02:29,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:30,325 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 02:02:30,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569318947] [2019-12-28 02:02:30,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:30,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:02:30,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1180354043] [2019-12-28 02:02:30,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:30,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:30,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 36 transitions. [2019-12-28 02:02:30,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:30,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:02:30,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:02:30,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:02:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:02:30,388 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-12-28 02:02:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:31,952 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-12-28 02:02:31,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:02:31,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-28 02:02:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:32,291 INFO L225 Difference]: With dead ends: 33593 [2019-12-28 02:02:32,291 INFO L226 Difference]: Without dead ends: 25705 [2019-12-28 02:02:32,295 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 02:02:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-12-28 02:02:33,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-12-28 02:02:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-12-28 02:02:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-12-28 02:02:34,029 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-12-28 02:02:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:34,031 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-12-28 02:02:34,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:02:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-12-28 02:02:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 02:02:34,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:34,045 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 02:02:34,046 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:34,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash -196337745, now seen corresponding path program 1 times [2019-12-28 02:02:34,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:34,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102778410] [2019-12-28 02:02:34,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:34,242 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 02:02:34,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102778410] [2019-12-28 02:02:34,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:34,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:02:34,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1065033634] [2019-12-28 02:02:34,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:34,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:34,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 02:02:34,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:34,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:02:34,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:02:34,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:34,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:02:34,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:02:34,259 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-12-28 02:02:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:35,167 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-12-28 02:02:35,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:02:35,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 02:02:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:36,692 INFO L225 Difference]: With dead ends: 41083 [2019-12-28 02:02:36,693 INFO L226 Difference]: Without dead ends: 40547 [2019-12-28 02:02:36,694 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 02:02:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-12-28 02:02:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-12-28 02:02:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-12-28 02:02:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-12-28 02:02:38,154 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-12-28 02:02:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:38,158 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-12-28 02:02:38,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:02:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-12-28 02:02:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 02:02:38,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:38,167 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] [2019-12-28 02:02:38,167 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash -207257985, now seen corresponding path program 1 times [2019-12-28 02:02:38,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:38,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688599767] [2019-12-28 02:02:38,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:38,317 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 02:02:38,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688599767] [2019-12-28 02:02:38,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:38,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:02:38,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [258349094] [2019-12-28 02:02:38,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:38,326 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:38,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 02:02:38,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:38,335 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:02:38,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:02:38,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:38,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:02:38,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:02:38,336 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-12-28 02:02:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:39,328 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-12-28 02:02:39,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:02:39,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 02:02:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:39,630 INFO L225 Difference]: With dead ends: 49780 [2019-12-28 02:02:39,630 INFO L226 Difference]: Without dead ends: 49276 [2019-12-28 02:02:39,630 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 02:02:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-12-28 02:02:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-12-28 02:02:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-12-28 02:02:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-12-28 02:02:42,691 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-12-28 02:02:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:42,691 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-12-28 02:02:42,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:02:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-12-28 02:02:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 02:02:42,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:42,703 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] [2019-12-28 02:02:42,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash -635197403, now seen corresponding path program 1 times [2019-12-28 02:02:42,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:42,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981582542] [2019-12-28 02:02:42,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:42,755 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 02:02:42,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981582542] [2019-12-28 02:02:42,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:42,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:02:42,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701213278] [2019-12-28 02:02:42,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:42,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:42,770 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 51 transitions. [2019-12-28 02:02:42,770 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:42,770 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:02:42,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:02:42,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:02:42,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:02:42,771 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-12-28 02:02:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:43,461 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-12-28 02:02:43,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:02:43,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-28 02:02:43,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:43,653 INFO L225 Difference]: With dead ends: 61089 [2019-12-28 02:02:43,653 INFO L226 Difference]: Without dead ends: 61089 [2019-12-28 02:02:43,654 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 02:02:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-12-28 02:02:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-12-28 02:02:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-12-28 02:02:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-12-28 02:02:46,727 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-12-28 02:02:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:46,728 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-12-28 02:02:46,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:02:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-12-28 02:02:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:02:46,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:46,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] [2019-12-28 02:02:46,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1064293156, now seen corresponding path program 1 times [2019-12-28 02:02:46,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:46,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264899492] [2019-12-28 02:02:46,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:46,916 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 02:02:46,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264899492] [2019-12-28 02:02:46,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:46,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:02:46,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82515334] [2019-12-28 02:02:46,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:46,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:46,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:02:46,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:47,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:02:47,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:02:47,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:47,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:02:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:02:47,014 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 7 states. [2019-12-28 02:02:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:47,982 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-12-28 02:02:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:02:47,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-28 02:02:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:48,327 INFO L225 Difference]: With dead ends: 63758 [2019-12-28 02:02:48,327 INFO L226 Difference]: Without dead ends: 63758 [2019-12-28 02:02:48,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:02:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-12-28 02:02:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-12-28 02:02:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-12-28 02:02:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-12-28 02:02:53,037 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-12-28 02:02:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:53,038 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-12-28 02:02:53,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:02:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-12-28 02:02:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:02:53,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:53,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:02:53,072 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1433722781, now seen corresponding path program 1 times [2019-12-28 02:02:53,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:53,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877250734] [2019-12-28 02:02:53,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:53,218 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 02:02:53,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877250734] [2019-12-28 02:02:53,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:53,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:02:53,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686351338] [2019-12-28 02:02:53,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:53,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:53,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:02:53,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:53,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:02:53,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:02:53,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:02:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:02:53,255 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 8 states. [2019-12-28 02:02:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:54,868 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-12-28 02:02:54,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:02:54,869 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 02:02:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:55,052 INFO L225 Difference]: With dead ends: 83687 [2019-12-28 02:02:55,053 INFO L226 Difference]: Without dead ends: 83687 [2019-12-28 02:02:55,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:02:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-12-28 02:02:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-12-28 02:02:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-12-28 02:02:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-12-28 02:02:56,772 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-12-28 02:02:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:56,772 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-12-28 02:02:56,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:02:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-12-28 02:02:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:02:56,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:56,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:02:56,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1973740834, now seen corresponding path program 1 times [2019-12-28 02:02:56,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:56,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343308809] [2019-12-28 02:02:56,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:56,873 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 02:02:56,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343308809] [2019-12-28 02:02:56,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:56,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:02:56,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1171851262] [2019-12-28 02:02:56,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:56,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:56,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:02:56,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:56,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:02:56,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:02:56,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:02:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:02:56,907 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 4 states. [2019-12-28 02:02:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:57,012 INFO L93 Difference]: Finished difference Result 12161 states and 37831 transitions. [2019-12-28 02:02:57,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:02:57,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 02:02:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:57,040 INFO L225 Difference]: With dead ends: 12161 [2019-12-28 02:02:57,040 INFO L226 Difference]: Without dead ends: 10676 [2019-12-28 02:02:57,041 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 02:02:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-28 02:02:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 10627. [2019-12-28 02:02:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-12-28 02:02:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 32593 transitions. [2019-12-28 02:02:57,763 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 32593 transitions. Word has length 55 [2019-12-28 02:02:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:57,764 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 32593 transitions. [2019-12-28 02:02:57,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:02:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 32593 transitions. [2019-12-28 02:02:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:02:57,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:57,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:02:57,766 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:57,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:57,767 INFO L82 PathProgramCache]: Analyzing trace with hash -984017040, now seen corresponding path program 1 times [2019-12-28 02:02:57,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:57,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243521145] [2019-12-28 02:02:57,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:57,868 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 02:02:57,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243521145] [2019-12-28 02:02:57,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:57,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:02:57,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832663090] [2019-12-28 02:02:57,869 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:57,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:57,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 02:02:57,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:57,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:02:57,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:02:57,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:57,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:02:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:02:57,886 INFO L87 Difference]: Start difference. First operand 10627 states and 32593 transitions. Second operand 6 states. [2019-12-28 02:02:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:58,362 INFO L93 Difference]: Finished difference Result 13184 states and 39874 transitions. [2019-12-28 02:02:58,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:02:58,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 02:02:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:58,381 INFO L225 Difference]: With dead ends: 13184 [2019-12-28 02:02:58,381 INFO L226 Difference]: Without dead ends: 13121 [2019-12-28 02:02:58,382 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 02:02:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-12-28 02:02:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 11050. [2019-12-28 02:02:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-12-28 02:02:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33787 transitions. [2019-12-28 02:02:58,603 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33787 transitions. Word has length 55 [2019-12-28 02:02:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:58,603 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33787 transitions. [2019-12-28 02:02:58,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:02:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33787 transitions. [2019-12-28 02:02:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:02:58,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:58,608 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] [2019-12-28 02:02:58,608 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash 721551436, now seen corresponding path program 1 times [2019-12-28 02:02:58,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:58,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908168924] [2019-12-28 02:02:58,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:58,666 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 02:02:58,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908168924] [2019-12-28 02:02:58,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:58,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:02:58,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764028752] [2019-12-28 02:02:58,670 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:58,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:58,691 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 02:02:58,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:58,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:02:58,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:02:58,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:58,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:02:58,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:02:58,693 INFO L87 Difference]: Start difference. First operand 11050 states and 33787 transitions. Second operand 4 states. [2019-12-28 02:02:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:58,839 INFO L93 Difference]: Finished difference Result 12864 states and 39393 transitions. [2019-12-28 02:02:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:02:58,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-28 02:02:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:58,864 INFO L225 Difference]: With dead ends: 12864 [2019-12-28 02:02:58,865 INFO L226 Difference]: Without dead ends: 12864 [2019-12-28 02:02:58,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:02:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-12-28 02:02:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 11695. [2019-12-28 02:02:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-12-28 02:02:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 35764 transitions. [2019-12-28 02:02:59,076 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 35764 transitions. Word has length 63 [2019-12-28 02:02:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:59,077 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 35764 transitions. [2019-12-28 02:02:59,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:02:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 35764 transitions. [2019-12-28 02:02:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:02:59,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:59,081 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] [2019-12-28 02:02:59,081 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1830605525, now seen corresponding path program 1 times [2019-12-28 02:02:59,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:59,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627000211] [2019-12-28 02:02:59,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:59,158 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 02:02:59,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627000211] [2019-12-28 02:02:59,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:59,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:02:59,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [763294201] [2019-12-28 02:02:59,160 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:59,170 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:59,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 02:02:59,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:59,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:02:59,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:02:59,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:59,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:02:59,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:02:59,182 INFO L87 Difference]: Start difference. First operand 11695 states and 35764 transitions. Second operand 6 states. [2019-12-28 02:02:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:02:59,632 INFO L93 Difference]: Finished difference Result 14221 states and 42862 transitions. [2019-12-28 02:02:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:02:59,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-28 02:02:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:02:59,653 INFO L225 Difference]: With dead ends: 14221 [2019-12-28 02:02:59,653 INFO L226 Difference]: Without dead ends: 14160 [2019-12-28 02:02:59,654 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 02:02:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-12-28 02:02:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13463. [2019-12-28 02:02:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13463 states. [2019-12-28 02:02:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13463 states to 13463 states and 40781 transitions. [2019-12-28 02:02:59,843 INFO L78 Accepts]: Start accepts. Automaton has 13463 states and 40781 transitions. Word has length 63 [2019-12-28 02:02:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:02:59,843 INFO L462 AbstractCegarLoop]: Abstraction has 13463 states and 40781 transitions. [2019-12-28 02:02:59,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:02:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 13463 states and 40781 transitions. [2019-12-28 02:02:59,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:02:59,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:02:59,849 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] [2019-12-28 02:02:59,850 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:02:59,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:02:59,850 INFO L82 PathProgramCache]: Analyzing trace with hash -827165457, now seen corresponding path program 1 times [2019-12-28 02:02:59,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:02:59,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862562738] [2019-12-28 02:02:59,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:02:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:02:59,896 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 02:02:59,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862562738] [2019-12-28 02:02:59,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:02:59,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:02:59,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607560948] [2019-12-28 02:02:59,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:02:59,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:02:59,930 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 02:02:59,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:02:59,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:02:59,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:02:59,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:02:59,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:02:59,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:02:59,990 INFO L87 Difference]: Start difference. First operand 13463 states and 40781 transitions. Second operand 5 states. [2019-12-28 02:03:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:00,440 INFO L93 Difference]: Finished difference Result 14051 states and 42317 transitions. [2019-12-28 02:03:00,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:03:00,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-28 02:03:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:00,463 INFO L225 Difference]: With dead ends: 14051 [2019-12-28 02:03:00,464 INFO L226 Difference]: Without dead ends: 14051 [2019-12-28 02:03:00,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-12-28 02:03:00,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 13757. [2019-12-28 02:03:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-12-28 02:03:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 41549 transitions. [2019-12-28 02:03:00,663 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 41549 transitions. Word has length 67 [2019-12-28 02:03:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:00,663 INFO L462 AbstractCegarLoop]: Abstraction has 13757 states and 41549 transitions. [2019-12-28 02:03:00,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 41549 transitions. [2019-12-28 02:03:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:03:00,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:00,670 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] [2019-12-28 02:03:00,670 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1250043886, now seen corresponding path program 1 times [2019-12-28 02:03:00,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:00,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440895003] [2019-12-28 02:03:00,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:00,734 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 02:03:00,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440895003] [2019-12-28 02:03:00,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:00,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:00,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [235163698] [2019-12-28 02:03:00,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:00,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:00,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 02:03:00,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:00,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 02:03:00,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:00,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:00,833 INFO L87 Difference]: Start difference. First operand 13757 states and 41549 transitions. Second operand 7 states. [2019-12-28 02:03:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:01,357 INFO L93 Difference]: Finished difference Result 16799 states and 50141 transitions. [2019-12-28 02:03:01,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:03:01,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 02:03:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:01,388 INFO L225 Difference]: With dead ends: 16799 [2019-12-28 02:03:01,388 INFO L226 Difference]: Without dead ends: 16799 [2019-12-28 02:03:01,388 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 02:03:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2019-12-28 02:03:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 15278. [2019-12-28 02:03:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-28 02:03:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45730 transitions. [2019-12-28 02:03:01,605 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45730 transitions. Word has length 67 [2019-12-28 02:03:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:01,605 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45730 transitions. [2019-12-28 02:03:01,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45730 transitions. [2019-12-28 02:03:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:01,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:01,614 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] [2019-12-28 02:03:01,614 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash -750353405, now seen corresponding path program 1 times [2019-12-28 02:03:01,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:01,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093836248] [2019-12-28 02:03:01,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:01,705 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 02:03:01,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093836248] [2019-12-28 02:03:01,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:01,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:01,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1649288072] [2019-12-28 02:03:01,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:01,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:01,733 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:01,733 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:01,865 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-28 02:03:01,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:03:01,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:03:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:01,866 INFO L87 Difference]: Start difference. First operand 15278 states and 45730 transitions. Second operand 10 states. [2019-12-28 02:03:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:02,755 INFO L93 Difference]: Finished difference Result 16275 states and 48105 transitions. [2019-12-28 02:03:02,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:02,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-28 02:03:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:02,778 INFO L225 Difference]: With dead ends: 16275 [2019-12-28 02:03:02,778 INFO L226 Difference]: Without dead ends: 16275 [2019-12-28 02:03:02,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:03:02,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-12-28 02:03:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 15851. [2019-12-28 02:03:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15851 states. [2019-12-28 02:03:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 47027 transitions. [2019-12-28 02:03:03,145 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 47027 transitions. Word has length 69 [2019-12-28 02:03:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:03,145 INFO L462 AbstractCegarLoop]: Abstraction has 15851 states and 47027 transitions. [2019-12-28 02:03:03,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:03:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 47027 transitions. [2019-12-28 02:03:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:03,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:03,154 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] [2019-12-28 02:03:03,154 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:03,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1467404548, now seen corresponding path program 1 times [2019-12-28 02:03:03,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:03,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051619257] [2019-12-28 02:03:03,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:03,234 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 02:03:03,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051619257] [2019-12-28 02:03:03,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:03,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:03,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1899758460] [2019-12-28 02:03:03,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:03,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:03,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:03,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:03,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 02:03:03,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:03:03,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:03,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:03:03,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:03,416 INFO L87 Difference]: Start difference. First operand 15851 states and 47027 transitions. Second operand 10 states. [2019-12-28 02:03:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:04,091 INFO L93 Difference]: Finished difference Result 18162 states and 52355 transitions. [2019-12-28 02:03:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:03:04,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-28 02:03:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:04,115 INFO L225 Difference]: With dead ends: 18162 [2019-12-28 02:03:04,116 INFO L226 Difference]: Without dead ends: 18162 [2019-12-28 02:03:04,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:03:04,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-12-28 02:03:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 16543. [2019-12-28 02:03:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16543 states. [2019-12-28 02:03:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16543 states to 16543 states and 48247 transitions. [2019-12-28 02:03:04,325 INFO L78 Accepts]: Start accepts. Automaton has 16543 states and 48247 transitions. Word has length 69 [2019-12-28 02:03:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:04,325 INFO L462 AbstractCegarLoop]: Abstraction has 16543 states and 48247 transitions. [2019-12-28 02:03:04,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:03:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 16543 states and 48247 transitions. [2019-12-28 02:03:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:04,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:04,334 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] [2019-12-28 02:03:04,335 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:04,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1678755461, now seen corresponding path program 1 times [2019-12-28 02:03:04,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:04,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975509226] [2019-12-28 02:03:04,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:04,413 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 02:03:04,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975509226] [2019-12-28 02:03:04,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:04,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:04,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1867573363] [2019-12-28 02:03:04,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:04,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:04,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:04,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:04,481 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:03:04,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:04,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:04,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:04,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:04,483 INFO L87 Difference]: Start difference. First operand 16543 states and 48247 transitions. Second operand 7 states. [2019-12-28 02:03:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:04,968 INFO L93 Difference]: Finished difference Result 21457 states and 62487 transitions. [2019-12-28 02:03:04,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:03:04,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:03:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:05,009 INFO L225 Difference]: With dead ends: 21457 [2019-12-28 02:03:05,010 INFO L226 Difference]: Without dead ends: 21457 [2019-12-28 02:03:05,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-12-28 02:03:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 19522. [2019-12-28 02:03:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19522 states. [2019-12-28 02:03:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 56656 transitions. [2019-12-28 02:03:05,293 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 56656 transitions. Word has length 69 [2019-12-28 02:03:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:05,293 INFO L462 AbstractCegarLoop]: Abstraction has 19522 states and 56656 transitions. [2019-12-28 02:03:05,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 56656 transitions. [2019-12-28 02:03:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:05,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:05,306 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] [2019-12-28 02:03:05,306 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1168221284, now seen corresponding path program 1 times [2019-12-28 02:03:05,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:05,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042761427] [2019-12-28 02:03:05,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:05,372 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 02:03:05,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042761427] [2019-12-28 02:03:05,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:05,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:05,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1501526591] [2019-12-28 02:03:05,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:05,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:05,409 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:05,409 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:05,450 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:03:05,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:05,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:05,451 INFO L87 Difference]: Start difference. First operand 19522 states and 56656 transitions. Second operand 7 states. [2019-12-28 02:03:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:06,153 INFO L93 Difference]: Finished difference Result 26409 states and 76314 transitions. [2019-12-28 02:03:06,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:06,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:03:06,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:06,193 INFO L225 Difference]: With dead ends: 26409 [2019-12-28 02:03:06,194 INFO L226 Difference]: Without dead ends: 26409 [2019-12-28 02:03:06,194 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 02:03:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26409 states. [2019-12-28 02:03:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26409 to 21410. [2019-12-28 02:03:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-28 02:03:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 61930 transitions. [2019-12-28 02:03:06,664 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 61930 transitions. Word has length 69 [2019-12-28 02:03:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:06,665 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 61930 transitions. [2019-12-28 02:03:06,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 61930 transitions. [2019-12-28 02:03:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:06,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:06,676 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] [2019-12-28 02:03:06,676 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:06,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:06,677 INFO L82 PathProgramCache]: Analyzing trace with hash -639233179, now seen corresponding path program 1 times [2019-12-28 02:03:06,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:06,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259351383] [2019-12-28 02:03:06,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:03:06,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259351383] [2019-12-28 02:03:06,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:06,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:06,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094649308] [2019-12-28 02:03:06,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:06,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:06,765 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:06,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:06,766 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:06,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:06,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:06,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:06,767 INFO L87 Difference]: Start difference. First operand 21410 states and 61930 transitions. Second operand 4 states. [2019-12-28 02:03:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:07,540 INFO L93 Difference]: Finished difference Result 27971 states and 81352 transitions. [2019-12-28 02:03:07,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:03:07,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 02:03:07,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:07,612 INFO L225 Difference]: With dead ends: 27971 [2019-12-28 02:03:07,612 INFO L226 Difference]: Without dead ends: 27836 [2019-12-28 02:03:07,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2019-12-28 02:03:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 25847. [2019-12-28 02:03:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25847 states. [2019-12-28 02:03:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25847 states to 25847 states and 75190 transitions. [2019-12-28 02:03:08,309 INFO L78 Accepts]: Start accepts. Automaton has 25847 states and 75190 transitions. Word has length 69 [2019-12-28 02:03:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:08,309 INFO L462 AbstractCegarLoop]: Abstraction has 25847 states and 75190 transitions. [2019-12-28 02:03:08,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 25847 states and 75190 transitions. [2019-12-28 02:03:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:08,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:08,331 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] [2019-12-28 02:03:08,331 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1858782758, now seen corresponding path program 1 times [2019-12-28 02:03:08,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:08,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603728773] [2019-12-28 02:03:08,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:08,517 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 02:03:08,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603728773] [2019-12-28 02:03:08,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:08,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:03:08,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836591601] [2019-12-28 02:03:08,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:08,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:08,552 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:08,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:08,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 02:03:08,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:03:08,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:08,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:03:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:08,685 INFO L87 Difference]: Start difference. First operand 25847 states and 75190 transitions. Second operand 10 states. [2019-12-28 02:03:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:09,388 INFO L93 Difference]: Finished difference Result 23115 states and 64212 transitions. [2019-12-28 02:03:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:03:09,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-28 02:03:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:09,437 INFO L225 Difference]: With dead ends: 23115 [2019-12-28 02:03:09,437 INFO L226 Difference]: Without dead ends: 23115 [2019-12-28 02:03:09,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-28 02:03:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23115 states. [2019-12-28 02:03:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23115 to 18811. [2019-12-28 02:03:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18811 states. [2019-12-28 02:03:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18811 states to 18811 states and 52247 transitions. [2019-12-28 02:03:09,878 INFO L78 Accepts]: Start accepts. Automaton has 18811 states and 52247 transitions. Word has length 69 [2019-12-28 02:03:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:09,878 INFO L462 AbstractCegarLoop]: Abstraction has 18811 states and 52247 transitions. [2019-12-28 02:03:09,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:03:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 18811 states and 52247 transitions. [2019-12-28 02:03:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:09,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:09,885 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] [2019-12-28 02:03:09,886 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:09,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1548680857, now seen corresponding path program 1 times [2019-12-28 02:03:09,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:09,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684651664] [2019-12-28 02:03:09,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:09,952 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 02:03:09,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684651664] [2019-12-28 02:03:09,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:09,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:09,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459026406] [2019-12-28 02:03:09,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:09,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:09,989 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:03:09,989 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:10,006 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:03:10,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:03:10,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:03:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:03:10,008 INFO L87 Difference]: Start difference. First operand 18811 states and 52247 transitions. Second operand 6 states. [2019-12-28 02:03:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:10,085 INFO L93 Difference]: Finished difference Result 6133 states and 14464 transitions. [2019-12-28 02:03:10,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:03:10,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 02:03:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:10,094 INFO L225 Difference]: With dead ends: 6133 [2019-12-28 02:03:10,095 INFO L226 Difference]: Without dead ends: 5263 [2019-12-28 02:03:10,095 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 02:03:10,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-28 02:03:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4728. [2019-12-28 02:03:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4728 states. [2019-12-28 02:03:10,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 10823 transitions. [2019-12-28 02:03:10,177 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 10823 transitions. Word has length 69 [2019-12-28 02:03:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:10,178 INFO L462 AbstractCegarLoop]: Abstraction has 4728 states and 10823 transitions. [2019-12-28 02:03:10,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:03:10,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 10823 transitions. [2019-12-28 02:03:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:03:10,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:10,184 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] [2019-12-28 02:03:10,184 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:10,185 INFO L82 PathProgramCache]: Analyzing trace with hash -839136164, now seen corresponding path program 1 times [2019-12-28 02:03:10,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:10,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396836145] [2019-12-28 02:03:10,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:10,218 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 02:03:10,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396836145] [2019-12-28 02:03:10,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:10,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:03:10,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784607911] [2019-12-28 02:03:10,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:10,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:10,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:03:10,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:10,251 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:10,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:03:10,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:03:10,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:03:10,252 INFO L87 Difference]: Start difference. First operand 4728 states and 10823 transitions. Second operand 3 states. [2019-12-28 02:03:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:10,292 INFO L93 Difference]: Finished difference Result 5858 states and 13189 transitions. [2019-12-28 02:03:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:03:10,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-28 02:03:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:10,300 INFO L225 Difference]: With dead ends: 5858 [2019-12-28 02:03:10,300 INFO L226 Difference]: Without dead ends: 5858 [2019-12-28 02:03:10,300 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 02:03:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-12-28 02:03:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4663. [2019-12-28 02:03:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-12-28 02:03:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10385 transitions. [2019-12-28 02:03:10,377 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10385 transitions. Word has length 69 [2019-12-28 02:03:10,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:10,377 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10385 transitions. [2019-12-28 02:03:10,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:03:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10385 transitions. [2019-12-28 02:03:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 02:03:10,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:10,384 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] [2019-12-28 02:03:10,384 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash -537618065, now seen corresponding path program 1 times [2019-12-28 02:03:10,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:10,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207540794] [2019-12-28 02:03:10,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:10,461 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 02:03:10,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207540794] [2019-12-28 02:03:10,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:10,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:10,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1825915394] [2019-12-28 02:03:10,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:10,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:10,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-28 02:03:10,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:10,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:10,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:10,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:10,499 INFO L87 Difference]: Start difference. First operand 4663 states and 10385 transitions. Second operand 5 states. [2019-12-28 02:03:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:10,708 INFO L93 Difference]: Finished difference Result 5724 states and 12814 transitions. [2019-12-28 02:03:10,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:03:10,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 02:03:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:10,717 INFO L225 Difference]: With dead ends: 5724 [2019-12-28 02:03:10,717 INFO L226 Difference]: Without dead ends: 5724 [2019-12-28 02:03:10,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-12-28 02:03:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5083. [2019-12-28 02:03:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-12-28 02:03:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 11343 transitions. [2019-12-28 02:03:10,835 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 11343 transitions. Word has length 75 [2019-12-28 02:03:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:10,835 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 11343 transitions. [2019-12-28 02:03:10,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 11343 transitions. [2019-12-28 02:03:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 02:03:10,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:10,847 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] [2019-12-28 02:03:10,847 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:10,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1205192270, now seen corresponding path program 1 times [2019-12-28 02:03:10,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:10,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367191269] [2019-12-28 02:03:10,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:10,976 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 02:03:10,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367191269] [2019-12-28 02:03:10,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:10,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:03:10,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9855197] [2019-12-28 02:03:10,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:10,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:11,020 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-28 02:03:11,020 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:11,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:11,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:11,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:11,022 INFO L87 Difference]: Start difference. First operand 5083 states and 11343 transitions. Second operand 7 states. [2019-12-28 02:03:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:11,601 INFO L93 Difference]: Finished difference Result 5823 states and 12866 transitions. [2019-12-28 02:03:11,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:03:11,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-28 02:03:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:11,609 INFO L225 Difference]: With dead ends: 5823 [2019-12-28 02:03:11,610 INFO L226 Difference]: Without dead ends: 5770 [2019-12-28 02:03:11,611 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 02:03:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-12-28 02:03:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5170. [2019-12-28 02:03:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-28 02:03:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 11432 transitions. [2019-12-28 02:03:11,691 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 11432 transitions. Word has length 75 [2019-12-28 02:03:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:11,691 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 11432 transitions. [2019-12-28 02:03:11,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 11432 transitions. [2019-12-28 02:03:11,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:03:11,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:11,699 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] [2019-12-28 02:03:11,699 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:11,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1470478578, now seen corresponding path program 1 times [2019-12-28 02:03:11,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:11,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433083568] [2019-12-28 02:03:11,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:11,766 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 02:03:11,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433083568] [2019-12-28 02:03:11,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:11,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:11,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1943827794] [2019-12-28 02:03:11,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:11,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:11,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 216 transitions. [2019-12-28 02:03:11,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:11,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 02:03:11,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:11,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:11,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:11,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:11,937 INFO L87 Difference]: Start difference. First operand 5170 states and 11432 transitions. Second operand 7 states. [2019-12-28 02:03:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:12,481 INFO L93 Difference]: Finished difference Result 6012 states and 13224 transitions. [2019-12-28 02:03:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:12,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-28 02:03:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:12,489 INFO L225 Difference]: With dead ends: 6012 [2019-12-28 02:03:12,489 INFO L226 Difference]: Without dead ends: 6012 [2019-12-28 02:03:12,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 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 02:03:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2019-12-28 02:03:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5315. [2019-12-28 02:03:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5315 states. [2019-12-28 02:03:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 11747 transitions. [2019-12-28 02:03:12,544 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 11747 transitions. Word has length 96 [2019-12-28 02:03:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:12,545 INFO L462 AbstractCegarLoop]: Abstraction has 5315 states and 11747 transitions. [2019-12-28 02:03:12,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 11747 transitions. [2019-12-28 02:03:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:03:12,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:12,551 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] [2019-12-28 02:03:12,551 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:12,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:12,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1713375192, now seen corresponding path program 2 times [2019-12-28 02:03:12,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:12,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502003286] [2019-12-28 02:03:12,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:12,616 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 02:03:12,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502003286] [2019-12-28 02:03:12,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:12,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:12,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216610684] [2019-12-28 02:03:12,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:12,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:12,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 203 transitions. [2019-12-28 02:03:12,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:12,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:03:12,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:12,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:12,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:12,716 INFO L87 Difference]: Start difference. First operand 5315 states and 11747 transitions. Second operand 4 states. [2019-12-28 02:03:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:12,813 INFO L93 Difference]: Finished difference Result 6278 states and 13796 transitions. [2019-12-28 02:03:12,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:03:12,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-28 02:03:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:12,821 INFO L225 Difference]: With dead ends: 6278 [2019-12-28 02:03:12,821 INFO L226 Difference]: Without dead ends: 6278 [2019-12-28 02:03:12,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 02:03:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2019-12-28 02:03:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 5509. [2019-12-28 02:03:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2019-12-28 02:03:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 12153 transitions. [2019-12-28 02:03:12,908 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 12153 transitions. Word has length 96 [2019-12-28 02:03:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:12,908 INFO L462 AbstractCegarLoop]: Abstraction has 5509 states and 12153 transitions. [2019-12-28 02:03:12,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 12153 transitions. [2019-12-28 02:03:12,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:12,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:12,914 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, 1] [2019-12-28 02:03:12,914 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:12,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:12,914 INFO L82 PathProgramCache]: Analyzing trace with hash -319220326, now seen corresponding path program 1 times [2019-12-28 02:03:12,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:12,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879482546] [2019-12-28 02:03:12,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:12,973 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 02:03:12,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879482546] [2019-12-28 02:03:12,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:12,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:12,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1265087775] [2019-12-28 02:03:12,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:12,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:13,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 222 transitions. [2019-12-28 02:03:13,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:13,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:03:13,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:03:13,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:13,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:03:13,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:03:13,110 INFO L87 Difference]: Start difference. First operand 5509 states and 12153 transitions. Second operand 6 states. [2019-12-28 02:03:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:13,241 INFO L93 Difference]: Finished difference Result 5979 states and 13177 transitions. [2019-12-28 02:03:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:03:13,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-28 02:03:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:13,247 INFO L225 Difference]: With dead ends: 5979 [2019-12-28 02:03:13,248 INFO L226 Difference]: Without dead ends: 5979 [2019-12-28 02:03:13,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2019-12-28 02:03:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 4609. [2019-12-28 02:03:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2019-12-28 02:03:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 10154 transitions. [2019-12-28 02:03:13,297 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 10154 transitions. Word has length 98 [2019-12-28 02:03:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:13,297 INFO L462 AbstractCegarLoop]: Abstraction has 4609 states and 10154 transitions. [2019-12-28 02:03:13,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:03:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 10154 transitions. [2019-12-28 02:03:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:13,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:13,304 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, 1] [2019-12-28 02:03:13,304 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:13,304 INFO L82 PathProgramCache]: Analyzing trace with hash -307904199, now seen corresponding path program 1 times [2019-12-28 02:03:13,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:13,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731436287] [2019-12-28 02:03:13,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:13,407 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 02:03:13,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731436287] [2019-12-28 02:03:13,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:13,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:13,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [714265199] [2019-12-28 02:03:13,409 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:13,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:13,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 222 transitions. [2019-12-28 02:03:13,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:13,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-28 02:03:13,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:03:13,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:03:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:13,627 INFO L87 Difference]: Start difference. First operand 4609 states and 10154 transitions. Second operand 10 states. [2019-12-28 02:03:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:13,964 INFO L93 Difference]: Finished difference Result 5093 states and 11141 transitions. [2019-12-28 02:03:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:03:13,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-28 02:03:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:13,971 INFO L225 Difference]: With dead ends: 5093 [2019-12-28 02:03:13,971 INFO L226 Difference]: Without dead ends: 5093 [2019-12-28 02:03:13,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:03:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2019-12-28 02:03:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 4503. [2019-12-28 02:03:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-12-28 02:03:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 9963 transitions. [2019-12-28 02:03:14,016 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 9963 transitions. Word has length 98 [2019-12-28 02:03:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:14,016 INFO L462 AbstractCegarLoop]: Abstraction has 4503 states and 9963 transitions. [2019-12-28 02:03:14,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:03:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 9963 transitions. [2019-12-28 02:03:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:14,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:14,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:03:14,021 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:14,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:14,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1153746234, now seen corresponding path program 1 times [2019-12-28 02:03:14,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:14,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218236844] [2019-12-28 02:03:14,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:14,088 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 02:03:14,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218236844] [2019-12-28 02:03:14,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:14,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:14,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [733520248] [2019-12-28 02:03:14,089 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:14,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:14,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:03:14,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:14,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:03:14,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:14,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:14,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:14,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:14,206 INFO L87 Difference]: Start difference. First operand 4503 states and 9963 transitions. Second operand 4 states. [2019-12-28 02:03:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:14,451 INFO L93 Difference]: Finished difference Result 5718 states and 12590 transitions. [2019-12-28 02:03:14,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:03:14,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-28 02:03:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:14,457 INFO L225 Difference]: With dead ends: 5718 [2019-12-28 02:03:14,458 INFO L226 Difference]: Without dead ends: 5662 [2019-12-28 02:03:14,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2019-12-28 02:03:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 5357. [2019-12-28 02:03:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5357 states. [2019-12-28 02:03:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 11821 transitions. [2019-12-28 02:03:14,510 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 11821 transitions. Word has length 98 [2019-12-28 02:03:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:14,510 INFO L462 AbstractCegarLoop]: Abstraction has 5357 states and 11821 transitions. [2019-12-28 02:03:14,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 11821 transitions. [2019-12-28 02:03:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:14,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:14,515 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, 1] [2019-12-28 02:03:14,515 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:14,515 INFO L82 PathProgramCache]: Analyzing trace with hash -923463109, now seen corresponding path program 1 times [2019-12-28 02:03:14,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:14,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329294664] [2019-12-28 02:03:14,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:14,674 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 02:03:14,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329294664] [2019-12-28 02:03:14,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:14,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:03:14,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280851749] [2019-12-28 02:03:14,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:14,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:14,824 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:03:14,824 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:15,083 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-28 02:03:15,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 02:03:15,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 02:03:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-28 02:03:15,084 INFO L87 Difference]: Start difference. First operand 5357 states and 11821 transitions. Second operand 14 states. [2019-12-28 02:03:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:17,249 INFO L93 Difference]: Finished difference Result 7739 states and 16898 transitions. [2019-12-28 02:03:17,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-28 02:03:17,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-28 02:03:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:17,260 INFO L225 Difference]: With dead ends: 7739 [2019-12-28 02:03:17,260 INFO L226 Difference]: Without dead ends: 7739 [2019-12-28 02:03:17,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2019-12-28 02:03:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7739 states. [2019-12-28 02:03:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7739 to 5826. [2019-12-28 02:03:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2019-12-28 02:03:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 12786 transitions. [2019-12-28 02:03:17,331 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 12786 transitions. Word has length 98 [2019-12-28 02:03:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:17,331 INFO L462 AbstractCegarLoop]: Abstraction has 5826 states and 12786 transitions. [2019-12-28 02:03:17,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 02:03:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 12786 transitions. [2019-12-28 02:03:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:17,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:17,337 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, 1] [2019-12-28 02:03:17,337 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash -712112196, now seen corresponding path program 1 times [2019-12-28 02:03:17,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:17,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22180640] [2019-12-28 02:03:17,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:17,534 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 02:03:17,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22180640] [2019-12-28 02:03:17,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:17,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:03:17,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [905627043] [2019-12-28 02:03:17,535 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:17,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:17,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:03:17,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:17,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-28 02:03:17,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 02:03:17,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 02:03:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-28 02:03:17,804 INFO L87 Difference]: Start difference. First operand 5826 states and 12786 transitions. Second operand 14 states. [2019-12-28 02:03:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:19,916 INFO L93 Difference]: Finished difference Result 7553 states and 16479 transitions. [2019-12-28 02:03:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 02:03:19,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-28 02:03:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:19,926 INFO L225 Difference]: With dead ends: 7553 [2019-12-28 02:03:19,926 INFO L226 Difference]: Without dead ends: 7521 [2019-12-28 02:03:19,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=798, Unknown=0, NotChecked=0, Total=1056 [2019-12-28 02:03:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7521 states. [2019-12-28 02:03:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7521 to 5791. [2019-12-28 02:03:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5791 states. [2019-12-28 02:03:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 12703 transitions. [2019-12-28 02:03:19,995 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 12703 transitions. Word has length 98 [2019-12-28 02:03:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:19,995 INFO L462 AbstractCegarLoop]: Abstraction has 5791 states and 12703 transitions. [2019-12-28 02:03:19,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 02:03:19,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 12703 transitions. [2019-12-28 02:03:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:20,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:20,000 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, 1] [2019-12-28 02:03:20,000 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:20,001 INFO L82 PathProgramCache]: Analyzing trace with hash 175391485, now seen corresponding path program 1 times [2019-12-28 02:03:20,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:20,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142058270] [2019-12-28 02:03:20,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:20,142 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 02:03:20,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142058270] [2019-12-28 02:03:20,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:20,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 02:03:20,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223546787] [2019-12-28 02:03:20,143 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:20,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:20,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:03:20,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:20,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 02:03:20,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 02:03:20,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:20,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 02:03:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-28 02:03:20,399 INFO L87 Difference]: Start difference. First operand 5791 states and 12703 transitions. Second operand 15 states. [2019-12-28 02:03:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:23,206 INFO L93 Difference]: Finished difference Result 21225 states and 47175 transitions. [2019-12-28 02:03:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-28 02:03:23,206 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-28 02:03:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:23,226 INFO L225 Difference]: With dead ends: 21225 [2019-12-28 02:03:23,226 INFO L226 Difference]: Without dead ends: 13221 [2019-12-28 02:03:23,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2019-12-28 02:03:23,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13221 states. [2019-12-28 02:03:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13221 to 5768. [2019-12-28 02:03:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5768 states. [2019-12-28 02:03:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5768 states to 5768 states and 12572 transitions. [2019-12-28 02:03:23,376 INFO L78 Accepts]: Start accepts. Automaton has 5768 states and 12572 transitions. Word has length 98 [2019-12-28 02:03:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:23,377 INFO L462 AbstractCegarLoop]: Abstraction has 5768 states and 12572 transitions. [2019-12-28 02:03:23,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 02:03:23,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5768 states and 12572 transitions. [2019-12-28 02:03:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:23,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:23,385 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, 1] [2019-12-28 02:03:23,386 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:23,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1812352579, now seen corresponding path program 1 times [2019-12-28 02:03:23,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:23,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126327993] [2019-12-28 02:03:23,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:23,466 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 02:03:23,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126327993] [2019-12-28 02:03:23,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:23,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:23,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [540747685] [2019-12-28 02:03:23,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:23,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:23,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-28 02:03:23,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:23,634 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:03:23,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:23,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:23,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:23,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:23,634 INFO L87 Difference]: Start difference. First operand 5768 states and 12572 transitions. Second operand 7 states. [2019-12-28 02:03:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:24,107 INFO L93 Difference]: Finished difference Result 5281 states and 11442 transitions. [2019-12-28 02:03:24,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:03:24,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-28 02:03:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:24,114 INFO L225 Difference]: With dead ends: 5281 [2019-12-28 02:03:24,114 INFO L226 Difference]: Without dead ends: 5281 [2019-12-28 02:03:24,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2019-12-28 02:03:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 4881. [2019-12-28 02:03:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2019-12-28 02:03:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 10623 transitions. [2019-12-28 02:03:24,161 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 10623 transitions. Word has length 98 [2019-12-28 02:03:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:24,161 INFO L462 AbstractCegarLoop]: Abstraction has 4881 states and 10623 transitions. [2019-12-28 02:03:24,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 10623 transitions. [2019-12-28 02:03:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:24,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:24,166 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, 1] [2019-12-28 02:03:24,166 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1130623483, now seen corresponding path program 1 times [2019-12-28 02:03:24,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:24,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130740561] [2019-12-28 02:03:24,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:24,304 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 02:03:24,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130740561] [2019-12-28 02:03:24,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:24,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:24,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2088885807] [2019-12-28 02:03:24,305 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:24,343 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:24,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-28 02:03:24,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:24,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:03:24,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:03:24,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:03:24,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:24,552 INFO L87 Difference]: Start difference. First operand 4881 states and 10623 transitions. Second operand 8 states. [2019-12-28 02:03:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:24,833 INFO L93 Difference]: Finished difference Result 5529 states and 11939 transitions. [2019-12-28 02:03:24,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:03:24,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-12-28 02:03:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:24,841 INFO L225 Difference]: With dead ends: 5529 [2019-12-28 02:03:24,842 INFO L226 Difference]: Without dead ends: 5481 [2019-12-28 02:03:24,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2019-12-28 02:03:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 4881. [2019-12-28 02:03:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2019-12-28 02:03:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 10556 transitions. [2019-12-28 02:03:24,947 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 10556 transitions. Word has length 98 [2019-12-28 02:03:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:24,947 INFO L462 AbstractCegarLoop]: Abstraction has 4881 states and 10556 transitions. [2019-12-28 02:03:24,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:03:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 10556 transitions. [2019-12-28 02:03:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:24,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:24,957 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, 1] [2019-12-28 02:03:24,957 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash -961810619, now seen corresponding path program 2 times [2019-12-28 02:03:24,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:24,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714775008] [2019-12-28 02:03:24,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:25,226 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 02:03:25,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714775008] [2019-12-28 02:03:25,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:25,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:03:25,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512354537] [2019-12-28 02:03:25,227 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:25,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:25,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 190 transitions. [2019-12-28 02:03:25,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:25,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:03:25,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 02:03:25,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 02:03:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:03:25,495 INFO L87 Difference]: Start difference. First operand 4881 states and 10556 transitions. Second operand 12 states. [2019-12-28 02:03:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:27,304 INFO L93 Difference]: Finished difference Result 6110 states and 13148 transitions. [2019-12-28 02:03:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 02:03:27,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-12-28 02:03:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:27,312 INFO L225 Difference]: With dead ends: 6110 [2019-12-28 02:03:27,312 INFO L226 Difference]: Without dead ends: 6080 [2019-12-28 02:03:27,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-28 02:03:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2019-12-28 02:03:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 5020. [2019-12-28 02:03:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5020 states. [2019-12-28 02:03:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 10870 transitions. [2019-12-28 02:03:27,365 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 10870 transitions. Word has length 98 [2019-12-28 02:03:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:27,366 INFO L462 AbstractCegarLoop]: Abstraction has 5020 states and 10870 transitions. [2019-12-28 02:03:27,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 02:03:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 10870 transitions. [2019-12-28 02:03:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:27,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:27,372 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, 1] [2019-12-28 02:03:27,372 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:27,373 INFO L82 PathProgramCache]: Analyzing trace with hash -750459706, now seen corresponding path program 1 times [2019-12-28 02:03:27,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:27,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916971607] [2019-12-28 02:03:27,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:27,452 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 02:03:27,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916971607] [2019-12-28 02:03:27,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:27,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:27,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261505097] [2019-12-28 02:03:27,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:27,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:27,564 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 190 transitions. [2019-12-28 02:03:27,564 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:27,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:03:27,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:27,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:27,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:27,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:27,581 INFO L87 Difference]: Start difference. First operand 5020 states and 10870 transitions. Second operand 7 states. [2019-12-28 02:03:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:27,851 INFO L93 Difference]: Finished difference Result 5135 states and 11089 transitions. [2019-12-28 02:03:27,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:27,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-28 02:03:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:27,859 INFO L225 Difference]: With dead ends: 5135 [2019-12-28 02:03:27,859 INFO L226 Difference]: Without dead ends: 5135 [2019-12-28 02:03:27,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:27,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2019-12-28 02:03:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4888. [2019-12-28 02:03:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-28 02:03:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10568 transitions. [2019-12-28 02:03:27,931 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10568 transitions. Word has length 98 [2019-12-28 02:03:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:27,932 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10568 transitions. [2019-12-28 02:03:27,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10568 transitions. [2019-12-28 02:03:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:27,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:27,938 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, 1] [2019-12-28 02:03:27,938 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:27,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash -800857722, now seen corresponding path program 1 times [2019-12-28 02:03:27,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:27,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558858121] [2019-12-28 02:03:27,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:28,059 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 02:03:28,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558858121] [2019-12-28 02:03:28,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:28,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:03:28,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716382803] [2019-12-28 02:03:28,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:28,079 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:28,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-28 02:03:28,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:28,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:03:28,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:03:28,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:28,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:03:28,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:28,255 INFO L87 Difference]: Start difference. First operand 4888 states and 10568 transitions. Second operand 8 states. [2019-12-28 02:03:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:28,521 INFO L93 Difference]: Finished difference Result 6106 states and 13110 transitions. [2019-12-28 02:03:28,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:03:28,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-12-28 02:03:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:28,532 INFO L225 Difference]: With dead ends: 6106 [2019-12-28 02:03:28,532 INFO L226 Difference]: Without dead ends: 6106 [2019-12-28 02:03:28,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:03:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6106 states. [2019-12-28 02:03:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6106 to 4499. [2019-12-28 02:03:28,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-12-28 02:03:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 9680 transitions. [2019-12-28 02:03:28,633 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 9680 transitions. Word has length 98 [2019-12-28 02:03:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:28,633 INFO L462 AbstractCegarLoop]: Abstraction has 4499 states and 9680 transitions. [2019-12-28 02:03:28,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:03:28,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 9680 transitions. [2019-12-28 02:03:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:03:28,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:28,642 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, 1] [2019-12-28 02:03:28,642 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash -589506809, now seen corresponding path program 2 times [2019-12-28 02:03:28,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:28,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009775125] [2019-12-28 02:03:28,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:03:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:03:28,795 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 02:03:28,795 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 02:03:29,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:03:29 BasicIcfg [2019-12-28 02:03:29,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:03:29,032 INFO L168 Benchmark]: Toolchain (without parser) took 63161.47 ms. Allocated memory was 146.3 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 102.8 MB in the beginning and 1.1 GB in the end (delta: -989.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-28 02:03:29,032 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 02:03:29,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.86 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 158.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-28 02:03:29,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.25 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:03:29,034 INFO L168 Benchmark]: Boogie Preprocessor took 40.98 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 153.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:03:29,034 INFO L168 Benchmark]: RCFGBuilder took 830.19 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 108.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-28 02:03:29,034 INFO L168 Benchmark]: TraceAbstraction took 61395.87 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 108.1 MB in the beginning and 1.1 GB in the end (delta: -984.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-28 02:03:29,036 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.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.86 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 158.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.25 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.98 ms. Allocated memory is still 203.9 MB. Free memory was 155.4 MB in the beginning and 153.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.19 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 108.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61395.87 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 108.1 MB in the beginning and 1.1 GB in the end (delta: -984.0 MB). Peak memory consumption was 1.2 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] [L708] 0 int z = 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, z=0] [L709] 0 _Bool z$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, z=0, z$flush_delayed=0] [L710] 0 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t897; 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t897, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t898; 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t898, ((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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z 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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$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, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) 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, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) 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, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) 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, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) 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, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z 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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z 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=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 60.9s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10102 SDtfs, 13906 SDslu, 27400 SDs, 0 SdLazy, 13406 SolverSat, 658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 250 SyntacticMatches, 46 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 80551 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2734 NumberOfCodeBlocks, 2734 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2601 ConstructedInterpolants, 0 QuantifiedInterpolants, 550318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...