java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 21:00:13,820 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:00:13,821 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:00:13,831 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:00:13,831 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:00:13,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:00:13,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:00:13,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:00:13,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:00:13,836 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:00:13,836 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:00:13,836 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:00:13,837 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:00:13,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:00:13,839 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:00:13,841 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:00:13,842 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:00:13,844 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:00:13,845 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:00:13,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:00:13,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:00:13,848 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:00:13,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:00:13,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:00:13,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:00:13,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:00:13,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:00:13,852 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:00:13,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:00:13,853 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:00:13,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:00:13,853 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 21:00:13,864 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:00:13,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:00:13,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:00:13,865 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:00:13,866 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:00:13,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:00:13,866 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:00:13,866 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:00:13,867 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:00:13,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:00:13,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:00:13,867 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:00:13,867 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:00:13,867 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:00:13,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:00:13,868 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:00:13,868 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:00:13,868 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:00:13,868 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:00:13,868 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:00:13,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:00:13,869 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:00:13,869 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:00:13,869 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:00:13,869 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:00:13,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:00:13,913 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:00:13,916 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:00:13,917 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:00:13,918 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:00:13,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-02-02 21:00:14,010 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:00:14,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:00:14,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:00:14,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:00:14,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:00:14,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ff168d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14, skipping insertion in model container [2018-02-02 21:00:14,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,034 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:00:14,048 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:00:14,142 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:00:14,152 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:00:14,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14 WrapperNode [2018-02-02 21:00:14,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:00:14,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:00:14,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:00:14,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:00:14,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (1/1) ... [2018-02-02 21:00:14,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:00:14,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:00:14,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:00:14,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:00:14,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (1/1) ... No working directory specified, using /home/ultimate/work/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 [2018-02-02 21:00:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:00:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:00:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-02 21:00:14,215 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:00:14,215 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 21:00:14,215 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-02 21:00:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:00:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:00:14,216 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:00:14,308 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:00:14,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:00:14 BoogieIcfgContainer [2018-02-02 21:00:14,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:00:14,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:00:14,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:00:14,311 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:00:14,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:00:14" (1/3) ... [2018-02-02 21:00:14,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33362e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:00:14, skipping insertion in model container [2018-02-02 21:00:14,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:00:14" (2/3) ... [2018-02-02 21:00:14,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33362e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:00:14, skipping insertion in model container [2018-02-02 21:00:14,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:00:14" (3/3) ... [2018-02-02 21:00:14,314 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-02-02 21:00:14,321 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:00:14,326 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 21:00:14,348 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:00:14,349 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:00:14,349 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:00:14,349 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:00:14,349 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:00:14,349 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:00:14,349 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:00:14,349 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:00:14,349 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:00:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-02-02 21:00:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 21:00:14,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:14,363 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:14,364 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:14,367 INFO L82 PathProgramCache]: Analyzing trace with hash -42218404, now seen corresponding path program 1 times [2018-02-02 21:00:14,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:14,373 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:14,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,419 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:14,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:14,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:14,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:00:14,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:00:14,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:00:14,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:00:14,528 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-02-02 21:00:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:14,581 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-02 21:00:14,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:00:14,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 21:00:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:14,589 INFO L225 Difference]: With dead ends: 49 [2018-02-02 21:00:14,589 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 21:00:14,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:00:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 21:00:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-02-02 21:00:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 21:00:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-02 21:00:14,675 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-02-02 21:00:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:14,675 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-02 21:00:14,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:00:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-02 21:00:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 21:00:14,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:14,676 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:14,676 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:14,676 INFO L82 PathProgramCache]: Analyzing trace with hash -207595369, now seen corresponding path program 1 times [2018-02-02 21:00:14,676 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:14,676 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:14,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,677 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:14,677 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:14,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:14,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:14,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:14,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:14,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-02 21:00:14,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:00:14,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:00:14,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:00:14,762 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-02-02 21:00:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:14,813 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-02 21:00:14,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:00:14,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 21:00:14,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:14,814 INFO L225 Difference]: With dead ends: 54 [2018-02-02 21:00:14,814 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 21:00:14,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:00:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 21:00:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2018-02-02 21:00:14,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 21:00:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-02 21:00:14,820 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2018-02-02 21:00:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:14,820 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-02 21:00:14,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:00:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-02 21:00:14,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 21:00:14,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:14,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:14,821 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash -209255178, now seen corresponding path program 1 times [2018-02-02 21:00:14,821 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:14,821 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:14,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,822 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:14,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:14,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:14,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 21:00:14,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 21:00:14,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 21:00:14,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:00:14,857 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2018-02-02 21:00:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:14,877 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-02 21:00:14,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 21:00:14,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 21:00:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:14,877 INFO L225 Difference]: With dead ends: 39 [2018-02-02 21:00:14,878 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 21:00:14,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 21:00:14,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 21:00:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 21:00:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 21:00:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-02 21:00:14,881 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-02-02 21:00:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:14,881 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-02 21:00:14,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 21:00:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-02 21:00:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:00:14,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:14,882 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:14,882 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:14,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2132883772, now seen corresponding path program 2 times [2018-02-02 21:00:14,883 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:14,883 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:14,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,884 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:14,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:14,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:14,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:14,931 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:14,939 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:14,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:14,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:14,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:14,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-02 21:00:14,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:00:14,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:00:14,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:00:14,948 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-02 21:00:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:14,987 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-02 21:00:14,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:00:14,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:00:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:14,988 INFO L225 Difference]: With dead ends: 59 [2018-02-02 21:00:14,988 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 21:00:14,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:00:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 21:00:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-02-02 21:00:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 21:00:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 21:00:14,991 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2018-02-02 21:00:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:14,991 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 21:00:14,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:00:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 21:00:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:00:14,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:14,992 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:14,992 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2131223963, now seen corresponding path program 1 times [2018-02-02 21:00:14,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:14,992 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:14,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,993 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:14,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:14,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 21:00:15,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:00:15,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:00:15,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:00:15,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:00:15,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:00:15,016 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-02-02 21:00:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:15,035 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-02 21:00:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:00:15,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 21:00:15,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:15,036 INFO L225 Difference]: With dead ends: 47 [2018-02-02 21:00:15,037 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 21:00:15,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:00:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 21:00:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-02-02 21:00:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 21:00:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-02 21:00:15,041 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-02-02 21:00:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:15,041 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-02 21:00:15,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:00:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-02 21:00:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 21:00:15,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:15,042 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:15,042 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:15,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2059138999, now seen corresponding path program 3 times [2018-02-02 21:00:15,042 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:15,042 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:15,043 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,043 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:15,043 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:15,095 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:15,095 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:15,104 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-02 21:00:15,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:15,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:15,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-02 21:00:15,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:00:15,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:00:15,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:00:15,118 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-02-02 21:00:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:15,187 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-02 21:00:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:00:15,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 21:00:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:15,188 INFO L225 Difference]: With dead ends: 89 [2018-02-02 21:00:15,189 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 21:00:15,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:00:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 21:00:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-02-02 21:00:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 21:00:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-02 21:00:15,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-02-02 21:00:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:15,194 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-02 21:00:15,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:00:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-02 21:00:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 21:00:15,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:15,195 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:15,195 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash -6617899, now seen corresponding path program 1 times [2018-02-02 21:00:15,196 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:15,196 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:15,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,197 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:15,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:15,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:15,237 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:15,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-02 21:00:15,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:00:15,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:00:15,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:00:15,276 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2018-02-02 21:00:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:15,340 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-02 21:00:15,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:00:15,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-02 21:00:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:15,341 INFO L225 Difference]: With dead ends: 59 [2018-02-02 21:00:15,341 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 21:00:15,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:00:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 21:00:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 21:00:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 21:00:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-02 21:00:15,345 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-02-02 21:00:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:15,346 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-02 21:00:15,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:00:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-02 21:00:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 21:00:15,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:15,350 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:15,350 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1173615076, now seen corresponding path program 4 times [2018-02-02 21:00:15,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:15,351 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:15,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:15,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:15,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:15,409 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:15,414 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:15,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:15,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:15,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-02 21:00:15,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:00:15,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:00:15,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:00:15,421 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-02-02 21:00:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:15,514 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-02 21:00:15,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:00:15,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 21:00:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:15,515 INFO L225 Difference]: With dead ends: 94 [2018-02-02 21:00:15,515 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 21:00:15,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:00:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 21:00:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-02-02 21:00:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 21:00:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-02 21:00:15,518 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-02-02 21:00:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:15,518 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-02 21:00:15,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:00:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-02 21:00:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 21:00:15,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:15,519 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:15,519 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash 155329936, now seen corresponding path program 2 times [2018-02-02 21:00:15,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:15,519 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:15,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,520 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:15,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 21:00:15,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:15,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:15,559 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:15,565 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:15,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:15,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 21:00:15,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:15,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-02 21:00:15,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:00:15,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:00:15,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:00:15,585 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-02 21:00:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:15,625 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-02-02 21:00:15,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:00:15,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 21:00:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:15,626 INFO L225 Difference]: With dead ends: 55 [2018-02-02 21:00:15,626 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 21:00:15,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:00:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 21:00:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 21:00:15,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 21:00:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-02 21:00:15,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-02-02 21:00:15,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:15,631 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-02 21:00:15,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:00:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-02 21:00:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 21:00:15,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:15,632 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:15,632 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1011667241, now seen corresponding path program 5 times [2018-02-02 21:00:15,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:15,633 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:15,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,634 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:15,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:15,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:15,705 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:15,715 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-02 21:00:15,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:15,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:15,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-02-02 21:00:15,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:00:15,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:00:15,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:00:15,764 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2018-02-02 21:00:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:15,849 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-02 21:00:15,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:00:15,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-02-02 21:00:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:15,849 INFO L225 Difference]: With dead ends: 43 [2018-02-02 21:00:15,849 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 21:00:15,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:00:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 21:00:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 21:00:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 21:00:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-02 21:00:15,851 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-02-02 21:00:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:15,852 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-02 21:00:15,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:00:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-02 21:00:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 21:00:15,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:15,852 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:15,852 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2070263044, now seen corresponding path program 6 times [2018-02-02 21:00:15,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:15,852 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:15,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,853 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:15,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:15,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:15,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:15,909 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:15,915 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-02 21:00:15,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:15,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:15,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:15,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-02 21:00:15,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:00:15,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:00:15,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:00:15,953 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-02-02 21:00:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:16,058 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-02 21:00:16,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:00:16,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-02 21:00:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:16,059 INFO L225 Difference]: With dead ends: 48 [2018-02-02 21:00:16,059 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 21:00:16,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:00:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 21:00:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 21:00:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 21:00:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-02 21:00:16,061 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-02-02 21:00:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:16,061 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-02 21:00:16,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:00:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-02 21:00:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 21:00:16,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:16,062 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:16,062 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1122500087, now seen corresponding path program 7 times [2018-02-02 21:00:16,062 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:16,062 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:16,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,063 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:16,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:16,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:16,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:16,122 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:16,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:16,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:16,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:16,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-02 21:00:16,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:00:16,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:00:16,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:00:16,135 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-02-02 21:00:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:16,223 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-02 21:00:16,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:00:16,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-02 21:00:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:16,224 INFO L225 Difference]: With dead ends: 53 [2018-02-02 21:00:16,224 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 21:00:16,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:00:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 21:00:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 21:00:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 21:00:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-02 21:00:16,226 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-02-02 21:00:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:16,227 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-02 21:00:16,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:00:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-02 21:00:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 21:00:16,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:16,227 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:16,227 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash -676728868, now seen corresponding path program 8 times [2018-02-02 21:00:16,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:16,228 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:16,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:16,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:16,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:16,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:16,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:16,312 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:16,319 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:16,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:16,321 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:16,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:16,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-02 21:00:16,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 21:00:16,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 21:00:16,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:00:16,336 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-02-02 21:00:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:16,456 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-02 21:00:16,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:00:16,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-02 21:00:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:16,457 INFO L225 Difference]: With dead ends: 58 [2018-02-02 21:00:16,457 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 21:00:16,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 21:00:16,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 21:00:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 21:00:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 21:00:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-02 21:00:16,459 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-02-02 21:00:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:16,459 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-02 21:00:16,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 21:00:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-02 21:00:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 21:00:16,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:16,460 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:16,460 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash -633576169, now seen corresponding path program 9 times [2018-02-02 21:00:16,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:16,460 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:16,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,463 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:16,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:16,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:16,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:16,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:16,537 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:16,544 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-02 21:00:16,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:16,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:16,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:16,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-02 21:00:16,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:00:16,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:00:16,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:00:16,618 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 23 states. [2018-02-02 21:00:16,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:16,840 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-02 21:00:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:00:16,841 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-02 21:00:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:16,842 INFO L225 Difference]: With dead ends: 63 [2018-02-02 21:00:16,842 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 21:00:16,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:00:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 21:00:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-02 21:00:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 21:00:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-02 21:00:16,848 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-02-02 21:00:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:16,849 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-02 21:00:16,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:00:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-02 21:00:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 21:00:16,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:16,851 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:16,851 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1365705540, now seen corresponding path program 10 times [2018-02-02 21:00:16,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:16,851 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:16,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,852 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:16,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:16,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:16,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:16,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:16,950 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:16,959 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:16,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:16,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:16,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:16,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-02-02 21:00:16,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 21:00:16,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 21:00:16,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:00:16,974 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-02-02 21:00:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:17,115 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-02 21:00:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 21:00:17,115 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-02 21:00:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:17,116 INFO L225 Difference]: With dead ends: 68 [2018-02-02 21:00:17,116 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 21:00:17,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-02-02 21:00:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 21:00:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-02 21:00:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 21:00:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-02 21:00:17,118 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-02-02 21:00:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:17,118 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-02 21:00:17,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 21:00:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-02 21:00:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 21:00:17,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:17,119 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:17,119 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash -116235209, now seen corresponding path program 11 times [2018-02-02 21:00:17,120 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:17,120 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:17,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:17,120 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:17,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:17,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:17,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:17,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:17,253 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:17,266 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-02 21:00:17,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:17,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:17,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:17,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-02-02 21:00:17,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 21:00:17,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 21:00:17,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2018-02-02 21:00:17,370 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-02-02 21:00:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:17,699 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-02-02 21:00:17,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 21:00:17,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-02 21:00:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:17,699 INFO L225 Difference]: With dead ends: 73 [2018-02-02 21:00:17,699 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 21:00:17,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=965, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 21:00:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 21:00:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 21:00:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 21:00:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-02-02 21:00:17,702 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-02-02 21:00:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:17,702 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-02-02 21:00:17,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 21:00:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-02-02 21:00:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 21:00:17,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:17,703 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:17,704 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash -414879332, now seen corresponding path program 12 times [2018-02-02 21:00:17,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:17,704 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:17,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:17,705 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:17,705 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:17,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:17,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:17,791 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:17,792 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:17,799 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-02 21:00:17,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:17,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:17,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:17,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-02 21:00:17,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:00:17,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:00:17,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:00:17,927 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 29 states. [2018-02-02 21:00:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:18,288 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-02-02 21:00:18,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 21:00:18,288 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-02-02 21:00:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:18,289 INFO L225 Difference]: With dead ends: 78 [2018-02-02 21:00:18,289 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 21:00:18,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:00:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 21:00:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-02 21:00:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 21:00:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-02-02 21:00:18,292 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-02-02 21:00:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:18,292 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-02-02 21:00:18,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:00:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-02-02 21:00:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 21:00:18,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:18,293 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:18,293 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1135871145, now seen corresponding path program 13 times [2018-02-02 21:00:18,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:18,294 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:18,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:18,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:18,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:18,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:18,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:18,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:18,413 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:18,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:18,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:18,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-02 21:00:18,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 21:00:18,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 21:00:18,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-02 21:00:18,433 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-02-02 21:00:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:18,629 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-02-02 21:00:18,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 21:00:18,630 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 21:00:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:18,630 INFO L225 Difference]: With dead ends: 83 [2018-02-02 21:00:18,630 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 21:00:18,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:00:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 21:00:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 21:00:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 21:00:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-02-02 21:00:18,632 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-02-02 21:00:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:18,632 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-02-02 21:00:18,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 21:00:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-02-02 21:00:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 21:00:18,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:18,633 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:18,633 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:18,633 INFO L82 PathProgramCache]: Analyzing trace with hash 571297404, now seen corresponding path program 14 times [2018-02-02 21:00:18,633 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:18,633 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:18,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:18,634 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:18,634 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:18,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:18,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:18,763 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:18,763 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:18,770 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:18,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:18,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:18,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:18,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-02-02 21:00:18,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:00:18,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:00:18,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-02 21:00:18,793 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-02-02 21:00:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:18,956 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-02-02 21:00:18,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 21:00:18,956 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-02 21:00:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:18,956 INFO L225 Difference]: With dead ends: 88 [2018-02-02 21:00:18,956 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 21:00:18,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-02-02 21:00:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 21:00:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-02 21:00:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 21:00:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-02-02 21:00:18,958 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-02-02 21:00:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:18,958 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-02-02 21:00:18,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:00:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-02-02 21:00:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 21:00:18,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:18,959 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:18,959 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash 239807095, now seen corresponding path program 15 times [2018-02-02 21:00:18,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:18,959 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:18,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:18,960 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:18,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:18,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:19,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:19,075 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:19,076 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:19,088 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-02 21:00:19,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:19,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:19,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:19,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-02 21:00:19,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:00:19,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:00:19,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:19,207 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 35 states. [2018-02-02 21:00:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:19,557 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-02-02 21:00:19,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 21:00:19,557 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-02-02 21:00:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:19,558 INFO L225 Difference]: With dead ends: 93 [2018-02-02 21:00:19,558 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 21:00:19,558 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 21:00:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-02 21:00:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 21:00:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-02-02 21:00:19,560 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-02-02 21:00:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:19,560 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-02-02 21:00:19,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:00:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-02-02 21:00:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 21:00:19,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:19,561 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:19,561 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1580297380, now seen corresponding path program 16 times [2018-02-02 21:00:19,561 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:19,561 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:19,562 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:19,562 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:19,562 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:19,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:19,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:19,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:19,730 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:19,740 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:19,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:19,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:19,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:19,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-02-02 21:00:19,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 21:00:19,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 21:00:19,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:00:19,766 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-02-02 21:00:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:20,161 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-02-02 21:00:20,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 21:00:20,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-02 21:00:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:20,161 INFO L225 Difference]: With dead ends: 98 [2018-02-02 21:00:20,161 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 21:00:20,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:00:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 21:00:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-02 21:00:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 21:00:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-02-02 21:00:20,164 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-02-02 21:00:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:20,164 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-02-02 21:00:20,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 21:00:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-02-02 21:00:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 21:00:20,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:20,165 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:20,165 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:20,165 INFO L82 PathProgramCache]: Analyzing trace with hash -957222505, now seen corresponding path program 17 times [2018-02-02 21:00:20,165 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:20,165 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:20,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:20,166 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:20,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:20,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:20,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:20,330 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:20,331 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:20,339 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-02 21:00:20,339 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:20,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:20,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:20,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-02-02 21:00:20,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:00:20,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:00:20,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:00:20,496 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 37 states. [2018-02-02 21:00:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:20,911 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-02-02 21:00:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:00:20,911 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 92 [2018-02-02 21:00:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:20,912 INFO L225 Difference]: With dead ends: 103 [2018-02-02 21:00:20,912 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 21:00:20,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=610, Invalid=2252, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 21:00:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 21:00:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-02 21:00:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 21:00:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-02-02 21:00:20,915 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-02-02 21:00:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:20,915 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-02-02 21:00:20,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:00:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-02-02 21:00:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 21:00:20,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:20,916 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:20,916 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 736575548, now seen corresponding path program 18 times [2018-02-02 21:00:20,917 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:20,917 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:20,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:20,917 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:20,917 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:20,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:21,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:21,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:21,049 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:21,060 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-02 21:00:21,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:21,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:21,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:21,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-02 21:00:21,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:00:21,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:00:21,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:00:21,255 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 41 states. [2018-02-02 21:00:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:21,737 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-02-02 21:00:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 21:00:21,766 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-02-02 21:00:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:21,767 INFO L225 Difference]: With dead ends: 108 [2018-02-02 21:00:21,767 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 21:00:21,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:00:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 21:00:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-02 21:00:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 21:00:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-02-02 21:00:21,769 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-02-02 21:00:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:21,769 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-02-02 21:00:21,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:00:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-02-02 21:00:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 21:00:21,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:21,770 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:21,770 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash -878554953, now seen corresponding path program 19 times [2018-02-02 21:00:21,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:21,770 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:21,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:21,771 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:21,771 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:21,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:21,968 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:21,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:21,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:21,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:21,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:22,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:22,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-02 21:00:22,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:00:22,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:00:22,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:00:22,006 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-02-02 21:00:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:22,278 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-02-02 21:00:22,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 21:00:22,278 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-02 21:00:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:22,278 INFO L225 Difference]: With dead ends: 113 [2018-02-02 21:00:22,278 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 21:00:22,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 21:00:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 21:00:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 21:00:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 21:00:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-02-02 21:00:22,280 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-02-02 21:00:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:22,280 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-02-02 21:00:22,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:00:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-02-02 21:00:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 21:00:22,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:22,281 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:22,281 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash -399157988, now seen corresponding path program 20 times [2018-02-02 21:00:22,281 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:22,281 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:22,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:22,282 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:22,282 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:22,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:22,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:22,480 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:22,481 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:22,489 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:22,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:22,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:22,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:22,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-02-02 21:00:22,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 21:00:22,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 21:00:22,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-02 21:00:22,510 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-02-02 21:00:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:22,813 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-02-02 21:00:22,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 21:00:22,814 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-02 21:00:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:22,814 INFO L225 Difference]: With dead ends: 118 [2018-02-02 21:00:22,814 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 21:00:22,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 21:00:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 21:00:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-02 21:00:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 21:00:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-02-02 21:00:22,816 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-02-02 21:00:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:22,816 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-02-02 21:00:22,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 21:00:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-02-02 21:00:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 21:00:22,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:22,817 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:22,817 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash 792610775, now seen corresponding path program 21 times [2018-02-02 21:00:22,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:22,817 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:22,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:22,818 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:22,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:22,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:22,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:22,994 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:22,994 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:23,003 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-02 21:00:23,003 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:23,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:23,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:23,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-02-02 21:00:23,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 21:00:23,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 21:00:23,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-02 21:00:23,017 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-02-02 21:00:23,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:23,313 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-02-02 21:00:23,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 21:00:23,313 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-02 21:00:23,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:23,313 INFO L225 Difference]: With dead ends: 123 [2018-02-02 21:00:23,313 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 21:00:23,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=762, Invalid=1308, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 21:00:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 21:00:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-02 21:00:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 21:00:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-02-02 21:00:23,315 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-02-02 21:00:23,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:23,316 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-02-02 21:00:23,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 21:00:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-02-02 21:00:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 21:00:23,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:23,316 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:23,316 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1092014588, now seen corresponding path program 22 times [2018-02-02 21:00:23,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:23,316 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:23,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:23,317 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:23,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:23,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:23,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:23,554 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:23,555 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:23,563 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:23,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:23,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:23,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:23,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-02-02 21:00:23,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 21:00:23,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 21:00:23,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-02 21:00:23,584 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-02-02 21:00:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:23,956 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-02-02 21:00:23,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 21:00:23,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-02 21:00:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:23,956 INFO L225 Difference]: With dead ends: 128 [2018-02-02 21:00:23,956 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 21:00:23,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=787, Invalid=1469, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 21:00:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 21:00:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-02 21:00:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 21:00:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-02-02 21:00:23,959 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-02-02 21:00:23,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:23,959 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-02-02 21:00:23,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 21:00:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-02-02 21:00:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-02 21:00:23,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:23,959 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:23,959 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1378342647, now seen corresponding path program 23 times [2018-02-02 21:00:23,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:23,960 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:23,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:23,960 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:23,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:23,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:24,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:24,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:24,170 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:24,179 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-02 21:00:24,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:24,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:24,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:24,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-02 21:00:24,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 21:00:24,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 21:00:24,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=1729, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 21:00:24,478 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 49 states. [2018-02-02 21:00:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:25,357 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-02-02 21:00:25,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 21:00:25,357 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 122 [2018-02-02 21:00:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:25,357 INFO L225 Difference]: With dead ends: 133 [2018-02-02 21:00:25,357 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 21:00:25,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1033, Invalid=4079, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 21:00:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 21:00:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-02 21:00:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 21:00:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-02-02 21:00:25,360 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-02-02 21:00:25,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:25,360 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-02-02 21:00:25,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 21:00:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-02-02 21:00:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-02 21:00:25,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:25,361 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:25,361 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:25,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1016482084, now seen corresponding path program 24 times [2018-02-02 21:00:25,362 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:25,362 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:25,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:25,362 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:25,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:25,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:25,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:25,673 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:25,674 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:25,688 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-02 21:00:25,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:25,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:25,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:25,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-02-02 21:00:25,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:00:25,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:00:25,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:00:25,879 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 37 states. [2018-02-02 21:00:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:26,438 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-02-02 21:00:26,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 21:00:26,438 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-02-02 21:00:26,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:26,439 INFO L225 Difference]: With dead ends: 138 [2018-02-02 21:00:26,439 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 21:00:26,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1067, Invalid=2593, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:00:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 21:00:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 21:00:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 21:00:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-02-02 21:00:26,441 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-02-02 21:00:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:26,442 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-02-02 21:00:26,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:00:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-02-02 21:00:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-02 21:00:26,442 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:26,442 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:26,442 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:26,442 INFO L82 PathProgramCache]: Analyzing trace with hash 37813783, now seen corresponding path program 25 times [2018-02-02 21:00:26,442 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:26,442 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:26,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:26,443 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:26,443 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:26,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:26,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:26,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:26,791 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:26,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:26,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:26,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-02 21:00:26,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 21:00:26,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 21:00:26,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-02 21:00:26,823 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-02-02 21:00:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:27,184 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-02-02 21:00:27,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 21:00:27,184 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-02 21:00:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:27,185 INFO L225 Difference]: With dead ends: 143 [2018-02-02 21:00:27,185 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 21:00:27,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 21:00:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 21:00:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 21:00:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 21:00:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-02-02 21:00:27,187 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-02-02 21:00:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:27,187 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-02-02 21:00:27,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 21:00:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-02-02 21:00:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-02 21:00:27,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:27,188 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:27,188 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:27,188 INFO L82 PathProgramCache]: Analyzing trace with hash -24378436, now seen corresponding path program 26 times [2018-02-02 21:00:27,188 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:27,188 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:27,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:27,189 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:27,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:27,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:27,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:27,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:27,418 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:27,424 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:27,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:27,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1677 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:27,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:27,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-02-02 21:00:27,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 21:00:27,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 21:00:27,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-02 21:00:27,442 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-02-02 21:00:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:27,856 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-02-02 21:00:27,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 21:00:27,856 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-02 21:00:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:27,857 INFO L225 Difference]: With dead ends: 148 [2018-02-02 21:00:27,857 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 21:00:27,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1085, Invalid=1995, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 21:00:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 21:00:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 21:00:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 21:00:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-02-02 21:00:27,859 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-02-02 21:00:27,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:27,859 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-02-02 21:00:27,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 21:00:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-02-02 21:00:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 21:00:27,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:27,860 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:27,860 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1695826633, now seen corresponding path program 27 times [2018-02-02 21:00:27,860 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:27,860 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:27,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:27,861 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:27,861 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:27,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:28,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:28,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:28,217 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:28,237 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-02 21:00:28,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:28,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1809 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:28,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:28,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-02-02 21:00:28,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 21:00:28,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 21:00:28,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-02 21:00:28,275 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-02-02 21:00:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:28,658 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-02-02 21:00:28,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 21:00:28,658 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-02 21:00:28,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:28,659 INFO L225 Difference]: With dead ends: 153 [2018-02-02 21:00:28,659 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 21:00:28,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 21:00:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 21:00:28,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-02 21:00:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 21:00:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-02-02 21:00:28,661 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-02-02 21:00:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:28,661 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-02-02 21:00:28,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 21:00:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-02-02 21:00:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 21:00:28,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:28,662 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:28,662 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:28,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1683732636, now seen corresponding path program 28 times [2018-02-02 21:00:28,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:28,662 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:28,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:28,663 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:28,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:28,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:28,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:28,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:28,987 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:28,993 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:28,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:28,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:29,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:29,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-02-02 21:00:29,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 21:00:29,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 21:00:29,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:00:29,314 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 61 states. [2018-02-02 21:00:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:30,420 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-02-02 21:00:30,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 21:00:30,420 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-02-02 21:00:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:30,421 INFO L225 Difference]: With dead ends: 158 [2018-02-02 21:00:30,421 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 21:00:30,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:00:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 21:00:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 21:00:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 21:00:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-02-02 21:00:30,425 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-02-02 21:00:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:30,425 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-02-02 21:00:30,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 21:00:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-02-02 21:00:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-02 21:00:30,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:30,426 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:30,426 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash 621417559, now seen corresponding path program 29 times [2018-02-02 21:00:30,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:30,426 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:30,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:30,427 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:30,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:30,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:30,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:30,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:30,730 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:30,742 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-02 21:00:30,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:30,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2088 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:31,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:31,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-02-02 21:00:31,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 21:00:31,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 21:00:31,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=2701, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:00:31,046 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 61 states. [2018-02-02 21:00:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:32,190 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-02-02 21:00:32,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 21:00:32,190 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 152 [2018-02-02 21:00:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:32,191 INFO L225 Difference]: With dead ends: 163 [2018-02-02 21:00:32,191 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 21:00:32,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2681 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1564, Invalid=6446, Unknown=0, NotChecked=0, Total=8010 [2018-02-02 21:00:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 21:00:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 21:00:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 21:00:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-02-02 21:00:32,194 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-02-02 21:00:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:32,194 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-02-02 21:00:32,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 21:00:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-02-02 21:00:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 21:00:32,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:32,195 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:32,195 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:32,195 INFO L82 PathProgramCache]: Analyzing trace with hash 691459452, now seen corresponding path program 30 times [2018-02-02 21:00:32,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:32,195 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:32,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:32,195 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:32,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:32,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:32,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:32,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:32,459 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:32,474 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-02 21:00:32,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:32,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2235 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:32,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:32,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-02-02 21:00:32,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:00:32,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:00:32,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:00:32,540 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 37 states. [2018-02-02 21:00:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:33,019 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-02-02 21:00:33,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 21:00:33,020 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-02-02 21:00:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:33,020 INFO L225 Difference]: With dead ends: 168 [2018-02-02 21:00:33,020 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 21:00:33,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1562, Invalid=2860, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 21:00:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 21:00:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-02 21:00:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 21:00:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-02-02 21:00:33,024 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-02-02 21:00:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:33,024 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-02-02 21:00:33,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:00:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-02-02 21:00:33,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-02 21:00:33,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:33,025 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:33,025 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:33,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1996358519, now seen corresponding path program 31 times [2018-02-02 21:00:33,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:33,026 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:33,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:33,026 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:33,026 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:33,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:33,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:33,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:33,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:33,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:33,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:33,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-02 21:00:33,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:00:33,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:00:33,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:33,468 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-02-02 21:00:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:33,925 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-02-02 21:00:33,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 21:00:33,925 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-02 21:00:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:33,925 INFO L225 Difference]: With dead ends: 173 [2018-02-02 21:00:33,925 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 21:00:33,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 21:00:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 21:00:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-02-02 21:00:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 21:00:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-02-02 21:00:33,927 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-02-02 21:00:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:33,928 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-02-02 21:00:33,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:00:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-02-02 21:00:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-02 21:00:33,928 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:33,928 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:33,928 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash 603675228, now seen corresponding path program 32 times [2018-02-02 21:00:33,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:33,929 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:33,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:33,929 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:33,929 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:33,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:34,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:34,387 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:34,388 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:34,395 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:34,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:34,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2544 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:34,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:34,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-02 21:00:34,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 21:00:34,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 21:00:34,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:34,427 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-02-02 21:00:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:35,504 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-02-02 21:00:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 21:00:35,504 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-02 21:00:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:35,505 INFO L225 Difference]: With dead ends: 178 [2018-02-02 21:00:35,505 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 21:00:35,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 21:00:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 21:00:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-02 21:00:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 21:00:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-02-02 21:00:35,507 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-02-02 21:00:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:35,507 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-02-02 21:00:35,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 21:00:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-02-02 21:00:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 21:00:35,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:35,508 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:35,508 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1420397207, now seen corresponding path program 33 times [2018-02-02 21:00:35,508 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:35,508 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:35,509 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:35,509 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:35,509 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:35,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:35,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:35,868 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:35,868 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:35,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-02 21:00:35,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:35,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2706 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:35,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:35,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-02-02 21:00:35,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 21:00:35,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 21:00:35,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 21:00:35,898 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-02-02 21:00:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:36,473 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-02-02 21:00:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 21:00:36,473 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-02 21:00:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:36,474 INFO L225 Difference]: With dead ends: 183 [2018-02-02 21:00:36,474 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 21:00:36,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 21:00:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 21:00:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-02 21:00:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 21:00:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-02-02 21:00:36,476 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-02-02 21:00:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:36,476 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-02-02 21:00:36,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 21:00:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-02-02 21:00:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 21:00:36,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:36,477 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:36,477 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:36,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1375254724, now seen corresponding path program 34 times [2018-02-02 21:00:36,477 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:36,477 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:36,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:36,477 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:36,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:36,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:36,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:36,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:36,882 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:36,890 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:36,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:36,892 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:36,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:36,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-02-02 21:00:36,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 21:00:36,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 21:00:36,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 21:00:36,913 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-02-02 21:00:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:37,524 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-02-02 21:00:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 21:00:37,524 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-02 21:00:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:37,524 INFO L225 Difference]: With dead ends: 188 [2018-02-02 21:00:37,524 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 21:00:37,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1825, Invalid=3287, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 21:00:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 21:00:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-02 21:00:37,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 21:00:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-02-02 21:00:37,526 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-02-02 21:00:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:37,527 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-02-02 21:00:37,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 21:00:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-02-02 21:00:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-02 21:00:37,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:37,527 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:37,527 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:37,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1888573001, now seen corresponding path program 35 times [2018-02-02 21:00:37,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:37,527 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:37,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:37,528 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:37,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:37,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:37,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:37,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:37,929 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:37,947 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-02 21:00:37,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:37,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3045 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:38,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:38,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 72 [2018-02-02 21:00:38,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-02 21:00:38,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-02 21:00:38,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1367, Invalid=3889, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 21:00:38,510 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 73 states. [2018-02-02 21:00:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:40,579 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-02-02 21:00:40,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 21:00:40,580 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 182 [2018-02-02 21:00:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:40,580 INFO L225 Difference]: With dead ends: 193 [2018-02-02 21:00:40,580 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 21:00:40,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3968 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2203, Invalid=9353, Unknown=0, NotChecked=0, Total=11556 [2018-02-02 21:00:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 21:00:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-02 21:00:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 21:00:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-02-02 21:00:40,583 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-02-02 21:00:40,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:40,583 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-02-02 21:00:40,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-02 21:00:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-02-02 21:00:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-02 21:00:40,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:40,584 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:40,584 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2093442020, now seen corresponding path program 36 times [2018-02-02 21:00:40,584 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:40,584 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:40,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:40,585 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:40,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:40,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:40,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:40,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:40,960 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:40,971 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-02 21:00:40,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:40,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3222 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:41,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:41,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-02-02 21:00:41,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 21:00:41,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 21:00:41,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 21:00:41,101 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 45 states. [2018-02-02 21:00:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:41,855 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-02-02 21:00:41,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 21:00:41,855 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-02-02 21:00:41,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:41,856 INFO L225 Difference]: With dead ends: 198 [2018-02-02 21:00:41,856 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 21:00:41,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 21:00:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 21:00:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-02-02 21:00:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 21:00:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-02-02 21:00:41,858 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-02-02 21:00:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:41,858 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-02-02 21:00:41,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 21:00:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-02-02 21:00:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-02 21:00:41,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:41,859 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:41,859 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash 640639191, now seen corresponding path program 37 times [2018-02-02 21:00:41,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:41,859 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:41,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:41,860 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:41,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:41,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:42,277 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:42,277 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:42,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:42,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:42,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:42,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-02 21:00:42,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 21:00:42,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 21:00:42,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 21:00:42,308 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-02-02 21:00:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:42,917 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-02-02 21:00:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 21:00:42,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-02 21:00:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:42,918 INFO L225 Difference]: With dead ends: 203 [2018-02-02 21:00:42,918 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 21:00:42,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2226, Invalid=3780, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 21:00:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 21:00:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-02 21:00:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 21:00:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-02-02 21:00:42,920 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-02-02 21:00:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:42,921 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-02-02 21:00:42,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 21:00:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-02-02 21:00:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-02 21:00:42,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:42,921 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:42,921 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:42,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1578280708, now seen corresponding path program 38 times [2018-02-02 21:00:42,921 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:42,922 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:42,922 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:42,922 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:42,922 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:42,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:43,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:43,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:43,320 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:43,331 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:43,331 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:43,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:43,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:43,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-02-02 21:00:43,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 21:00:43,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 21:00:43,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 21:00:43,366 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-02-02 21:00:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:44,016 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-02-02 21:00:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 21:00:44,016 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-02 21:00:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:44,017 INFO L225 Difference]: With dead ends: 208 [2018-02-02 21:00:44,017 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 21:00:44,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-02-02 21:00:44,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 21:00:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-02 21:00:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 21:00:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-02-02 21:00:44,019 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-02-02 21:00:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:44,019 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-02-02 21:00:44,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 21:00:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-02-02 21:00:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-02 21:00:44,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:44,020 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:44,020 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1699590135, now seen corresponding path program 39 times [2018-02-02 21:00:44,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:44,020 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:44,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:44,021 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:44,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:44,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:44,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:44,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:44,506 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:44,518 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-02 21:00:44,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:44,520 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3783 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:44,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:44,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-02-02 21:00:44,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 21:00:44,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 21:00:44,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 21:00:44,543 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-02-02 21:00:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:45,179 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-02-02 21:00:45,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 21:00:45,179 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-02 21:00:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:45,180 INFO L225 Difference]: With dead ends: 213 [2018-02-02 21:00:45,180 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 21:00:45,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2463, Invalid=4179, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 21:00:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 21:00:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-02-02 21:00:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 21:00:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-02-02 21:00:45,182 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-02-02 21:00:45,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:45,182 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-02-02 21:00:45,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 21:00:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-02-02 21:00:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 21:00:45,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:45,183 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:45,183 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash 721649116, now seen corresponding path program 40 times [2018-02-02 21:00:45,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:45,183 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:45,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:45,184 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:45,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:45,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:45,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:45,656 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:45,657 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:45,664 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:45,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:45,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:45,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:45,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-02-02 21:00:45,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 21:00:45,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 21:00:45,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 21:00:45,717 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-02-02 21:00:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:46,884 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-02-02 21:00:46,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 21:00:46,884 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-02 21:00:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:46,885 INFO L225 Difference]: With dead ends: 218 [2018-02-02 21:00:46,885 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 21:00:46,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 21:00:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 21:00:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 21:00:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 21:00:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-02-02 21:00:46,887 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-02-02 21:00:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:46,887 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-02-02 21:00:46,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 21:00:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-02-02 21:00:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-02 21:00:46,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:46,888 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:46,888 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash 111908631, now seen corresponding path program 41 times [2018-02-02 21:00:46,888 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:46,888 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:46,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:46,888 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:46,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:46,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:47,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:47,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:47,413 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:47,428 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-02 21:00:47,428 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:47,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:47,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:47,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-02-02 21:00:47,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-02 21:00:47,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-02 21:00:47,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1847, Invalid=5293, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 21:00:47,996 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 85 states. [2018-02-02 21:00:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:50,290 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-02-02 21:00:50,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 21:00:50,291 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 212 [2018-02-02 21:00:50,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:50,291 INFO L225 Difference]: With dead ends: 223 [2018-02-02 21:00:50,291 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 21:00:50,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5507 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2950, Invalid=12800, Unknown=0, NotChecked=0, Total=15750 [2018-02-02 21:00:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 21:00:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-02 21:00:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 21:00:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-02-02 21:00:50,293 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-02-02 21:00:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:50,294 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-02-02 21:00:50,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-02-02 21:00:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-02-02 21:00:50,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-02 21:00:50,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:50,294 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:50,294 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:50,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1104743100, now seen corresponding path program 42 times [2018-02-02 21:00:50,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:50,295 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:50,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:50,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:50,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:50,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:50,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:50,797 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:50,798 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:00:50,809 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-02 21:00:50,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:50,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4389 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:50,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:50,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-02-02 21:00:50,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 21:00:50,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 21:00:50,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 21:00:50,944 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 49 states. [2018-02-02 21:00:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:51,694 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-02-02 21:00:51,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 21:00:51,694 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-02-02 21:00:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:51,694 INFO L225 Difference]: With dead ends: 228 [2018-02-02 21:00:51,695 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 21:00:51,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2936, Invalid=5254, Unknown=0, NotChecked=0, Total=8190 [2018-02-02 21:00:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 21:00:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-02-02 21:00:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 21:00:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-02-02 21:00:51,698 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-02-02 21:00:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:51,698 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-02-02 21:00:51,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 21:00:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-02-02 21:00:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-02 21:00:51,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:51,699 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:51,699 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1370166839, now seen corresponding path program 43 times [2018-02-02 21:00:51,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:51,700 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:51,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:51,700 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:51,700 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:51,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:52,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:52,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:52,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:52,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4601 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:52,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:52,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-02-02 21:00:52,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 21:00:52,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 21:00:52,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 21:00:52,284 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-02-02 21:00:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:52,996 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-02-02 21:00:53,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 21:00:53,030 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-02 21:00:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:53,031 INFO L225 Difference]: With dead ends: 233 [2018-02-02 21:00:53,031 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 21:00:53,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2973, Invalid=5037, Unknown=0, NotChecked=0, Total=8010 [2018-02-02 21:00:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 21:00:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-02-02 21:00:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-02 21:00:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-02-02 21:00:53,035 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-02-02 21:00:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:53,035 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-02-02 21:00:53,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 21:00:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-02-02 21:00:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-02 21:00:53,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:53,036 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:53,036 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:53,037 INFO L82 PathProgramCache]: Analyzing trace with hash -330563684, now seen corresponding path program 44 times [2018-02-02 21:00:53,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:53,037 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:53,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:53,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:00:53,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:53,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:53,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:53,590 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:53,591 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:00:53,601 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:00:53,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:53,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:53,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:53,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-02-02 21:00:53,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 21:00:53,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 21:00:53,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 21:00:53,742 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 55 states. [2018-02-02 21:00:54,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:54,844 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-02-02 21:00:54,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 21:00:54,844 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-02-02 21:00:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:54,845 INFO L225 Difference]: With dead ends: 238 [2018-02-02 21:00:54,845 INFO L226 Difference]: Without dead ends: 238 [2018-02-02 21:00:54,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3077, Invalid=6625, Unknown=0, NotChecked=0, Total=9702 [2018-02-02 21:00:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-02 21:00:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-02 21:00:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 21:00:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-02-02 21:00:54,849 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-02-02 21:00:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:54,849 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-02-02 21:00:54,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 21:00:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-02-02 21:00:54,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-02 21:00:54,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:54,851 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:54,851 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash 992882007, now seen corresponding path program 45 times [2018-02-02 21:00:54,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:54,851 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:54,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:54,852 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:54,852 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:54,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:55,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:55,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:55,425 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:00:55,436 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-02 21:00:55,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:55,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:55,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:55,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-02-02 21:00:55,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 21:00:55,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 21:00:55,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 21:00:55,468 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-02-02 21:00:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:56,231 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-02-02 21:00:56,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 21:00:56,231 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-02 21:00:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:56,232 INFO L225 Difference]: With dead ends: 243 [2018-02-02 21:00:56,232 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 21:00:56,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-02 21:00:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 21:00:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-02 21:00:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 21:00:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-02-02 21:00:56,234 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-02-02 21:00:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:56,234 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-02-02 21:00:56,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 21:00:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-02-02 21:00:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-02 21:00:56,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:56,235 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:56,235 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash -222667652, now seen corresponding path program 46 times [2018-02-02 21:00:56,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:56,236 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:56,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:56,236 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:56,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:56,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:56,846 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:56,846 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:56,846 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:00:56,857 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:00:56,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:56,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5267 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:56,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:56,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-02-02 21:00:56,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 21:00:56,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 21:00:56,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 21:00:56,914 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-02-02 21:00:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:00:57,849 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-02-02 21:00:57,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 21:00:57,849 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-02 21:00:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:00:57,850 INFO L225 Difference]: With dead ends: 248 [2018-02-02 21:00:57,850 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 21:00:57,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-02 21:00:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 21:00:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-02-02 21:00:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 21:00:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-02-02 21:00:57,853 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-02-02 21:00:57,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:00:57,853 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-02-02 21:00:57,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 21:00:57,853 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-02-02 21:00:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-02 21:00:57,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:00:57,854 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-02 21:00:57,854 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:00:57,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2053710729, now seen corresponding path program 47 times [2018-02-02 21:00:57,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:00:57,855 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:00:57,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:57,855 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:00:57,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:00:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:00:57,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:00:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:58,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:00:58,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:00:58,478 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:00:58,493 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-02 21:00:58,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:00:58,495 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:00:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5499 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:00:59,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:00:59,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 96 [2018-02-02 21:00:59,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-02-02 21:00:59,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-02-02 21:00:59,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2399, Invalid=6913, Unknown=0, NotChecked=0, Total=9312 [2018-02-02 21:00:59,208 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 97 states. [2018-02-02 21:01:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:02,451 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-02-02 21:01:02,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 21:01:02,451 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 242 [2018-02-02 21:01:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:02,452 INFO L225 Difference]: With dead ends: 253 [2018-02-02 21:01:02,452 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 21:01:02,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7298 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3805, Invalid=16787, Unknown=0, NotChecked=0, Total=20592 [2018-02-02 21:01:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 21:01:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-02-02 21:01:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-02 21:01:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-02-02 21:01:02,454 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-02-02 21:01:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:02,455 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-02-02 21:01:02,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-02-02 21:01:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-02-02 21:01:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-02 21:01:02,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:02,455 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:02,455 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:02,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1073602212, now seen corresponding path program 48 times [2018-02-02 21:01:02,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:02,456 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:02,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:02,456 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:02,456 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:02,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:03,133 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:03,133 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:03,133 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:01:03,150 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-02 21:01:03,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:03,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5736 backedges. 0 proven. 5736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:03,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:03,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-02-02 21:01:03,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-02 21:01:03,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-02 21:01:03,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 21:01:03,717 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 69 states. [2018-02-02 21:01:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:05,725 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-02-02 21:01:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 21:01:05,726 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-02-02 21:01:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:05,726 INFO L225 Difference]: With dead ends: 258 [2018-02-02 21:01:05,726 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 21:01:05,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-02-02 21:01:05,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 21:01:05,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-02-02 21:01:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-02 21:01:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-02-02 21:01:05,729 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-02-02 21:01:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:05,729 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-02-02 21:01:05,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-02 21:01:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-02-02 21:01:05,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-02 21:01:05,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:05,730 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:05,731 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:05,731 INFO L82 PathProgramCache]: Analyzing trace with hash -523820137, now seen corresponding path program 49 times [2018-02-02 21:01:05,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:05,731 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:05,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:05,732 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:05,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:05,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:06,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:06,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:06,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:06,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 0 proven. 5978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:06,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:06,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-02-02 21:01:06,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 21:01:06,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 21:01:06,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 21:01:06,456 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-02-02 21:01:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:07,367 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-02-02 21:01:07,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 21:01:07,367 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-02-02 21:01:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:07,368 INFO L225 Difference]: With dead ends: 263 [2018-02-02 21:01:07,368 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 21:01:07,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3828, Invalid=6474, Unknown=0, NotChecked=0, Total=10302 [2018-02-02 21:01:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 21:01:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-02-02 21:01:07,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 21:01:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-02-02 21:01:07,370 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-02-02 21:01:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:07,370 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-02-02 21:01:07,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 21:01:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-02-02 21:01:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-02 21:01:07,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:07,371 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:07,371 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1098993212, now seen corresponding path program 50 times [2018-02-02 21:01:07,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:07,372 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:07,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:07,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:07,373 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:07,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:08,074 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:08,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:08,074 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:01:08,082 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:01:08,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:08,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6225 backedges. 0 proven. 6225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:08,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:08,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-02-02 21:01:08,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 21:01:08,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 21:01:08,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 21:01:08,178 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 58 states. [2018-02-02 21:01:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:09,217 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-02-02 21:01:09,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 21:01:09,217 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-02-02 21:01:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:09,218 INFO L225 Difference]: With dead ends: 268 [2018-02-02 21:01:09,218 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 21:01:09,219 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1581 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=4042, Invalid=7514, Unknown=0, NotChecked=0, Total=11556 [2018-02-02 21:01:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 21:01:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-02-02 21:01:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 21:01:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-02-02 21:01:09,221 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-02-02 21:01:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:09,221 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-02-02 21:01:09,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 21:01:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-02-02 21:01:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-02 21:01:09,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:09,222 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:09,222 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash 169935543, now seen corresponding path program 51 times [2018-02-02 21:01:09,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:09,222 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:09,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:09,222 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:09,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:09,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:10,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:10,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:10,001 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:01:10,013 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-02 21:01:10,013 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:10,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6477 backedges. 0 proven. 6477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:10,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:10,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-02-02 21:01:10,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 21:01:10,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 21:01:10,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 21:01:10,052 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-02-02 21:01:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:10,985 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-02-02 21:01:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 21:01:10,985 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-02-02 21:01:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:10,986 INFO L225 Difference]: With dead ends: 273 [2018-02-02 21:01:10,986 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 21:01:10,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=4137, Invalid=6993, Unknown=0, NotChecked=0, Total=11130 [2018-02-02 21:01:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 21:01:10,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-02-02 21:01:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 21:01:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-02-02 21:01:10,989 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-02-02 21:01:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:10,989 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-02-02 21:01:10,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 21:01:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-02-02 21:01:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-02 21:01:10,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:10,990 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:10,990 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:10,991 INFO L82 PathProgramCache]: Analyzing trace with hash -954866916, now seen corresponding path program 52 times [2018-02-02 21:01:10,991 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:10,991 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:10,991 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:10,991 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:10,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:11,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:11,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:11,770 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:11,771 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 21:01:11,779 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 21:01:11,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:11,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:12,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:12,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-02-02 21:01:12,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-02-02 21:01:12,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-02-02 21:01:12,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-02 21:01:12,568 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 109 states. [2018-02-02 21:01:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:15,190 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-02-02 21:01:15,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 21:01:15,191 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-02-02 21:01:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:15,191 INFO L225 Difference]: With dead ends: 278 [2018-02-02 21:01:15,191 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 21:01:15,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-02 21:01:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 21:01:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-02-02 21:01:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-02 21:01:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-02-02 21:01:15,194 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-02-02 21:01:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:15,194 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-02-02 21:01:15,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-02-02 21:01:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-02-02 21:01:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-02 21:01:15,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:15,195 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:15,195 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -326731305, now seen corresponding path program 53 times [2018-02-02 21:01:15,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:15,195 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:15,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:15,196 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:15,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:15,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:15,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:15,981 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:15,982 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 21:01:16,000 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-02 21:01:16,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:16,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 6996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:16,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:16,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-02-02 21:01:16,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-02-02 21:01:16,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-02-02 21:01:16,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3023, Invalid=8749, Unknown=0, NotChecked=0, Total=11772 [2018-02-02 21:01:16,885 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 109 states. [2018-02-02 21:01:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:20,472 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-02-02 21:01:20,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 21:01:20,472 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 272 [2018-02-02 21:01:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:20,472 INFO L225 Difference]: With dead ends: 283 [2018-02-02 21:01:20,473 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 21:01:20,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9341 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4768, Invalid=21314, Unknown=0, NotChecked=0, Total=26082 [2018-02-02 21:01:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 21:01:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-02-02 21:01:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-02 21:01:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-02-02 21:01:20,475 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-02-02 21:01:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:20,475 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-02-02 21:01:20,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-02-02 21:01:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-02-02 21:01:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-02 21:01:20,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:20,476 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:20,476 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash -484581380, now seen corresponding path program 54 times [2018-02-02 21:01:20,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:20,476 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:20,476 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:20,477 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:20,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:20,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:21,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:21,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:21,279 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 21:01:21,300 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-02-02 21:01:21,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:21,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 7263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:21,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:21,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-02-02 21:01:21,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-02 21:01:21,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-02 21:01:21,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 21:01:21,408 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 61 states. [2018-02-02 21:01:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:22,542 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-02-02 21:01:22,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-02 21:01:22,543 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-02-02 21:01:22,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:22,543 INFO L225 Difference]: With dead ends: 288 [2018-02-02 21:01:22,543 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 21:01:22,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=4742, Invalid=8368, Unknown=0, NotChecked=0, Total=13110 [2018-02-02 21:01:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 21:01:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-02-02 21:01:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-02 21:01:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-02-02 21:01:22,546 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-02-02 21:01:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:22,546 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-02-02 21:01:22,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-02 21:01:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-02-02 21:01:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-02 21:01:22,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:22,547 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:22,547 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1067874057, now seen corresponding path program 55 times [2018-02-02 21:01:22,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:22,547 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:22,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:22,548 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:22,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:22,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:23,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:23,394 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:23,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:23,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7535 backedges. 0 proven. 7535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:23,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:23,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-02-02 21:01:23,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-02 21:01:23,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-02 21:01:23,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 21:01:23,442 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-02-02 21:01:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:24,522 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-02-02 21:01:24,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-02 21:01:24,522 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-02-02 21:01:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:24,523 INFO L225 Difference]: With dead ends: 293 [2018-02-02 21:01:24,523 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 21:01:24,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=4791, Invalid=8091, Unknown=0, NotChecked=0, Total=12882 [2018-02-02 21:01:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 21:01:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-02-02 21:01:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 21:01:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-02-02 21:01:24,526 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-02-02 21:01:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:24,527 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-02-02 21:01:24,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-02 21:01:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-02-02 21:01:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-02 21:01:24,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:24,528 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:24,528 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1249330396, now seen corresponding path program 56 times [2018-02-02 21:01:24,528 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:24,528 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:24,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:24,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:01:24,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:24,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:25,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:25,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:25,389 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:01:25,397 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:01:25,398 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:25,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:25,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:25,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-02-02 21:01:25,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-02 21:01:25,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-02 21:01:25,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 21:01:25,444 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-02-02 21:01:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:01:27,190 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-02-02 21:01:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 21:01:27,190 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-02-02 21:01:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:01:27,191 INFO L225 Difference]: With dead ends: 298 [2018-02-02 21:01:27,191 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 21:01:27,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4199, Invalid=9141, Unknown=0, NotChecked=0, Total=13340 [2018-02-02 21:01:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 21:01:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-02-02 21:01:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 21:01:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-02-02 21:01:27,194 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-02-02 21:01:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:01:27,194 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-02-02 21:01:27,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-02 21:01:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-02-02 21:01:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-02 21:01:27,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:01:27,196 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-02 21:01:27,196 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-02 21:01:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 729559063, now seen corresponding path program 57 times [2018-02-02 21:01:27,196 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:01:27,196 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:01:27,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:27,197 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:01:27,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:01:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:01:27,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:01:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:28,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:01:28,187 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:01:28,188 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:01:28,205 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-02-02 21:01:28,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:01:28,210 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:01:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8094 backedges. 0 proven. 8094 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:01:29,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:01:29,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-02-02 21:01:29,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-02-02 21:01:29,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-02-02 21:01:29,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-02 21:01:29,162 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 119 states. Received shutdown request... [2018-02-02 21:01:30,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 21:01:30,953 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 21:01:30,958 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 21:01:30,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:01:30 BoogieIcfgContainer [2018-02-02 21:01:30,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 21:01:30,958 INFO L168 Benchmark]: Toolchain (without parser) took 76948.18 ms. Allocated memory was 399.0 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 356.9 MB in the beginning and 392.8 MB in the end (delta: -35.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-02 21:01:30,959 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:01:30,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.64 ms. Allocated memory is still 399.0 MB. Free memory was 356.9 MB in the beginning and 348.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-02 21:01:30,959 INFO L168 Benchmark]: Boogie Preprocessor took 20.24 ms. Allocated memory is still 399.0 MB. Free memory was 348.9 MB in the beginning and 347.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:01:30,960 INFO L168 Benchmark]: RCFGBuilder took 132.27 ms. Allocated memory is still 399.0 MB. Free memory was 347.6 MB in the beginning and 334.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 21:01:30,960 INFO L168 Benchmark]: TraceAbstraction took 76648.94 ms. Allocated memory was 399.0 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 334.4 MB in the beginning and 392.8 MB in the end (delta: -58.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-02-02 21:01:30,961 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 143.64 ms. Allocated memory is still 399.0 MB. Free memory was 356.9 MB in the beginning and 348.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.24 ms. Allocated memory is still 399.0 MB. Free memory was 348.9 MB in the beginning and 347.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 132.27 ms. Allocated memory is still 399.0 MB. Free memory was 347.6 MB in the beginning and 334.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76648.94 ms. Allocated memory was 399.0 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 334.4 MB in the beginning and 392.8 MB in the end (delta: -58.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 7]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 7). Cancelled while BasicCegarLoop was constructing difference of abstraction (298states) and interpolant automaton (currently 41 states, 119 states before enhancement), while ReachableStatesComputation was computing reachable states (199 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (298states) and interpolant automaton (currently 41 states, 119 states before enhancement), while ReachableStatesComputation was computing reachable states (199 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (298states) and interpolant automaton (currently 41 states, 119 states before enhancement), while ReachableStatesComputation was computing reachable states (199 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 13]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 13). Cancelled while BasicCegarLoop was constructing difference of abstraction (298states) and interpolant automaton (currently 41 states, 119 states before enhancement), while ReachableStatesComputation was computing reachable states (199 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (298states) and interpolant automaton (currently 41 states, 119 states before enhancement), while ReachableStatesComputation was computing reachable states (199 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 76.6s OverallTime, 62 OverallIterations, 58 TraceHistogramMax, 45.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1293 SDtfs, 11742 SDslu, 26915 SDs, 0 SdLazy, 90345 SolverSat, 1880 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11897 GetRequests, 8213 SyntacticMatches, 8 SemanticMatches, 3676 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73687 ImplicationChecksByTransitivity, 43.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 61 MinimizatonAttempts, 125 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 17482 NumberOfCodeBlocks, 17482 NumberOfCodeBlocksAsserted, 972 NumberOfCheckSat, 17361 ConstructedInterpolants, 0 QuantifiedInterpolants, 11908757 SizeOfPredicates, 3 NumberOfNonLiveVariables, 19092 ConjunctsInSsa, 2415 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 33/315215 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_21-01-30-967.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/standard_strcpy_false-valid-deref_ground.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_21-01-30-967.csv Completed graceful shutdown