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_lcr.6.1.ufo.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:59:22,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:59:22,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:59:22,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:59:22,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:59:22,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:59:22,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:59:22,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:59:22,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:59:22,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:59:22,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:59:22,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:59:22,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:59:22,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:59:22,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:59:22,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:59:22,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:59:22,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:59:22,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:59:22,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:59:22,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:59:22,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:59:22,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:59:22,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:59:22,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:59:22,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:59:22,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:59:22,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:59:22,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:59:22,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:59:22,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:59:22,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:59:22,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:59:22,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:59:22,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:59:22,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:59:22,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:59:22,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:59:22,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:59:22,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:59:22,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:59:22,057 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-09-08 07:59:22,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:59:22,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:59:22,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:59:22,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:59:22,073 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:59:22,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:59:22,074 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:59:22,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:59:22,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:59:22,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:59:22,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:59:22,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:59:22,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:59:22,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:59:22,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:59:22,075 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:59:22,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:59:22,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:59:22,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:59:22,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:59:22,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:59:22,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:59:22,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:59:22,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:59:22,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:59:22,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:59:22,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:59:22,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:59:22,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:59:22,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:59:22,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:59:22,124 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:59:22,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:59:22,126 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:59:22,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2019-09-08 07:59:22,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf113574/ae02d7f439a14881927a0ce6d5c1cb5d/FLAG015f140de [2019-09-08 07:59:22,738 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:59:22,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2019-09-08 07:59:22,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf113574/ae02d7f439a14881927a0ce6d5c1cb5d/FLAG015f140de [2019-09-08 07:59:23,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf113574/ae02d7f439a14881927a0ce6d5c1cb5d [2019-09-08 07:59:23,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:59:23,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:59:23,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:59:23,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:59:23,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:59:23,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142555fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23, skipping insertion in model container [2019-09-08 07:59:23,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,097 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:59:23,142 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:59:23,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:59:23,540 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:59:23,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:59:23,650 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:59:23,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23 WrapperNode [2019-09-08 07:59:23,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:59:23,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:59:23,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:59:23,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:59:23,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (1/1) ... [2019-09-08 07:59:23,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:59:23,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:59:23,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:59:23,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:59:23,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (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-09-08 07:59:23,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:59:23,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:59:23,760 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:59:23,760 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:59:23,760 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:59:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:59:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 07:59:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-08 07:59:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:59:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:59:23,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:59:23,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:59:23,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:59:23,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:59:23,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:59:23,762 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:59:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:59:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:59:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:59:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:59:23,763 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:59:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:59:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:59:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 07:59:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 07:59:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:59:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:59:23,764 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:59:23,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:59:23,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:59:24,546 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:59:24,547 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:59:24,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:59:24 BoogieIcfgContainer [2019-09-08 07:59:24,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:59:24,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:59:24,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:59:24,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:59:24,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:59:23" (1/3) ... [2019-09-08 07:59:24,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2f235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:59:24, skipping insertion in model container [2019-09-08 07:59:24,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:59:23" (2/3) ... [2019-09-08 07:59:24,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2f235a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:59:24, skipping insertion in model container [2019-09-08 07:59:24,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:59:24" (3/3) ... [2019-09-08 07:59:24,558 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2019-09-08 07:59:24,568 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:59:24,577 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:59:24,594 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:59:24,624 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:59:24,624 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:59:24,624 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:59:24,625 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:59:24,625 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:59:24,625 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:59:24,625 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:59:24,625 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:59:24,625 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:59:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-09-08 07:59:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 07:59:24,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:24,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:24,657 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1413295764, now seen corresponding path program 1 times [2019-09-08 07:59:24,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:24,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:24,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:24,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:25,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:25,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:59:25,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:59:25,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:59:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:59:25,061 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-09-08 07:59:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:25,259 INFO L93 Difference]: Finished difference Result 240 states and 355 transitions. [2019-09-08 07:59:25,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:59:25,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 07:59:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:25,281 INFO L225 Difference]: With dead ends: 240 [2019-09-08 07:59:25,282 INFO L226 Difference]: Without dead ends: 139 [2019-09-08 07:59:25,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:59:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-08 07:59:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-08 07:59:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-08 07:59:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2019-09-08 07:59:25,340 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 68 [2019-09-08 07:59:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:25,341 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2019-09-08 07:59:25,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:59:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2019-09-08 07:59:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 07:59:25,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:25,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:25,351 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:25,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1130534395, now seen corresponding path program 1 times [2019-09-08 07:59:25,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:25,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:25,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:25,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:25,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:25,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:25,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 07:59:25,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 07:59:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 07:59:25,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:59:25,919 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand 15 states. [2019-09-08 07:59:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:34,532 INFO L93 Difference]: Finished difference Result 1572 states and 2414 transitions. [2019-09-08 07:59:34,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 07:59:34,533 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2019-09-08 07:59:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:34,570 INFO L225 Difference]: With dead ends: 1572 [2019-09-08 07:59:34,571 INFO L226 Difference]: Without dead ends: 1485 [2019-09-08 07:59:34,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1247, Invalid=4759, Unknown=0, NotChecked=0, Total=6006 [2019-09-08 07:59:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-09-08 07:59:34,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1121. [2019-09-08 07:59:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-08 07:59:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1601 transitions. [2019-09-08 07:59:34,802 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1601 transitions. Word has length 107 [2019-09-08 07:59:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:34,806 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1601 transitions. [2019-09-08 07:59:34,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 07:59:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1601 transitions. [2019-09-08 07:59:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:59:34,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:34,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:34,820 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2055527989, now seen corresponding path program 1 times [2019-09-08 07:59:34,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:34,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:34,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:34,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:34,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:34,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:59:34,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:59:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:59:34,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:59:34,936 INFO L87 Difference]: Start difference. First operand 1121 states and 1601 transitions. Second operand 3 states. [2019-09-08 07:59:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:35,044 INFO L93 Difference]: Finished difference Result 3182 states and 4612 transitions. [2019-09-08 07:59:35,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:59:35,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 07:59:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:35,058 INFO L225 Difference]: With dead ends: 3182 [2019-09-08 07:59:35,058 INFO L226 Difference]: Without dead ends: 2113 [2019-09-08 07:59:35,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:59:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-09-08 07:59:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2019-09-08 07:59:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-08 07:59:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3017 transitions. [2019-09-08 07:59:35,222 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3017 transitions. Word has length 109 [2019-09-08 07:59:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:35,223 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3017 transitions. [2019-09-08 07:59:35,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:59:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3017 transitions. [2019-09-08 07:59:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:59:35,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:35,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:35,228 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash 951736851, now seen corresponding path program 1 times [2019-09-08 07:59:35,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:35,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:35,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:35,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:35,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:35,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:59:35,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:59:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:59:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:59:35,403 INFO L87 Difference]: Start difference. First operand 2111 states and 3017 transitions. Second operand 5 states. [2019-09-08 07:59:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:36,321 INFO L93 Difference]: Finished difference Result 5325 states and 7650 transitions. [2019-09-08 07:59:36,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:59:36,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 07:59:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:36,348 INFO L225 Difference]: With dead ends: 5325 [2019-09-08 07:59:36,348 INFO L226 Difference]: Without dead ends: 3266 [2019-09-08 07:59:36,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:59:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2019-09-08 07:59:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3264. [2019-09-08 07:59:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2019-09-08 07:59:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4615 transitions. [2019-09-08 07:59:36,575 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4615 transitions. Word has length 109 [2019-09-08 07:59:36,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:36,575 INFO L475 AbstractCegarLoop]: Abstraction has 3264 states and 4615 transitions. [2019-09-08 07:59:36,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:59:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4615 transitions. [2019-09-08 07:59:36,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:59:36,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:36,579 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:36,579 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:36,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1139243427, now seen corresponding path program 1 times [2019-09-08 07:59:36,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:36,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:36,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:36,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:36,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:59:36,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:59:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:59:36,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:59:36,708 INFO L87 Difference]: Start difference. First operand 3264 states and 4615 transitions. Second operand 5 states. [2019-09-08 07:59:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:37,660 INFO L93 Difference]: Finished difference Result 9463 states and 13447 transitions. [2019-09-08 07:59:37,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:59:37,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 07:59:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:37,702 INFO L225 Difference]: With dead ends: 9463 [2019-09-08 07:59:37,703 INFO L226 Difference]: Without dead ends: 6251 [2019-09-08 07:59:37,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:59:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-09-08 07:59:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2019-09-08 07:59:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6249 states. [2019-09-08 07:59:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 8778 transitions. [2019-09-08 07:59:38,113 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 8778 transitions. Word has length 109 [2019-09-08 07:59:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:38,116 INFO L475 AbstractCegarLoop]: Abstraction has 6249 states and 8778 transitions. [2019-09-08 07:59:38,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:59:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 8778 transitions. [2019-09-08 07:59:38,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:59:38,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:38,119 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:38,119 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:38,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1804548435, now seen corresponding path program 1 times [2019-09-08 07:59:38,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:38,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:38,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:38,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:38,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:38,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:59:38,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:59:38,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:59:38,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:59:38,285 INFO L87 Difference]: Start difference. First operand 6249 states and 8778 transitions. Second operand 5 states. [2019-09-08 07:59:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:39,490 INFO L93 Difference]: Finished difference Result 18175 states and 25630 transitions. [2019-09-08 07:59:39,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:59:39,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 07:59:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:39,582 INFO L225 Difference]: With dead ends: 18175 [2019-09-08 07:59:39,582 INFO L226 Difference]: Without dead ends: 11978 [2019-09-08 07:59:39,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:59:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2019-09-08 07:59:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11976. [2019-09-08 07:59:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11976 states. [2019-09-08 07:59:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11976 states to 11976 states and 16693 transitions. [2019-09-08 07:59:40,388 INFO L78 Accepts]: Start accepts. Automaton has 11976 states and 16693 transitions. Word has length 109 [2019-09-08 07:59:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:40,389 INFO L475 AbstractCegarLoop]: Abstraction has 11976 states and 16693 transitions. [2019-09-08 07:59:40,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:59:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 11976 states and 16693 transitions. [2019-09-08 07:59:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:59:40,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:40,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:40,391 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1227473505, now seen corresponding path program 1 times [2019-09-08 07:59:40,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:40,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:40,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:40,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:59:40,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:59:40,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:59:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:59:40,503 INFO L87 Difference]: Start difference. First operand 11976 states and 16693 transitions. Second operand 5 states. [2019-09-08 07:59:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:42,124 INFO L93 Difference]: Finished difference Result 34852 states and 48751 transitions. [2019-09-08 07:59:42,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:59:42,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 07:59:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:42,238 INFO L225 Difference]: With dead ends: 34852 [2019-09-08 07:59:42,238 INFO L226 Difference]: Without dead ends: 22928 [2019-09-08 07:59:42,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:59:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22928 states. [2019-09-08 07:59:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22928 to 22926. [2019-09-08 07:59:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22926 states. [2019-09-08 07:59:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22926 states to 22926 states and 31689 transitions. [2019-09-08 07:59:44,282 INFO L78 Accepts]: Start accepts. Automaton has 22926 states and 31689 transitions. Word has length 109 [2019-09-08 07:59:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:44,283 INFO L475 AbstractCegarLoop]: Abstraction has 22926 states and 31689 transitions. [2019-09-08 07:59:44,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:59:44,283 INFO L276 IsEmpty]: Start isEmpty. Operand 22926 states and 31689 transitions. [2019-09-08 07:59:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:59:44,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:44,285 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:44,285 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:44,286 INFO L82 PathProgramCache]: Analyzing trace with hash 20035349, now seen corresponding path program 1 times [2019-09-08 07:59:44,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:44,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:44,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:44,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:44,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:59:44,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:59:44,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:59:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:59:44,440 INFO L87 Difference]: Start difference. First operand 22926 states and 31689 transitions. Second operand 5 states. [2019-09-08 07:59:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:46,434 INFO L93 Difference]: Finished difference Result 66658 states and 92467 transitions. [2019-09-08 07:59:46,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:59:46,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 07:59:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:46,593 INFO L225 Difference]: With dead ends: 66658 [2019-09-08 07:59:46,593 INFO L226 Difference]: Without dead ends: 43784 [2019-09-08 07:59:46,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:59:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43784 states. [2019-09-08 07:59:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43784 to 43782. [2019-09-08 07:59:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43782 states. [2019-09-08 07:59:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43782 states to 43782 states and 59989 transitions. [2019-09-08 07:59:48,913 INFO L78 Accepts]: Start accepts. Automaton has 43782 states and 59989 transitions. Word has length 109 [2019-09-08 07:59:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:48,913 INFO L475 AbstractCegarLoop]: Abstraction has 43782 states and 59989 transitions. [2019-09-08 07:59:48,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:59:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43782 states and 59989 transitions. [2019-09-08 07:59:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:59:48,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:48,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:48,915 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1618192801, now seen corresponding path program 1 times [2019-09-08 07:59:48,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:48,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:48,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:48,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:49,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:49,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:59:49,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:59:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:59:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:59:49,019 INFO L87 Difference]: Start difference. First operand 43782 states and 59989 transitions. Second operand 5 states. [2019-09-08 07:59:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:59:53,447 INFO L93 Difference]: Finished difference Result 127066 states and 174775 transitions. [2019-09-08 07:59:53,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:59:53,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-08 07:59:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:59:53,725 INFO L225 Difference]: With dead ends: 127066 [2019-09-08 07:59:53,726 INFO L226 Difference]: Without dead ends: 83336 [2019-09-08 07:59:53,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:59:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83336 states. [2019-09-08 07:59:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83336 to 83334. [2019-09-08 07:59:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83334 states. [2019-09-08 07:59:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83334 states to 83334 states and 113157 transitions. [2019-09-08 07:59:59,480 INFO L78 Accepts]: Start accepts. Automaton has 83334 states and 113157 transitions. Word has length 109 [2019-09-08 07:59:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:59:59,480 INFO L475 AbstractCegarLoop]: Abstraction has 83334 states and 113157 transitions. [2019-09-08 07:59:59,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:59:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 83334 states and 113157 transitions. [2019-09-08 07:59:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 07:59:59,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:59:59,482 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:59:59,482 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:59:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:59:59,482 INFO L82 PathProgramCache]: Analyzing trace with hash -422447531, now seen corresponding path program 1 times [2019-09-08 07:59:59,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:59:59,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:59:59,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:59,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:59:59,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:59:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:59:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:59:59,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:59:59,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 07:59:59,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 07:59:59,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 07:59:59,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:59:59,865 INFO L87 Difference]: Start difference. First operand 83334 states and 113157 transitions. Second operand 15 states. [2019-09-08 08:00:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:16,892 INFO L93 Difference]: Finished difference Result 222298 states and 332063 transitions. [2019-09-08 08:00:16,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-08 08:00:16,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2019-09-08 08:00:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:17,787 INFO L225 Difference]: With dead ends: 222298 [2019-09-08 08:00:17,787 INFO L226 Difference]: Without dead ends: 139016 [2019-09-08 08:00:17,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1250, Invalid=4450, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 08:00:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139016 states. [2019-09-08 08:00:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139016 to 83718. [2019-09-08 08:00:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83718 states. [2019-09-08 08:00:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83718 states to 83718 states and 113157 transitions. [2019-09-08 08:00:23,267 INFO L78 Accepts]: Start accepts. Automaton has 83718 states and 113157 transitions. Word has length 109 [2019-09-08 08:00:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:23,267 INFO L475 AbstractCegarLoop]: Abstraction has 83718 states and 113157 transitions. [2019-09-08 08:00:23,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 08:00:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 83718 states and 113157 transitions. [2019-09-08 08:00:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 08:00:23,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:23,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:00:23,269 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1388409668, now seen corresponding path program 1 times [2019-09-08 08:00:23,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:23,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:23,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:23,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:23,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:00:23,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:23,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:00:23,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:00:23,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:00:23,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:00:23,368 INFO L87 Difference]: Start difference. First operand 83718 states and 113157 transitions. Second operand 5 states. [2019-09-08 08:00:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:31,304 INFO L93 Difference]: Finished difference Result 243120 states and 330893 transitions. [2019-09-08 08:00:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:00:31,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 08:00:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:31,830 INFO L225 Difference]: With dead ends: 243120 [2019-09-08 08:00:31,830 INFO L226 Difference]: Without dead ends: 159454 [2019-09-08 08:00:31,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:00:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159454 states. [2019-09-08 08:00:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159454 to 109690. [2019-09-08 08:00:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109690 states. [2019-09-08 08:00:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109690 states to 109690 states and 148090 transitions. [2019-09-08 08:00:40,401 INFO L78 Accepts]: Start accepts. Automaton has 109690 states and 148090 transitions. Word has length 110 [2019-09-08 08:00:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:40,402 INFO L475 AbstractCegarLoop]: Abstraction has 109690 states and 148090 transitions. [2019-09-08 08:00:40,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:00:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 109690 states and 148090 transitions. [2019-09-08 08:00:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 08:00:40,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:40,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:00:40,403 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1259132667, now seen corresponding path program 1 times [2019-09-08 08:00:40,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:40,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:40,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:00:40,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:00:40,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 08:00:40,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 08:00:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 08:00:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:00:40,531 INFO L87 Difference]: Start difference. First operand 109690 states and 148090 transitions. Second operand 8 states. [2019-09-08 08:00:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:00:46,907 INFO L93 Difference]: Finished difference Result 139140 states and 198745 transitions. [2019-09-08 08:00:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 08:00:46,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-09-08 08:00:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:00:47,268 INFO L225 Difference]: With dead ends: 139140 [2019-09-08 08:00:47,268 INFO L226 Difference]: Without dead ends: 139138 [2019-09-08 08:00:47,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:00:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139138 states. [2019-09-08 08:00:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139138 to 122938. [2019-09-08 08:00:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122938 states. [2019-09-08 08:00:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122938 states to 122938 states and 161562 transitions. [2019-09-08 08:00:56,122 INFO L78 Accepts]: Start accepts. Automaton has 122938 states and 161562 transitions. Word has length 110 [2019-09-08 08:00:56,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:56,123 INFO L475 AbstractCegarLoop]: Abstraction has 122938 states and 161562 transitions. [2019-09-08 08:00:56,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 08:00:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 122938 states and 161562 transitions. [2019-09-08 08:00:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 08:00:56,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:56,166 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 08:00:56,166 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:56,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash 33206831, now seen corresponding path program 1 times [2019-09-08 08:00:56,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:56,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:56,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 08:00:56,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:00:56,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:00:56,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:56,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 08:00:56,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:00:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 08:00:57,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:00:57,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2019-09-08 08:00:57,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 08:00:57,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 08:00:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-09-08 08:00:57,261 INFO L87 Difference]: Start difference. First operand 122938 states and 161562 transitions. Second operand 27 states. [2019-09-08 08:01:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:01:46,831 INFO L93 Difference]: Finished difference Result 483074 states and 721966 transitions. [2019-09-08 08:01:46,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-09-08 08:01:46,831 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 169 [2019-09-08 08:01:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:01:49,039 INFO L225 Difference]: With dead ends: 483074 [2019-09-08 08:01:49,040 INFO L226 Difference]: Without dead ends: 369856 [2019-09-08 08:01:49,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7416 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2888, Invalid=16018, Unknown=0, NotChecked=0, Total=18906 [2019-09-08 08:01:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369856 states. [2019-09-08 08:02:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369856 to 261626. [2019-09-08 08:02:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261626 states. [2019-09-08 08:02:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261626 states to 261626 states and 343242 transitions. [2019-09-08 08:02:20,446 INFO L78 Accepts]: Start accepts. Automaton has 261626 states and 343242 transitions. Word has length 169 [2019-09-08 08:02:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:02:20,447 INFO L475 AbstractCegarLoop]: Abstraction has 261626 states and 343242 transitions. [2019-09-08 08:02:20,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 08:02:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 261626 states and 343242 transitions. [2019-09-08 08:02:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 08:02:21,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:02:21,357 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 08:02:21,358 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:02:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:02:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1613870747, now seen corresponding path program 1 times [2019-09-08 08:02:21,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:02:21,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:02:21,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:02:21,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:02:21,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:02:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:02:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 08:02:21,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:02:21,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:02:21,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:02:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:02:21,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 08:02:21,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:02:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 08:02:22,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:02:22,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 28 [2019-09-08 08:02:22,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 08:02:22,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 08:02:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2019-09-08 08:02:22,651 INFO L87 Difference]: Start difference. First operand 261626 states and 343242 transitions. Second operand 28 states. [2019-09-08 08:02:40,983 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-09-08 08:04:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:04:03,250 INFO L93 Difference]: Finished difference Result 1599908 states and 2143351 transitions. [2019-09-08 08:04:03,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-09-08 08:04:03,251 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 169 [2019-09-08 08:04:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:04:07,629 INFO L225 Difference]: With dead ends: 1599908 [2019-09-08 08:04:07,629 INFO L226 Difference]: Without dead ends: 1357762 [2019-09-08 08:04:08,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14065 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4414, Invalid=29258, Unknown=0, NotChecked=0, Total=33672 [2019-09-08 08:04:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357762 states. [2019-09-08 08:06:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357762 to 1102066. [2019-09-08 08:06:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102066 states. [2019-09-08 08:06:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102066 states to 1102066 states and 1458366 transitions. [2019-09-08 08:06:16,562 INFO L78 Accepts]: Start accepts. Automaton has 1102066 states and 1458366 transitions. Word has length 169 [2019-09-08 08:06:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:06:16,563 INFO L475 AbstractCegarLoop]: Abstraction has 1102066 states and 1458366 transitions. [2019-09-08 08:06:16,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 08:06:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1102066 states and 1458366 transitions. [2019-09-08 08:06:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 08:06:16,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:06:16,610 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 08:06:16,611 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:06:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:06:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2146993457, now seen corresponding path program 1 times [2019-09-08 08:06:16,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:06:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:06:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:06:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:06:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:06:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:06:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 08:06:16,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:06:16,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:06:16,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:06:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:06:16,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 08:06:17,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:06:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 08:06:30,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:06:30,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [14] total 27 [2019-09-08 08:06:30,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 08:06:30,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 08:06:30,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-09-08 08:06:30,554 INFO L87 Difference]: Start difference. First operand 1102066 states and 1458366 transitions. Second operand 27 states.