java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:46:38,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:46:38,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:46:38,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:46:38,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:46:38,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:46:38,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:46:38,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:46:38,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:46:38,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:46:38,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:46:38,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:46:38,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:46:38,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:46:38,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:46:38,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:46:38,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:46:38,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:46:38,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:46:38,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:46:38,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:46:38,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:46:38,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:46:38,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:46:38,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:46:38,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:46:38,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:46:38,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:46:38,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:46:38,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:46:38,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:46:38,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:46:38,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:46:38,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:46:38,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:46:38,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:46:38,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:46:38,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:46:38,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:46:38,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:46:38,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:46:38,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:46:38,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:46:38,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:46:38,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:46:38,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:46:38,830 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:46:38,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:46:38,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:46:38,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:46:38,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:46:38,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:46:38,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:46:38,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:46:38,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:46:38,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:46:38,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:46:38,834 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:46:38,834 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:46:38,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:46:38,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:46:38,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:46:38,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:46:38,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:46:38,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:46:38,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:46:38,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:46:38,836 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:46:38,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:46:38,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:46:38,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:46:39,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:46:39,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:46:39,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:46:39,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:46:39,117 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:46:39,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-13 19:46:39,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887ee3bf1/fc19b06b4bad4cc093814713df17160b/FLAG2a46c9585 [2019-10-13 19:46:39,754 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:46:39,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-13 19:46:39,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887ee3bf1/fc19b06b4bad4cc093814713df17160b/FLAG2a46c9585 [2019-10-13 19:46:40,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887ee3bf1/fc19b06b4bad4cc093814713df17160b [2019-10-13 19:46:40,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:46:40,077 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:46:40,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:46:40,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:46:40,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:46:40,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3863fac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40, skipping insertion in model container [2019-10-13 19:46:40,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,092 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:46:40,151 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:46:40,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:46:40,504 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:46:40,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:46:40,600 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:46:40,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40 WrapperNode [2019-10-13 19:46:40,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:46:40,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:46:40,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:46:40,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:46:40,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (1/1) ... [2019-10-13 19:46:40,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:46:40,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:46:40,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:46:40,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:46:40,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (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-10-13 19:46:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:46:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:46:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-13 19:46:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-13 19:46:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-13 19:46:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-13 19:46:40,750 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-13 19:46:40,750 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 19:46:40,750 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 19:46:40,750 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-13 19:46:40,750 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-13 19:46:40,750 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-13 19:46:40,750 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-13 19:46:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:46:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 19:46:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:46:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:46:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:46:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:46:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:46:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:46:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:46:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-13 19:46:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-13 19:46:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-13 19:46:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-13 19:46:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-13 19:46:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:46:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:46:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-13 19:46:40,754 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-13 19:46:40,754 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-13 19:46:40,754 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-13 19:46:40,754 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:46:40,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:46:40,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:46:41,569 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:46:41,569 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 19:46:41,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:46:41 BoogieIcfgContainer [2019-10-13 19:46:41,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:46:41,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:46:41,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:46:41,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:46:41,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:46:40" (1/3) ... [2019-10-13 19:46:41,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caf3f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:46:41, skipping insertion in model container [2019-10-13 19:46:41,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:40" (2/3) ... [2019-10-13 19:46:41,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caf3f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:46:41, skipping insertion in model container [2019-10-13 19:46:41,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:46:41" (3/3) ... [2019-10-13 19:46:41,579 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-13 19:46:41,588 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:46:41,597 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:46:41,608 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:46:41,636 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:46:41,636 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:46:41,637 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:46:41,637 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:46:41,637 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:46:41,637 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:46:41,637 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:46:41,638 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:46:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-10-13 19:46:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:46:41,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:41,674 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:46:41,676 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2019-10-13 19:46:41,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:41,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125415960] [2019-10-13 19:46:41,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:41,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:41,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:42,209 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-13 19:46:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:42,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125415960] [2019-10-13 19:46:42,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:42,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:42,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473590480] [2019-10-13 19:46:42,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:42,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:42,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:42,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:42,296 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 5 states. [2019-10-13 19:46:42,667 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-13 19:46:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:44,004 INFO L93 Difference]: Finished difference Result 423 states and 685 transitions. [2019-10-13 19:46:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:44,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-13 19:46:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:44,022 INFO L225 Difference]: With dead ends: 423 [2019-10-13 19:46:44,022 INFO L226 Difference]: Without dead ends: 217 [2019-10-13 19:46:44,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-13 19:46:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2019-10-13 19:46:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-13 19:46:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2019-10-13 19:46:44,116 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2019-10-13 19:46:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:44,117 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2019-10-13 19:46:44,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2019-10-13 19:46:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:46:44,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:44,120 INFO L380 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] [2019-10-13 19:46:44,120 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:44,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2019-10-13 19:46:44,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:44,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074065621] [2019-10-13 19:46:44,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:44,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:44,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:44,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074065621] [2019-10-13 19:46:44,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:44,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:44,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825548020] [2019-10-13 19:46:44,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:44,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:44,293 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 5 states. [2019-10-13 19:46:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:45,757 INFO L93 Difference]: Finished difference Result 433 states and 651 transitions. [2019-10-13 19:46:45,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:45,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-13 19:46:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:45,762 INFO L225 Difference]: With dead ends: 433 [2019-10-13 19:46:45,762 INFO L226 Difference]: Without dead ends: 231 [2019-10-13 19:46:45,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-13 19:46:45,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2019-10-13 19:46:45,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-13 19:46:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2019-10-13 19:46:45,812 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2019-10-13 19:46:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:45,816 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-10-13 19:46:45,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2019-10-13 19:46:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:46:45,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:45,822 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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-10-13 19:46:45,822 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2019-10-13 19:46:45,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:45,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636338267] [2019-10-13 19:46:45,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:45,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:45,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:46,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636338267] [2019-10-13 19:46:46,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:46,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:46,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439745738] [2019-10-13 19:46:46,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:46,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:46,068 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 4 states. [2019-10-13 19:46:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:47,212 INFO L93 Difference]: Finished difference Result 465 states and 697 transitions. [2019-10-13 19:46:47,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:47,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-13 19:46:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:47,217 INFO L225 Difference]: With dead ends: 465 [2019-10-13 19:46:47,217 INFO L226 Difference]: Without dead ends: 257 [2019-10-13 19:46:47,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-13 19:46:47,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2019-10-13 19:46:47,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-13 19:46:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2019-10-13 19:46:47,249 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2019-10-13 19:46:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:47,249 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2019-10-13 19:46:47,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2019-10-13 19:46:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:46:47,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:47,251 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:46:47,252 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2019-10-13 19:46:47,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:47,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619292646] [2019-10-13 19:46:47,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:47,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:47,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:47,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619292646] [2019-10-13 19:46:47,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:47,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:46:47,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935001479] [2019-10-13 19:46:47,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:46:47,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:47,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:46:47,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:47,428 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 6 states. [2019-10-13 19:46:47,836 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-13 19:46:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:49,044 INFO L93 Difference]: Finished difference Result 442 states and 655 transitions. [2019-10-13 19:46:49,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:49,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-13 19:46:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:49,047 INFO L225 Difference]: With dead ends: 442 [2019-10-13 19:46:49,047 INFO L226 Difference]: Without dead ends: 238 [2019-10-13 19:46:49,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:46:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-13 19:46:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2019-10-13 19:46:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-13 19:46:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2019-10-13 19:46:49,079 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2019-10-13 19:46:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:49,079 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2019-10-13 19:46:49,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:46:49,079 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2019-10-13 19:46:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 19:46:49,082 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:49,082 INFO L380 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] [2019-10-13 19:46:49,083 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:49,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2019-10-13 19:46:49,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:49,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132439197] [2019-10-13 19:46:49,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:49,084 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:49,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:49,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132439197] [2019-10-13 19:46:49,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:49,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:49,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680437875] [2019-10-13 19:46:49,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:49,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:49,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:49,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:49,286 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 5 states. [2019-10-13 19:46:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:50,403 INFO L93 Difference]: Finished difference Result 403 states and 594 transitions. [2019-10-13 19:46:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:50,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-13 19:46:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:50,412 INFO L225 Difference]: With dead ends: 403 [2019-10-13 19:46:50,412 INFO L226 Difference]: Without dead ends: 230 [2019-10-13 19:46:50,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-13 19:46:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2019-10-13 19:46:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-13 19:46:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-10-13 19:46:50,436 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2019-10-13 19:46:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:50,437 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-10-13 19:46:50,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-10-13 19:46:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 19:46:50,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:50,439 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:46:50,439 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:50,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:50,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2019-10-13 19:46:50,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:50,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785894342] [2019-10-13 19:46:50,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:50,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:50,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:46:50,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785894342] [2019-10-13 19:46:50,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:50,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:50,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724604269] [2019-10-13 19:46:50,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:50,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:50,592 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 5 states. [2019-10-13 19:46:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:51,966 INFO L93 Difference]: Finished difference Result 452 states and 664 transitions. [2019-10-13 19:46:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:51,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-13 19:46:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:51,970 INFO L225 Difference]: With dead ends: 452 [2019-10-13 19:46:51,971 INFO L226 Difference]: Without dead ends: 249 [2019-10-13 19:46:51,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-13 19:46:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 242. [2019-10-13 19:46:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-13 19:46:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2019-10-13 19:46:51,993 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2019-10-13 19:46:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:51,994 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2019-10-13 19:46:51,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2019-10-13 19:46:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 19:46:51,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:51,995 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:46:51,995 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:51,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2019-10-13 19:46:51,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:51,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24609580] [2019-10-13 19:46:51,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:51,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:51,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 19:46:52,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24609580] [2019-10-13 19:46:52,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:52,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:52,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529718838] [2019-10-13 19:46:52,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:52,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:52,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:52,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:52,135 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 5 states. [2019-10-13 19:46:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:53,495 INFO L93 Difference]: Finished difference Result 472 states and 692 transitions. [2019-10-13 19:46:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:53,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-13 19:46:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:53,499 INFO L225 Difference]: With dead ends: 472 [2019-10-13 19:46:53,499 INFO L226 Difference]: Without dead ends: 255 [2019-10-13 19:46:53,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-13 19:46:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2019-10-13 19:46:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-13 19:46:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-10-13 19:46:53,523 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2019-10-13 19:46:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:53,524 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-10-13 19:46:53,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-10-13 19:46:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 19:46:53,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:53,525 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:46:53,526 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2019-10-13 19:46:53,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:53,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776374815] [2019-10-13 19:46:53,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:53,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:53,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 19:46:53,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776374815] [2019-10-13 19:46:53,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:53,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:46:53,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916319918] [2019-10-13 19:46:53,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:46:53,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:53,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:46:53,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:53,682 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 6 states. [2019-10-13 19:46:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:55,083 INFO L93 Difference]: Finished difference Result 471 states and 679 transitions. [2019-10-13 19:46:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:55,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-13 19:46:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:55,086 INFO L225 Difference]: With dead ends: 471 [2019-10-13 19:46:55,086 INFO L226 Difference]: Without dead ends: 255 [2019-10-13 19:46:55,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:46:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-13 19:46:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2019-10-13 19:46:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-13 19:46:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2019-10-13 19:46:55,109 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2019-10-13 19:46:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:55,109 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2019-10-13 19:46:55,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:46:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2019-10-13 19:46:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 19:46:55,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:55,111 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:46:55,111 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2019-10-13 19:46:55,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:55,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117965217] [2019-10-13 19:46:55,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:55,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:55,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 19:46:55,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117965217] [2019-10-13 19:46:55,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:55,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:55,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130768970] [2019-10-13 19:46:55,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:55,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:55,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:55,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:55,269 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 5 states. [2019-10-13 19:46:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:56,696 INFO L93 Difference]: Finished difference Result 485 states and 701 transitions. [2019-10-13 19:46:56,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:56,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-13 19:46:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:56,700 INFO L225 Difference]: With dead ends: 485 [2019-10-13 19:46:56,700 INFO L226 Difference]: Without dead ends: 274 [2019-10-13 19:46:56,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:46:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-10-13 19:46:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 267. [2019-10-13 19:46:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-13 19:46:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2019-10-13 19:46:56,754 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2019-10-13 19:46:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:56,755 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2019-10-13 19:46:56,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2019-10-13 19:46:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 19:46:56,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:56,758 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:46:56,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2019-10-13 19:46:56,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:56,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223163097] [2019-10-13 19:46:56,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:56,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:56,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 19:46:56,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223163097] [2019-10-13 19:46:56,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:56,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:56,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081396875] [2019-10-13 19:46:56,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:56,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:56,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:56,956 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 5 states. [2019-10-13 19:46:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:58,135 INFO L93 Difference]: Finished difference Result 492 states and 705 transitions. [2019-10-13 19:46:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:58,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-13 19:46:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:58,138 INFO L225 Difference]: With dead ends: 492 [2019-10-13 19:46:58,138 INFO L226 Difference]: Without dead ends: 265 [2019-10-13 19:46:58,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:46:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-13 19:46:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 261. [2019-10-13 19:46:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-13 19:46:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-10-13 19:46:58,160 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2019-10-13 19:46:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:58,160 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-10-13 19:46:58,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-10-13 19:46:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 19:46:58,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:58,162 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:46:58,162 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:58,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2019-10-13 19:46:58,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:58,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399313738] [2019-10-13 19:46:58,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:58,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:58,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,321 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-13 19:46:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-13 19:46:58,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399313738] [2019-10-13 19:46:58,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:58,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:46:58,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373295306] [2019-10-13 19:46:58,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:46:58,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:58,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:46:58,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:46:58,395 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 6 states. [2019-10-13 19:46:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:59,885 INFO L93 Difference]: Finished difference Result 479 states and 672 transitions. [2019-10-13 19:46:59,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:59,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-13 19:46:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:59,890 INFO L225 Difference]: With dead ends: 479 [2019-10-13 19:46:59,890 INFO L226 Difference]: Without dead ends: 267 [2019-10-13 19:46:59,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:46:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-10-13 19:46:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2019-10-13 19:46:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-13 19:46:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2019-10-13 19:46:59,918 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2019-10-13 19:46:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:59,920 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2019-10-13 19:46:59,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:46:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2019-10-13 19:46:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 19:46:59,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:59,922 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:46:59,922 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2019-10-13 19:46:59,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:59,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842390202] [2019-10-13 19:46:59,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:59,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:59,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-13 19:47:00,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842390202] [2019-10-13 19:47:00,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:00,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:47:00,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662903136] [2019-10-13 19:47:00,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:00,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:00,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:00,088 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 5 states. [2019-10-13 19:47:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:01,284 INFO L93 Difference]: Finished difference Result 468 states and 670 transitions. [2019-10-13 19:47:01,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:47:01,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-13 19:47:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:01,288 INFO L225 Difference]: With dead ends: 468 [2019-10-13 19:47:01,288 INFO L226 Difference]: Without dead ends: 263 [2019-10-13 19:47:01,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-13 19:47:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 259. [2019-10-13 19:47:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-13 19:47:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2019-10-13 19:47:01,309 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2019-10-13 19:47:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:01,310 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2019-10-13 19:47:01,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2019-10-13 19:47:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 19:47:01,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:01,311 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:47:01,312 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:01,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:01,312 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2019-10-13 19:47:01,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:01,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943794136] [2019-10-13 19:47:01,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:01,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:01,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-13 19:47:01,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943794136] [2019-10-13 19:47:01,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227048510] [2019-10-13 19:47:01,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:01,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:47:01,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-13 19:47:01,677 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:47:01,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-13 19:47:01,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690057716] [2019-10-13 19:47:01,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:01,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:01,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:01,678 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 5 states. [2019-10-13 19:47:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:03,167 INFO L93 Difference]: Finished difference Result 598 states and 830 transitions. [2019-10-13 19:47:03,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:47:03,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 19:47:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:03,171 INFO L225 Difference]: With dead ends: 598 [2019-10-13 19:47:03,171 INFO L226 Difference]: Without dead ends: 356 [2019-10-13 19:47:03,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-10-13 19:47:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 304. [2019-10-13 19:47:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:47:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 415 transitions. [2019-10-13 19:47:03,214 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 415 transitions. Word has length 100 [2019-10-13 19:47:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:03,215 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 415 transitions. [2019-10-13 19:47:03,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 415 transitions. [2019-10-13 19:47:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 19:47:03,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:03,220 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:47:03,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:03,427 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1993729478, now seen corresponding path program 1 times [2019-10-13 19:47:03,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:03,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920104815] [2019-10-13 19:47:03,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:03,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:03,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-13 19:47:03,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920104815] [2019-10-13 19:47:03,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:03,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:47:03,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119038067] [2019-10-13 19:47:03,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:03,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:03,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:03,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:03,669 INFO L87 Difference]: Start difference. First operand 304 states and 415 transitions. Second operand 5 states. [2019-10-13 19:47:03,810 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-13 19:47:03,933 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-10-13 19:47:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:05,101 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2019-10-13 19:47:05,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:05,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-13 19:47:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:05,107 INFO L225 Difference]: With dead ends: 481 [2019-10-13 19:47:05,107 INFO L226 Difference]: Without dead ends: 297 [2019-10-13 19:47:05,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:47:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-13 19:47:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2019-10-13 19:47:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-13 19:47:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 397 transitions. [2019-10-13 19:47:05,134 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 397 transitions. Word has length 141 [2019-10-13 19:47:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:05,135 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 397 transitions. [2019-10-13 19:47:05,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 397 transitions. [2019-10-13 19:47:05,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 19:47:05,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:05,139 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:47:05,139 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1356364028, now seen corresponding path program 1 times [2019-10-13 19:47:05,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:05,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231051445] [2019-10-13 19:47:05,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:05,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:05,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-10-13 19:47:05,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231051445] [2019-10-13 19:47:05,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:05,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:47:05,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323372192] [2019-10-13 19:47:05,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:47:05,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:05,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:47:05,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:47:05,400 INFO L87 Difference]: Start difference. First operand 293 states and 397 transitions. Second operand 5 states. [2019-10-13 19:47:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:06,750 INFO L93 Difference]: Finished difference Result 470 states and 650 transitions. [2019-10-13 19:47:06,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:06,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-13 19:47:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:06,754 INFO L225 Difference]: With dead ends: 470 [2019-10-13 19:47:06,755 INFO L226 Difference]: Without dead ends: 285 [2019-10-13 19:47:06,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:47:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-13 19:47:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2019-10-13 19:47:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-13 19:47:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 378 transitions. [2019-10-13 19:47:06,779 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 378 transitions. Word has length 143 [2019-10-13 19:47:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:06,780 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 378 transitions. [2019-10-13 19:47:06,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:47:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 378 transitions. [2019-10-13 19:47:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 19:47:06,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:06,782 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:47:06,782 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:06,782 INFO L82 PathProgramCache]: Analyzing trace with hash -267545431, now seen corresponding path program 1 times [2019-10-13 19:47:06,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:06,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993915942] [2019-10-13 19:47:06,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:06,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:06,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-10-13 19:47:07,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993915942] [2019-10-13 19:47:07,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689630620] [2019-10-13 19:47:07,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:07,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:47:07,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 74 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 19:47:07,331 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:47:07,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-10-13 19:47:07,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767762536] [2019-10-13 19:47:07,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:47:07,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:47:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:47:07,333 INFO L87 Difference]: Start difference. First operand 281 states and 378 transitions. Second operand 6 states. [2019-10-13 19:47:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:08,837 INFO L93 Difference]: Finished difference Result 587 states and 797 transitions. [2019-10-13 19:47:08,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:08,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 19:47:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:08,845 INFO L225 Difference]: With dead ends: 587 [2019-10-13 19:47:08,845 INFO L226 Difference]: Without dead ends: 329 [2019-10-13 19:47:08,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:47:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-10-13 19:47:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 319. [2019-10-13 19:47:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-13 19:47:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 425 transitions. [2019-10-13 19:47:08,871 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 425 transitions. Word has length 144 [2019-10-13 19:47:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:08,872 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 425 transitions. [2019-10-13 19:47:08,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:47:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 425 transitions. [2019-10-13 19:47:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-13 19:47:08,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:08,875 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:47:09,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:09,080 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:09,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1984275244, now seen corresponding path program 2 times [2019-10-13 19:47:09,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:09,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008207208] [2019-10-13 19:47:09,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:09,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:09,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-10-13 19:47:09,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008207208] [2019-10-13 19:47:09,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:47:09,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:47:09,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834549091] [2019-10-13 19:47:09,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:47:09,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:47:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:47:09,452 INFO L87 Difference]: Start difference. First operand 319 states and 425 transitions. Second operand 6 states. [2019-10-13 19:47:09,978 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-10-13 19:47:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:10,884 INFO L93 Difference]: Finished difference Result 495 states and 677 transitions. [2019-10-13 19:47:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:47:10,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-13 19:47:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:10,889 INFO L225 Difference]: With dead ends: 495 [2019-10-13 19:47:10,889 INFO L226 Difference]: Without dead ends: 323 [2019-10-13 19:47:10,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:47:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-13 19:47:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-10-13 19:47:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-13 19:47:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 419 transitions. [2019-10-13 19:47:10,917 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 419 transitions. Word has length 183 [2019-10-13 19:47:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:10,918 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 419 transitions. [2019-10-13 19:47:10,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:47:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 419 transitions. [2019-10-13 19:47:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-13 19:47:10,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:10,921 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:47:10,921 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1391084918, now seen corresponding path program 2 times [2019-10-13 19:47:10,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:10,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623066211] [2019-10-13 19:47:10,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:10,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:10,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-13 19:47:11,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623066211] [2019-10-13 19:47:11,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53933675] [2019-10-13 19:47:11,264 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:11,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-13 19:47:11,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:47:11,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:47:11,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-13 19:47:11,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:47:11,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-13 19:47:11,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770487564] [2019-10-13 19:47:11,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:47:11,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:11,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:47:11,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:11,532 INFO L87 Difference]: Start difference. First operand 319 states and 419 transitions. Second operand 4 states. [2019-10-13 19:47:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:11,582 INFO L93 Difference]: Finished difference Result 490 states and 667 transitions. [2019-10-13 19:47:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:47:11,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-10-13 19:47:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:11,585 INFO L225 Difference]: With dead ends: 490 [2019-10-13 19:47:11,585 INFO L226 Difference]: Without dead ends: 325 [2019-10-13 19:47:11,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:47:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-13 19:47:11,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2019-10-13 19:47:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-13 19:47:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2019-10-13 19:47:11,611 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 190 [2019-10-13 19:47:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:11,613 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2019-10-13 19:47:11,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:47:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2019-10-13 19:47:11,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-13 19:47:11,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:11,616 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:47:11,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:11,821 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:11,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 246207847, now seen corresponding path program 1 times [2019-10-13 19:47:11,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:11,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713431410] [2019-10-13 19:47:11,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:11,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:11,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 140 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-13 19:47:12,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713431410] [2019-10-13 19:47:12,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110699505] [2019-10-13 19:47:12,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:12,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:47:12,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:47:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-10-13 19:47:12,484 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:47:12,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2019-10-13 19:47:12,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803335738] [2019-10-13 19:47:12,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:47:12,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:47:12,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:47:12,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:47:12,487 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 7 states. [2019-10-13 19:47:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:47:14,114 INFO L93 Difference]: Finished difference Result 565 states and 760 transitions. [2019-10-13 19:47:14,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:47:14,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-10-13 19:47:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:47:14,121 INFO L225 Difference]: With dead ends: 565 [2019-10-13 19:47:14,121 INFO L226 Difference]: Without dead ends: 328 [2019-10-13 19:47:14,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:47:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-13 19:47:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 302. [2019-10-13 19:47:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-13 19:47:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 391 transitions. [2019-10-13 19:47:14,162 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 391 transitions. Word has length 202 [2019-10-13 19:47:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:47:14,163 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 391 transitions. [2019-10-13 19:47:14,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:47:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 391 transitions. [2019-10-13 19:47:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-13 19:47:14,166 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:47:14,166 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:47:14,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:14,382 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:47:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:47:14,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1448564390, now seen corresponding path program 1 times [2019-10-13 19:47:14,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:47:14,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173605593] [2019-10-13 19:47:14,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:14,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:47:14,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:47:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-10-13 19:47:14,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173605593] [2019-10-13 19:47:14,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087123706] [2019-10-13 19:47:14,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:47:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:47:15,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:47:15,065 INFO L279 TraceCheckSpWp]: Computing forward predicates...