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-c17473d-m [2018-02-04 17:39:53,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:39:53,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:39:53,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:39:53,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:39:53,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:39:53,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:39:53,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:39:53,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:39:53,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:39:53,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:39:53,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:39:53,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:39:53,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:39:53,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:39:53,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:39:53,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:39:53,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:39:53,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:39:53,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:39:53,386 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:39:53,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:39:53,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:39:53,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:39:53,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:39:53,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:39:53,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:39:53,390 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:39:53,391 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:39:53,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:39:53,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:39:53,392 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-04 17:39:53,401 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:39:53,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:39:53,403 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:39:53,403 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:39:53,403 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:39:53,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:39:53,403 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:39:53,404 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:39:53,404 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:39:53,404 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:39:53,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:39:53,404 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:39:53,404 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:39:53,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:39:53,405 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:39:53,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:39:53,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:39:53,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:39:53,405 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:39:53,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:39:53,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:39:53,406 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:39:53,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:39:53,406 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:39:53,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:39:53,450 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:39:53,453 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:39:53,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:39:53,454 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:39:53,455 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-04 17:39:53,558 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:39:53,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:39:53,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:39:53,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:39:53,566 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:39:53,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51224118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53, skipping insertion in model container [2018-02-04 17:39:53,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,583 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:39:53,595 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:39:53,706 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:39:53,718 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:39:53,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53 WrapperNode [2018-02-04 17:39:53,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:39:53,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:39:53,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:39:53,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:39:53,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (1/1) ... [2018-02-04 17:39:53,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:39:53,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:39:53,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:39:53,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:39:53,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (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-04 17:39:53,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:39:53,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:39:53,776 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 17:39:53,777 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:39:53,777 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 17:39:53,777 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 17:39:53,777 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:39:53,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:39:53,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:39:53,878 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:39:53,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:39:53 BoogieIcfgContainer [2018-02-04 17:39:53,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:39:53,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:39:53,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:39:53,881 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:39:53,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:39:53" (1/3) ... [2018-02-04 17:39:53,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d70ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:39:53, skipping insertion in model container [2018-02-04 17:39:53,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:39:53" (2/3) ... [2018-02-04 17:39:53,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d70ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:39:53, skipping insertion in model container [2018-02-04 17:39:53,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:39:53" (3/3) ... [2018-02-04 17:39:53,883 INFO L107 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-02-04 17:39:53,889 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:39:53,894 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 17:39:53,922 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:39:53,922 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:39:53,922 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:39:53,922 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:39:53,922 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:39:53,922 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:39:53,922 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:39:53,922 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:39:53,923 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:39:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-02-04 17:39:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 17:39:53,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:53,938 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:53,938 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash -42218404, now seen corresponding path program 1 times [2018-02-04 17:39:53,942 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:53,942 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:53,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:53,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:53,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,078 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-04 17:39:54,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:39:54,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:39:54,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:39:54,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:39:54,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:39:54,098 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-02-04 17:39:54,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:54,155 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 17:39:54,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:39:54,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 17:39:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:54,163 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:39:54,163 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 17:39:54,164 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-04 17:39:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 17:39:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-02-04 17:39:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 17:39:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-04 17:39:54,226 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 7 [2018-02-04 17:39:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:54,227 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-04 17:39:54,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:39:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-04 17:39:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:39:54,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:54,228 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:54,228 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash -207595369, now seen corresponding path program 1 times [2018-02-04 17:39:54,229 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:54,229 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:54,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,230 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:54,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,263 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-04 17:39:54,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:54,263 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:54,264 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:54,284 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-04 17:39:54,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:54,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-02-04 17:39:54,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:39:54,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:39:54,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:39:54,286 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-02-04 17:39:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:54,325 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 17:39:54,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:39:54,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 17:39:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:54,326 INFO L225 Difference]: With dead ends: 54 [2018-02-04 17:39:54,326 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 17:39:54,327 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-04 17:39:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 17:39:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2018-02-04 17:39:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:39:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-04 17:39:54,332 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2018-02-04 17:39:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:54,332 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-04 17:39:54,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:39:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-04 17:39:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 17:39:54,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:54,333 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:54,333 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:54,334 INFO L82 PathProgramCache]: Analyzing trace with hash -209255178, now seen corresponding path program 1 times [2018-02-04 17:39:54,334 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:54,334 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:54,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,335 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:54,335 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,361 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-04 17:39:54,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:39:54,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:39:54,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:39:54,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:39:54,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:39:54,362 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2018-02-04 17:39:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:54,386 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 17:39:54,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:39:54,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-04 17:39:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:54,387 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:39:54,387 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 17:39:54,387 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-04 17:39:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 17:39:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 17:39:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:39:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 17:39:54,389 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 12 [2018-02-04 17:39:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:54,389 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 17:39:54,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:39:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 17:39:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:39:54,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:54,390 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:54,390 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2132883772, now seen corresponding path program 2 times [2018-02-04 17:39:54,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:54,390 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:54,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:54,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,453 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-04 17:39:54,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:54,453 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:54,454 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:39:54,466 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:39:54,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:54,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:54,475 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-04 17:39:54,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:54,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-02-04 17:39:54,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:39:54,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:39:54,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:39:54,476 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 17:39:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:54,530 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-02-04 17:39:54,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:39:54,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 17:39:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:54,532 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:39:54,532 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 17:39:54,532 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-04 17:39:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 17:39:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-02-04 17:39:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:39:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 17:39:54,536 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 17 [2018-02-04 17:39:54,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:54,537 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 17:39:54,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:39:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 17:39:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:39:54,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:54,537 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:54,537 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:54,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2131223963, now seen corresponding path program 1 times [2018-02-04 17:39:54,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:54,538 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:54,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,539 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:54,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,563 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-04 17:39:54,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:39:54,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:39:54,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:39:54,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:39:54,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:39:54,564 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 3 states. [2018-02-04 17:39:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:54,583 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-04 17:39:54,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:39:54,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 17:39:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:54,585 INFO L225 Difference]: With dead ends: 47 [2018-02-04 17:39:54,585 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 17:39:54,585 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-04 17:39:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 17:39:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-02-04 17:39:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:39:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-04 17:39:54,589 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 17 [2018-02-04 17:39:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:54,590 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-04 17:39:54,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:39:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-04 17:39:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:39:54,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:54,590 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:54,590 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2059138999, now seen corresponding path program 3 times [2018-02-04 17:39:54,591 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:54,591 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:54,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:54,592 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,643 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-04 17:39:54,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:54,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:54,643 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:39:54,649 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:39:54,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:54,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:54,656 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-04 17:39:54,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:54,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 17:39:54,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:39:54,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:39:54,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:39:54,657 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2018-02-04 17:39:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:54,732 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-04 17:39:54,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:39:54,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 17:39:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:54,733 INFO L225 Difference]: With dead ends: 89 [2018-02-04 17:39:54,733 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 17:39:54,734 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-04 17:39:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 17:39:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2018-02-04 17:39:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:39:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 17:39:54,736 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 22 [2018-02-04 17:39:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:54,737 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 17:39:54,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:39:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 17:39:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:39:54,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:54,737 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-04 17:39:54,737 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash -6617899, now seen corresponding path program 1 times [2018-02-04 17:39:54,737 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:54,738 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:54,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,738 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:54,738 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,769 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-04 17:39:54,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:54,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:54,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:54,793 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-04 17:39:54,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:54,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 17:39:54,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:39:54,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:39:54,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:39:54,795 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 8 states. [2018-02-04 17:39:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:54,852 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 17:39:54,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:39:54,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-04 17:39:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:54,853 INFO L225 Difference]: With dead ends: 59 [2018-02-04 17:39:54,853 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 17:39:54,853 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-04 17:39:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 17:39:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 17:39:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:39:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 17:39:54,857 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 27 [2018-02-04 17:39:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:54,857 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 17:39:54,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:39:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 17:39:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:39:54,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:54,858 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:54,858 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1173615076, now seen corresponding path program 4 times [2018-02-04 17:39:54,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:54,859 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:54,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:54,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:54,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:54,923 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-04 17:39:54,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:54,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:54,924 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:39:54,931 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:39:54,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:54,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:54,940 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-04 17:39:54,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:54,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 17:39:54,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:39:54,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:39:54,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:39:54,941 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-02-04 17:39:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:55,039 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-04 17:39:55,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:39:55,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 17:39:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:55,041 INFO L225 Difference]: With dead ends: 94 [2018-02-04 17:39:55,041 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 17:39:55,041 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-04 17:39:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 17:39:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-02-04 17:39:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 17:39:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-04 17:39:55,045 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2018-02-04 17:39:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:55,046 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-04 17:39:55,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:39:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-04 17:39:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:39:55,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:55,047 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-04 17:39:55,047 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash 155329936, now seen corresponding path program 2 times [2018-02-04 17:39:55,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:55,047 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:55,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,048 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:55,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:55,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:55,088 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-04 17:39:55,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:55,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:55,089 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:39:55,097 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:39:55,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:55,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:55,106 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-04 17:39:55,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:55,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 17:39:55,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:39:55,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:39:55,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:39:55,108 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-04 17:39:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:55,139 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-02-04 17:39:55,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:39:55,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 17:39:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:55,140 INFO L225 Difference]: With dead ends: 55 [2018-02-04 17:39:55,140 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:39:55,140 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-04 17:39:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:39:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 17:39:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:39:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-04 17:39:55,143 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2018-02-04 17:39:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:55,144 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-04 17:39:55,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:39:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-04 17:39:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:39:55,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:55,145 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:55,145 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1011667241, now seen corresponding path program 5 times [2018-02-04 17:39:55,145 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:55,145 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:55,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,146 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:55,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:55,152 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:55,218 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-04 17:39:55,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:55,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:55,219 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:39:55,228 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 17:39:55,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:55,230 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:55,270 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-04 17:39:55,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:55,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-02-04 17:39:55,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:39:55,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:39:55,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:39:55,272 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2018-02-04 17:39:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:55,364 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 17:39:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:39:55,365 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-02-04 17:39:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:55,365 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:39:55,365 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:39:55,366 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-04 17:39:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:39:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 17:39:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 17:39:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-04 17:39:55,367 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-02-04 17:39:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:55,367 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-04 17:39:55,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:39:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-04 17:39:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:39:55,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:55,368 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:55,368 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:55,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2070263044, now seen corresponding path program 6 times [2018-02-04 17:39:55,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:55,368 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:55,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,369 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:55,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:55,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:55,424 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-04 17:39:55,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:55,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:55,424 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:39:55,431 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-04 17:39:55,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:55,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:55,481 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-04 17:39:55,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:55,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-02-04 17:39:55,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:39:55,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:39:55,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:39:55,483 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-02-04 17:39:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:55,574 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-04 17:39:55,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:39:55,574 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 17:39:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:55,575 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:39:55,575 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 17:39:55,575 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-04 17:39:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 17:39:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 17:39:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:39:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-04 17:39:55,577 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 37 [2018-02-04 17:39:55,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:55,578 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-04 17:39:55,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:39:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-04 17:39:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:39:55,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:55,579 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:55,579 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:55,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1122500087, now seen corresponding path program 7 times [2018-02-04 17:39:55,579 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:55,579 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:55,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,580 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:55,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:55,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:55,647 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-04 17:39:55,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:55,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:55,648 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:55,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:55,662 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-04 17:39:55,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:55,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 17:39:55,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:39:55,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:39:55,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:39:55,663 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2018-02-04 17:39:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:55,768 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-02-04 17:39:55,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:39:55,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 17:39:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:55,770 INFO L225 Difference]: With dead ends: 53 [2018-02-04 17:39:55,770 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 17:39:55,770 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-04 17:39:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 17:39:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 17:39:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 17:39:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-02-04 17:39:55,773 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-02-04 17:39:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:55,773 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-02-04 17:39:55,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:39:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-02-04 17:39:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 17:39:55,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:55,774 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:55,774 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash -676728868, now seen corresponding path program 8 times [2018-02-04 17:39:55,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:55,775 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:55,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,775 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:55,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:55,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:55,864 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-04 17:39:55,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:55,864 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:55,865 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:39:55,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:39:55,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:55,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:55,889 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-04 17:39:55,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:55,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-02-04 17:39:55,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:39:55,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:39:55,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:39:55,890 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 11 states. [2018-02-04 17:39:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:56,059 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-04 17:39:56,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:39:56,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-02-04 17:39:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:56,060 INFO L225 Difference]: With dead ends: 58 [2018-02-04 17:39:56,060 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 17:39:56,060 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-04 17:39:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 17:39:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-04 17:39:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 17:39:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-04 17:39:56,062 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 47 [2018-02-04 17:39:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:56,062 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-04 17:39:56,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:39:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-04 17:39:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 17:39:56,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:56,063 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:56,063 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash -633576169, now seen corresponding path program 9 times [2018-02-04 17:39:56,063 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:56,063 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:56,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:56,064 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:56,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:56,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:56,142 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-04 17:39:56,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:56,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:56,142 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:39:56,151 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 17:39:56,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:56,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:56,229 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-04 17:39:56,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:56,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 17:39:56,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:39:56,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:39:56,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:39:56,231 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 23 states. [2018-02-04 17:39:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:56,441 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-04 17:39:56,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:39:56,441 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-04 17:39:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:56,442 INFO L225 Difference]: With dead ends: 63 [2018-02-04 17:39:56,443 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 17:39:56,443 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-04 17:39:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 17:39:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 17:39:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 17:39:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-04 17:39:56,446 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-02-04 17:39:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:56,446 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-04 17:39:56,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:39:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-04 17:39:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 17:39:56,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:56,447 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:56,447 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1365705540, now seen corresponding path program 10 times [2018-02-04 17:39:56,448 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:56,448 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:56,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:56,449 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:56,455 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:56,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:56,528 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-04 17:39:56,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:56,529 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:56,529 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:39:56,534 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:39:56,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:56,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:56,545 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-04 17:39:56,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:56,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-02-04 17:39:56,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 17:39:56,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 17:39:56,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:39:56,546 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-02-04 17:39:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:56,685 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-04 17:39:56,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:39:56,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2018-02-04 17:39:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:56,686 INFO L225 Difference]: With dead ends: 68 [2018-02-04 17:39:56,686 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 17:39:56,686 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-04 17:39:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 17:39:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 17:39:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 17:39:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-04 17:39:56,689 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 57 [2018-02-04 17:39:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:56,689 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-04 17:39:56,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 17:39:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-04 17:39:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 17:39:56,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:56,691 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:56,691 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash -116235209, now seen corresponding path program 11 times [2018-02-04 17:39:56,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:56,691 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:56,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:56,692 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:56,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:56,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:56,780 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-04 17:39:56,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:56,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:56,781 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:39:56,803 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-02-04 17:39:56,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:56,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:56,889 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-04 17:39:56,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:56,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-02-04 17:39:56,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:39:56,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:39:56,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:39:56,890 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 25 states. [2018-02-04 17:39:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:57,213 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-02-04 17:39:57,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:39:57,213 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-02-04 17:39:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:57,214 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:39:57,214 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:39:57,214 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-04 17:39:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:39:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 17:39:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 17:39:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-02-04 17:39:57,216 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-02-04 17:39:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:57,216 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-02-04 17:39:57,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:39:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-02-04 17:39:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 17:39:57,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:57,217 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:57,217 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash -414879332, now seen corresponding path program 12 times [2018-02-04 17:39:57,217 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:57,217 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:57,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:57,217 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:57,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:57,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:57,364 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-04 17:39:57,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:57,364 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:57,365 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:39:57,377 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-02-04 17:39:57,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:57,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:57,507 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-04 17:39:57,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:57,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-02-04 17:39:57,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:39:57,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:39:57,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:39:57,509 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 29 states. [2018-02-04 17:39:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:57,821 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-02-04 17:39:57,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:39:57,821 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 67 [2018-02-04 17:39:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:57,822 INFO L225 Difference]: With dead ends: 78 [2018-02-04 17:39:57,822 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 17:39:57,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:39:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 17:39:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-02-04 17:39:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 17:39:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-02-04 17:39:57,825 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 67 [2018-02-04 17:39:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:57,825 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-02-04 17:39:57,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:39:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-02-04 17:39:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-04 17:39:57,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:57,826 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:57,826 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1135871145, now seen corresponding path program 13 times [2018-02-04 17:39:57,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:57,826 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:57,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:57,826 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:57,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:57,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:57,968 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-04 17:39:57,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:57,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:57,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:57,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:57,992 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-04 17:39:57,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:57,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-02-04 17:39:57,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:39:57,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:39:57,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:39:57,993 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 17 states. [2018-02-04 17:39:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:58,180 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-02-04 17:39:58,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:39:58,180 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-04 17:39:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:58,180 INFO L225 Difference]: With dead ends: 83 [2018-02-04 17:39:58,180 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 17:39:58,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:39:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 17:39:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 17:39:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 17:39:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-02-04 17:39:58,182 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-02-04 17:39:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:58,182 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-02-04 17:39:58,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:39:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-02-04 17:39:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-04 17:39:58,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:58,183 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:58,183 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash 571297404, now seen corresponding path program 14 times [2018-02-04 17:39:58,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:58,183 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:58,183 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:58,183 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:39:58,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:58,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:58,307 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-04 17:39:58,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:58,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:58,308 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:39:58,314 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:39:58,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:58,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:58,329 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-04 17:39:58,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:58,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-02-04 17:39:58,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:39:58,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:39:58,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:39:58,330 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 18 states. [2018-02-04 17:39:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:58,503 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-02-04 17:39:58,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 17:39:58,503 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-02-04 17:39:58,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:58,504 INFO L225 Difference]: With dead ends: 88 [2018-02-04 17:39:58,504 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 17:39:58,504 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-04 17:39:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 17:39:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-04 17:39:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 17:39:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-02-04 17:39:58,505 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 77 [2018-02-04 17:39:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:58,505 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-02-04 17:39:58,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:39:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-02-04 17:39:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 17:39:58,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:58,506 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:58,506 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash 239807095, now seen corresponding path program 15 times [2018-02-04 17:39:58,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:58,506 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:58,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:58,507 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:58,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:58,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:58,654 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-04 17:39:58,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:58,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:58,655 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:39:58,664 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-02-04 17:39:58,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:58,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:58,827 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-04 17:39:58,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:58,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-02-04 17:39:58,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:39:58,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:39:58,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:39:58,829 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 35 states. [2018-02-04 17:39:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:59,167 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-02-04 17:39:59,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:39:59,168 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-02-04 17:39:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:59,168 INFO L225 Difference]: With dead ends: 93 [2018-02-04 17:39:59,168 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 17:39:59,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:39:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 17:39:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-02-04 17:39:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 17:39:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-02-04 17:39:59,170 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-02-04 17:39:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:59,170 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-02-04 17:39:59,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:39:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-02-04 17:39:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 17:39:59,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:59,170 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:59,171 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:59,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1580297380, now seen corresponding path program 16 times [2018-02-04 17:39:59,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:59,171 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:59,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:59,171 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:59,171 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:59,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:59,319 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-04 17:39:59,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:59,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:59,320 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:39:59,327 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:39:59,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:59,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:39:59,354 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-04 17:39:59,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:39:59,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-02-04 17:39:59,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:39:59,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:39:59,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:39:59,355 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 19 states. [2018-02-04 17:39:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:39:59,686 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-02-04 17:39:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:39:59,687 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-02-04 17:39:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:39:59,687 INFO L225 Difference]: With dead ends: 98 [2018-02-04 17:39:59,687 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 17:39:59,688 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-04 17:39:59,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 17:39:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-02-04 17:39:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 17:39:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-02-04 17:39:59,689 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 87 [2018-02-04 17:39:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:39:59,689 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-02-04 17:39:59,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:39:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-02-04 17:39:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 17:39:59,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:39:59,690 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-02-04 17:39:59,690 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:39:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash -957222505, now seen corresponding path program 17 times [2018-02-04 17:39:59,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:39:59,690 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:39:59,691 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:59,691 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:39:59,691 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:39:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:39:59,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:39:59,813 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-04 17:39:59,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:39:59,813 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:39:59,813 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:39:59,822 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-02-04 17:39:59,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:39:59,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:00,000 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-04 17:40:00,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:00,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2018-02-04 17:40:00,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:40:00,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:40:00,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:40:00,001 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 37 states. [2018-02-04 17:40:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:00,413 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-02-04 17:40:00,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 17:40:00,413 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 92 [2018-02-04 17:40:00,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:00,414 INFO L225 Difference]: With dead ends: 103 [2018-02-04 17:40:00,414 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 17:40:00,414 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-04 17:40:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 17:40:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-02-04 17:40:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 17:40:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-02-04 17:40:00,416 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-02-04 17:40:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:00,417 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-02-04 17:40:00,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:40:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-02-04 17:40:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 17:40:00,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:00,417 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:00,418 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash 736575548, now seen corresponding path program 18 times [2018-02-04 17:40:00,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:00,418 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:00,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:00,419 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:00,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:00,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:00,623 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-04 17:40:00,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:00,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:00,623 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:00,635 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-02-04 17:40:00,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:00,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:00,842 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-04 17:40:00,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:00,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-04 17:40:00,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:40:00,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:40:00,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:40:00,844 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 41 states. [2018-02-04 17:40:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:01,440 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-02-04 17:40:01,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 17:40:01,441 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 97 [2018-02-04 17:40:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:01,441 INFO L225 Difference]: With dead ends: 108 [2018-02-04 17:40:01,441 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 17:40:01,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:40:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 17:40:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-04 17:40:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 17:40:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-02-04 17:40:01,444 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 97 [2018-02-04 17:40:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:01,445 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-02-04 17:40:01,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:40:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-02-04 17:40:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 17:40:01,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:01,445 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:01,446 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:01,446 INFO L82 PathProgramCache]: Analyzing trace with hash -878554953, now seen corresponding path program 19 times [2018-02-04 17:40:01,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:01,446 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:01,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:01,447 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:01,447 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:01,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:01,804 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-04 17:40:01,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:01,804 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:01,804 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:01,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:01,822 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-04 17:40:01,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:01,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-02-04 17:40:01,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 17:40:01,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 17:40:01,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:40:01,823 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 23 states. [2018-02-04 17:40:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:02,212 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-02-04 17:40:02,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 17:40:02,212 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-02-04 17:40:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:02,212 INFO L225 Difference]: With dead ends: 113 [2018-02-04 17:40:02,213 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 17:40:02,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=633, Invalid=1089, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:40:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 17:40:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 17:40:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 17:40:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-02-04 17:40:02,214 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-02-04 17:40:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:02,215 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-02-04 17:40:02,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 17:40:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-02-04 17:40:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 17:40:02,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:02,215 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:02,215 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:02,215 INFO L82 PathProgramCache]: Analyzing trace with hash -399157988, now seen corresponding path program 20 times [2018-02-04 17:40:02,215 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:02,215 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:02,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:02,216 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:02,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:02,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:02,525 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-04 17:40:02,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:02,525 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:02,526 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:02,537 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:02,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:02,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:02,559 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-04 17:40:02,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:02,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-02-04 17:40:02,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:40:02,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:40:02,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:40:02,560 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 24 states. [2018-02-04 17:40:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:02,969 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-02-04 17:40:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 17:40:02,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-02-04 17:40:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:02,969 INFO L225 Difference]: With dead ends: 118 [2018-02-04 17:40:02,969 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 17:40:02,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=579, Invalid=1313, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:40:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 17:40:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-04 17:40:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 17:40:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-02-04 17:40:02,973 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 107 [2018-02-04 17:40:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:02,973 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-02-04 17:40:02,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:40:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-02-04 17:40:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 17:40:02,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:02,974 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:02,974 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 792610775, now seen corresponding path program 21 times [2018-02-04 17:40:02,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:02,975 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:02,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:02,975 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:02,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:02,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:03,150 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-04 17:40:03,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:03,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:03,150 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:03,157 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-02-04 17:40:03,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:03,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:03,169 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-04 17:40:03,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:03,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-02-04 17:40:03,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 17:40:03,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 17:40:03,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-04 17:40:03,170 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 25 states. [2018-02-04 17:40:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:03,489 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-02-04 17:40:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 17:40:03,489 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-02-04 17:40:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:03,489 INFO L225 Difference]: With dead ends: 123 [2018-02-04 17:40:03,489 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 17:40:03,490 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-04 17:40:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 17:40:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 17:40:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 17:40:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-02-04 17:40:03,492 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-02-04 17:40:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:03,493 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-02-04 17:40:03,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 17:40:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-02-04 17:40:03,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-04 17:40:03,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:03,494 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:03,494 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:03,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1092014588, now seen corresponding path program 22 times [2018-02-04 17:40:03,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:03,494 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:03,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:03,495 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:03,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:03,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:03,736 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-04 17:40:03,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:03,736 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:03,737 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:03,745 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:03,745 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:03,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:03,767 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-04 17:40:03,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:03,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-02-04 17:40:03,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:40:03,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:40:03,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:40:03,768 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 26 states. [2018-02-04 17:40:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:04,206 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-02-04 17:40:04,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:40:04,207 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-02-04 17:40:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:04,208 INFO L225 Difference]: With dead ends: 128 [2018-02-04 17:40:04,208 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 17:40:04,208 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-04 17:40:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 17:40:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 17:40:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 17:40:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-02-04 17:40:04,211 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 117 [2018-02-04 17:40:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:04,211 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-02-04 17:40:04,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:40:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-02-04 17:40:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 17:40:04,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:04,213 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:04,213 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1378342647, now seen corresponding path program 23 times [2018-02-04 17:40:04,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:04,213 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:04,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:04,214 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:04,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:04,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:04,448 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-04 17:40:04,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:04,448 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:04,449 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:04,462 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-02-04 17:40:04,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:04,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:04,711 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-04 17:40:04,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:04,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-04 17:40:04,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:40:04,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:40:04,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=1729, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:40:04,713 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 49 states. [2018-02-04 17:40:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:05,613 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-02-04 17:40:05,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:40:05,613 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 122 [2018-02-04 17:40:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:05,614 INFO L225 Difference]: With dead ends: 133 [2018-02-04 17:40:05,614 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 17:40:05,614 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-04 17:40:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 17:40:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-04 17:40:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 17:40:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-02-04 17:40:05,616 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-02-04 17:40:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:05,616 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-02-04 17:40:05,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:40:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-02-04 17:40:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-02-04 17:40:05,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:05,617 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:05,617 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1016482084, now seen corresponding path program 24 times [2018-02-04 17:40:05,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:05,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:05,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:05,617 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:05,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:05,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:05,839 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-04 17:40:05,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:05,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:05,840 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:05,861 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-02-04 17:40:05,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:05,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:06,067 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-04 17:40:06,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:06,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 36 [2018-02-04 17:40:06,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:40:06,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:40:06,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=932, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:40:06,068 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 37 states. [2018-02-04 17:40:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:06,633 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-02-04 17:40:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:40:06,633 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 127 [2018-02-04 17:40:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:06,634 INFO L225 Difference]: With dead ends: 138 [2018-02-04 17:40:06,634 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 17:40:06,634 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-04 17:40:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 17:40:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-04 17:40:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 17:40:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-02-04 17:40:06,637 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 127 [2018-02-04 17:40:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:06,637 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-02-04 17:40:06,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:40:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-02-04 17:40:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 17:40:06,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:06,638 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:06,638 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash 37813783, now seen corresponding path program 25 times [2018-02-04 17:40:06,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:06,638 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:06,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:06,639 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:06,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:06,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:06,836 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-04 17:40:06,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:06,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:06,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:06,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:06,865 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-04 17:40:06,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:06,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-02-04 17:40:06,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:40:06,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:40:06,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:40:06,867 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 29 states. [2018-02-04 17:40:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:07,185 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-02-04 17:40:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:40:07,185 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-02-04 17:40:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:07,185 INFO L225 Difference]: With dead ends: 143 [2018-02-04 17:40:07,186 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 17:40:07,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1056, Invalid=1806, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 17:40:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 17:40:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-04 17:40:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 17:40:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-02-04 17:40:07,189 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-02-04 17:40:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:07,189 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-02-04 17:40:07,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:40:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-02-04 17:40:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-02-04 17:40:07,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:07,190 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:07,190 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:07,190 INFO L82 PathProgramCache]: Analyzing trace with hash -24378436, now seen corresponding path program 26 times [2018-02-04 17:40:07,190 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:07,191 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:07,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:07,191 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:07,191 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:07,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:07,428 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-04 17:40:07,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:07,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:07,429 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:07,437 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:07,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:07,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:07,467 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-04 17:40:07,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:07,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-02-04 17:40:07,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 17:40:07,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 17:40:07,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:40:07,469 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 30 states. [2018-02-04 17:40:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:07,903 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-02-04 17:40:07,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:40:07,903 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 137 [2018-02-04 17:40:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:07,904 INFO L225 Difference]: With dead ends: 148 [2018-02-04 17:40:07,904 INFO L226 Difference]: Without dead ends: 148 [2018-02-04 17:40:07,905 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-04 17:40:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-04 17:40:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-04 17:40:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 17:40:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-02-04 17:40:07,906 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 137 [2018-02-04 17:40:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:07,906 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-02-04 17:40:07,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 17:40:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-02-04 17:40:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-04 17:40:07,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:07,907 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:07,907 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1695826633, now seen corresponding path program 27 times [2018-02-04 17:40:07,907 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:07,907 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:07,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:07,908 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:07,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:07,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:08,240 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-04 17:40:08,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:08,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:08,241 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:08,253 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-02-04 17:40:08,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:08,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:08,276 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-04 17:40:08,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:08,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-02-04 17:40:08,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 17:40:08,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 17:40:08,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-02-04 17:40:08,277 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 31 states. [2018-02-04 17:40:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:08,751 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-02-04 17:40:08,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 17:40:08,751 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-02-04 17:40:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:08,751 INFO L225 Difference]: With dead ends: 153 [2018-02-04 17:40:08,752 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 17:40:08,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1221, Invalid=2085, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:40:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 17:40:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-04 17:40:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-04 17:40:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-02-04 17:40:08,755 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-02-04 17:40:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:08,763 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-02-04 17:40:08,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 17:40:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-02-04 17:40:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-04 17:40:08,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:08,764 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:08,764 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:08,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1683732636, now seen corresponding path program 28 times [2018-02-04 17:40:08,764 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:08,764 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:08,765 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:08,765 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:08,765 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:08,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:09,225 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-04 17:40:09,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:09,225 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:09,226 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:09,232 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:09,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:09,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:09,535 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-04 17:40:09,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:09,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 60 [2018-02-04 17:40:09,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:40:09,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:40:09,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:40:09,537 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 61 states. [2018-02-04 17:40:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:10,748 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-02-04 17:40:10,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:40:10,748 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 147 [2018-02-04 17:40:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:10,749 INFO L225 Difference]: With dead ends: 158 [2018-02-04 17:40:10,749 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 17:40:10,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=870, Invalid=2790, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:40:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 17:40:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-04 17:40:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 17:40:10,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-02-04 17:40:10,752 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 147 [2018-02-04 17:40:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:10,752 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-02-04 17:40:10,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:40:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-02-04 17:40:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-02-04 17:40:10,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:10,753 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:10,753 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash 621417559, now seen corresponding path program 29 times [2018-02-04 17:40:10,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:10,753 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:10,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:10,754 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:10,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:10,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:11,024 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-04 17:40:11,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:11,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:11,025 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:11,035 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-02-04 17:40:11,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:11,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:11,353 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-04 17:40:11,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:11,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 60 [2018-02-04 17:40:11,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:40:11,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:40:11,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=959, Invalid=2701, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:40:11,355 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 61 states. [2018-02-04 17:40:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:12,509 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-02-04 17:40:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:40:12,510 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 152 [2018-02-04 17:40:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:12,510 INFO L225 Difference]: With dead ends: 163 [2018-02-04 17:40:12,510 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 17:40:12,511 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-04 17:40:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 17:40:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-04 17:40:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 17:40:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-02-04 17:40:12,513 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-02-04 17:40:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:12,514 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-02-04 17:40:12,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:40:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-02-04 17:40:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-04 17:40:12,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:12,515 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:12,515 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:12,515 INFO L82 PathProgramCache]: Analyzing trace with hash 691459452, now seen corresponding path program 30 times [2018-02-04 17:40:12,515 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:12,515 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:12,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:12,516 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:12,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:12,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:12,855 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-04 17:40:12,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:12,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:12,856 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:12,866 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-02-04 17:40:12,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:12,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:12,934 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-04 17:40:12,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:12,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 36 [2018-02-04 17:40:12,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:40:12,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:40:12,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=818, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:40:12,935 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 37 states. [2018-02-04 17:40:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:13,400 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-02-04 17:40:13,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:40:13,400 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 157 [2018-02-04 17:40:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:13,401 INFO L225 Difference]: With dead ends: 168 [2018-02-04 17:40:13,401 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 17:40:13,401 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-04 17:40:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 17:40:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-04 17:40:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 17:40:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-02-04 17:40:13,403 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 157 [2018-02-04 17:40:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:13,403 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-02-04 17:40:13,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:40:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-02-04 17:40:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 17:40:13,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:13,404 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:13,404 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1996358519, now seen corresponding path program 31 times [2018-02-04 17:40:13,404 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:13,404 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:13,404 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:13,405 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:13,405 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:13,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:13,808 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-04 17:40:13,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:13,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:13,808 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:13,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:13,841 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-04 17:40:13,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:13,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 17:40:13,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:40:13,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:40:13,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:40:13,842 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 35 states. [2018-02-04 17:40:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:14,386 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-02-04 17:40:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 17:40:14,387 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-02-04 17:40:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:14,387 INFO L225 Difference]: With dead ends: 173 [2018-02-04 17:40:14,387 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 17:40:14,388 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1587, Invalid=2703, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:40:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 17:40:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-02-04 17:40:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-04 17:40:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-02-04 17:40:14,389 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-02-04 17:40:14,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:14,389 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-02-04 17:40:14,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:40:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-02-04 17:40:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 17:40:14,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:14,390 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:14,390 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash 603675228, now seen corresponding path program 32 times [2018-02-04 17:40:14,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:14,390 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:14,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:14,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:14,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:14,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:14,926 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-04 17:40:14,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:14,927 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:14,927 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:14,934 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:14,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:14,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:14,978 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-04 17:40:14,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:14,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-02-04 17:40:14,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 17:40:14,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 17:40:14,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:40:14,979 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 35 states. [2018-02-04 17:40:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:16,023 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-02-04 17:40:16,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 17:40:16,023 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 167 [2018-02-04 17:40:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:16,024 INFO L225 Difference]: With dead ends: 178 [2018-02-04 17:40:16,024 INFO L226 Difference]: Without dead ends: 178 [2018-02-04 17:40:16,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 17:40:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-04 17:40:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-04 17:40:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 17:40:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-02-04 17:40:16,027 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 167 [2018-02-04 17:40:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:16,028 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-02-04 17:40:16,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 17:40:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-02-04 17:40:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-04 17:40:16,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:16,029 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:16,029 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1420397207, now seen corresponding path program 33 times [2018-02-04 17:40:16,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:16,029 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:16,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:16,030 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:16,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:16,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:16,537 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-04 17:40:16,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:16,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:16,537 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:16,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 17:40:16,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:16,551 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:16,584 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-04 17:40:16,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:16,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-02-04 17:40:16,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 17:40:16,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 17:40:16,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:40:16,585 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 37 states. [2018-02-04 17:40:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:17,103 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-02-04 17:40:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 17:40:17,104 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-02-04 17:40:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:17,105 INFO L225 Difference]: With dead ends: 183 [2018-02-04 17:40:17,105 INFO L226 Difference]: Without dead ends: 183 [2018-02-04 17:40:17,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1788, Invalid=3042, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 17:40:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-04 17:40:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-04 17:40:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 17:40:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-02-04 17:40:17,107 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-02-04 17:40:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:17,107 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-02-04 17:40:17,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 17:40:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-02-04 17:40:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-04 17:40:17,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:17,108 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:17,108 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1375254724, now seen corresponding path program 34 times [2018-02-04 17:40:17,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:17,108 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:17,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:17,109 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:17,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:17,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:17,511 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-04 17:40:17,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:17,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:17,512 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:17,522 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:17,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:17,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:17,551 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-04 17:40:17,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:17,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-02-04 17:40:17,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 17:40:17,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 17:40:17,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 17:40:17,552 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 38 states. [2018-02-04 17:40:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:18,194 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-02-04 17:40:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:40:18,194 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 177 [2018-02-04 17:40:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:18,195 INFO L225 Difference]: With dead ends: 188 [2018-02-04 17:40:18,195 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 17:40:18,195 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-04 17:40:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 17:40:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-02-04 17:40:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-04 17:40:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-02-04 17:40:18,197 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 177 [2018-02-04 17:40:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:18,197 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-02-04 17:40:18,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 17:40:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-02-04 17:40:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-02-04 17:40:18,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:18,198 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:18,198 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1888573001, now seen corresponding path program 35 times [2018-02-04 17:40:18,199 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:18,199 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:18,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:18,199 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:18,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:18,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:18,696 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-04 17:40:18,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:18,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:18,697 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:18,730 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-02-04 17:40:18,730 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:18,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:19,271 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-04 17:40:19,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:19,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 72 [2018-02-04 17:40:19,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 17:40:19,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 17:40:19,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1367, Invalid=3889, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 17:40:19,273 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 73 states. [2018-02-04 17:40:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:21,220 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-02-04 17:40:21,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 17:40:21,220 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 182 [2018-02-04 17:40:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:21,221 INFO L225 Difference]: With dead ends: 193 [2018-02-04 17:40:21,221 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 17:40:21,222 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-04 17:40:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 17:40:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-04 17:40:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 17:40:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-02-04 17:40:21,225 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-02-04 17:40:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:21,225 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-02-04 17:40:21,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 17:40:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-02-04 17:40:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-02-04 17:40:21,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:21,226 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:21,226 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2093442020, now seen corresponding path program 36 times [2018-02-04 17:40:21,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:21,227 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:21,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:21,227 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:21,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:21,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:21,610 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-04 17:40:21,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:21,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:21,610 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:21,622 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-02-04 17:40:21,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:21,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:21,729 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-04 17:40:21,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:21,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 44 [2018-02-04 17:40:21,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 17:40:21,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 17:40:21,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1244, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 17:40:21,730 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 45 states. [2018-02-04 17:40:22,311 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 24 DAG size of output 6 [2018-02-04 17:40:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:22,729 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-02-04 17:40:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 17:40:22,729 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 187 [2018-02-04 17:40:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:22,729 INFO L225 Difference]: With dead ends: 198 [2018-02-04 17:40:22,730 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 17:40:22,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2205, Invalid=4275, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 17:40:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 17:40:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-02-04 17:40:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 17:40:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-02-04 17:40:22,732 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 187 [2018-02-04 17:40:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:22,732 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-02-04 17:40:22,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 17:40:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-02-04 17:40:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-02-04 17:40:22,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:22,733 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:22,733 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash 640639191, now seen corresponding path program 37 times [2018-02-04 17:40:22,733 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:22,733 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:22,733 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:22,734 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:22,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:22,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:23,210 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-04 17:40:23,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:23,210 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:23,211 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:23,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:23,256 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-04 17:40:23,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:23,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-02-04 17:40:23,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 17:40:23,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 17:40:23,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 17:40:23,257 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 41 states. [2018-02-04 17:40:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:23,835 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-02-04 17:40:23,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 17:40:23,835 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-02-04 17:40:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:23,835 INFO L225 Difference]: With dead ends: 203 [2018-02-04 17:40:23,835 INFO L226 Difference]: Without dead ends: 203 [2018-02-04 17:40:23,836 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-04 17:40:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-04 17:40:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-04 17:40:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 17:40:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-02-04 17:40:23,837 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-02-04 17:40:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:23,837 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-02-04 17:40:23,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 17:40:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-02-04 17:40:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-02-04 17:40:23,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:23,838 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:23,838 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1578280708, now seen corresponding path program 38 times [2018-02-04 17:40:23,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:23,838 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:23,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:23,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:23,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:23,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:24,339 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-04 17:40:24,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:24,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:24,340 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:24,349 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:24,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:24,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:24,391 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-04 17:40:24,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:24,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-02-04 17:40:24,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 17:40:24,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 17:40:24,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:40:24,393 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 42 states. [2018-02-04 17:40:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:25,069 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-02-04 17:40:25,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 17:40:25,069 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 197 [2018-02-04 17:40:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:25,070 INFO L225 Difference]: With dead ends: 208 [2018-02-04 17:40:25,070 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 17:40:25,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2267, Invalid=4053, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 17:40:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 17:40:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-02-04 17:40:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 17:40:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-02-04 17:40:25,072 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 197 [2018-02-04 17:40:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:25,072 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-02-04 17:40:25,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 17:40:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-02-04 17:40:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 17:40:25,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:25,073 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:25,073 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1699590135, now seen corresponding path program 39 times [2018-02-04 17:40:25,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:25,073 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:25,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:25,074 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:25,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:25,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:25,500 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-04 17:40:25,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:25,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:25,501 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:25,517 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-02-04 17:40:25,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:25,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:25,562 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-04 17:40:25,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:25,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-02-04 17:40:25,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-04 17:40:25,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-04 17:40:25,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:40:25,564 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 43 states. [2018-02-04 17:40:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:26,241 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-02-04 17:40:26,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-04 17:40:26,241 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-02-04 17:40:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:26,242 INFO L225 Difference]: With dead ends: 213 [2018-02-04 17:40:26,242 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 17:40:26,242 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-04 17:40:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 17:40:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-02-04 17:40:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 17:40:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-02-04 17:40:26,244 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-02-04 17:40:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:26,244 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-02-04 17:40:26,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-04 17:40:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-02-04 17:40:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-04 17:40:26,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:26,245 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:26,245 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:26,245 INFO L82 PathProgramCache]: Analyzing trace with hash 721649116, now seen corresponding path program 40 times [2018-02-04 17:40:26,245 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:26,245 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:26,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:26,245 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:26,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:26,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:26,676 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-04 17:40:26,676 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:26,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:26,677 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:26,684 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:26,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:26,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:26,721 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-04 17:40:26,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:26,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-02-04 17:40:26,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 17:40:26,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 17:40:26,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=1278, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:40:26,722 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 44 states. [2018-02-04 17:40:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:27,740 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-02-04 17:40:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 17:40:27,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 207 [2018-02-04 17:40:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:27,741 INFO L225 Difference]: With dead ends: 218 [2018-02-04 17:40:27,741 INFO L226 Difference]: Without dead ends: 218 [2018-02-04 17:40:27,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2047, Invalid=4925, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 17:40:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-04 17:40:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-04 17:40:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 17:40:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-02-04 17:40:27,743 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 207 [2018-02-04 17:40:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:27,743 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-02-04 17:40:27,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 17:40:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-02-04 17:40:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-02-04 17:40:27,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:27,744 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:27,744 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:27,744 INFO L82 PathProgramCache]: Analyzing trace with hash 111908631, now seen corresponding path program 41 times [2018-02-04 17:40:27,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:27,744 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:27,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:27,744 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:27,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:27,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:28,266 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-04 17:40:28,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:28,267 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:28,267 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:28,280 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-02-04 17:40:28,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:28,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:29,017 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-04 17:40:29,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:29,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 84 [2018-02-04 17:40:29,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-04 17:40:29,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-04 17:40:29,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1847, Invalid=5293, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 17:40:29,018 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 85 states. [2018-02-04 17:40:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:31,418 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-02-04 17:40:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 17:40:31,418 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 212 [2018-02-04 17:40:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:31,418 INFO L225 Difference]: With dead ends: 223 [2018-02-04 17:40:31,418 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 17:40:31,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5507 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2950, Invalid=12800, Unknown=0, NotChecked=0, Total=15750 [2018-02-04 17:40:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 17:40:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-04 17:40:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 17:40:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-02-04 17:40:31,421 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-02-04 17:40:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:31,421 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-02-04 17:40:31,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-02-04 17:40:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-02-04 17:40:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-02-04 17:40:31,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:31,422 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:31,422 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1104743100, now seen corresponding path program 42 times [2018-02-04 17:40:31,422 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:31,422 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:31,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:31,422 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:31,422 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:31,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:31,933 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-04 17:40:31,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:31,933 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:31,934 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:31,946 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-02-04 17:40:31,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:31,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:32,060 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-04 17:40:32,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:32,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 48 [2018-02-04 17:40:32,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:40:32,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:40:32,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=1388, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:40:32,061 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 49 states. [2018-02-04 17:40:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:32,781 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-02-04 17:40:32,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 17:40:32,781 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 217 [2018-02-04 17:40:32,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:32,782 INFO L225 Difference]: With dead ends: 228 [2018-02-04 17:40:32,782 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 17:40:32,783 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-04 17:40:32,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 17:40:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-02-04 17:40:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-04 17:40:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-02-04 17:40:32,786 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 217 [2018-02-04 17:40:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:32,786 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-02-04 17:40:32,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:40:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-02-04 17:40:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-02-04 17:40:32,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:32,787 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:32,787 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1370166839, now seen corresponding path program 43 times [2018-02-04 17:40:32,787 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:32,787 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:32,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:32,788 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:32,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:32,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:33,329 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-04 17:40:33,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:33,329 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:33,330 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:33,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:33,367 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-04 17:40:33,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:33,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-02-04 17:40:33,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 17:40:33,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 17:40:33,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 17:40:33,368 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 47 states. [2018-02-04 17:40:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:34,092 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-02-04 17:40:34,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-04 17:40:34,092 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-02-04 17:40:34,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:34,093 INFO L225 Difference]: With dead ends: 233 [2018-02-04 17:40:34,093 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 17:40:34,093 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-04 17:40:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 17:40:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-02-04 17:40:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-02-04 17:40:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-02-04 17:40:34,096 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-02-04 17:40:34,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:34,097 INFO L432 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-02-04 17:40:34,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 17:40:34,097 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-02-04 17:40:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-02-04 17:40:34,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:34,098 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:34,098 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash -330563684, now seen corresponding path program 44 times [2018-02-04 17:40:34,098 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:34,098 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:34,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:34,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:34,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:34,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:34,684 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-04 17:40:34,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:34,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:34,684 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:34,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:34,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:34,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:34,842 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-04 17:40:34,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:34,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 54 [2018-02-04 17:40:34,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 17:40:34,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 17:40:34,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=2021, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:40:34,843 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 55 states. [2018-02-04 17:40:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:35,991 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-02-04 17:40:35,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 17:40:35,991 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 227 [2018-02-04 17:40:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:35,992 INFO L225 Difference]: With dead ends: 238 [2018-02-04 17:40:35,992 INFO L226 Difference]: Without dead ends: 238 [2018-02-04 17:40:35,992 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-04 17:40:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-02-04 17:40:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-02-04 17:40:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 17:40:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-02-04 17:40:35,994 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 227 [2018-02-04 17:40:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:35,994 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-02-04 17:40:35,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 17:40:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-02-04 17:40:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-02-04 17:40:35,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:35,995 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:35,995 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash 992882007, now seen corresponding path program 45 times [2018-02-04 17:40:35,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:35,995 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:35,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:35,996 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:35,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:36,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:36,654 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-04 17:40:36,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:36,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:36,654 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:36,669 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-02-04 17:40:36,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:36,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:36,712 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-04 17:40:36,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:36,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-02-04 17:40:36,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 17:40:36,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 17:40:36,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:40:36,713 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 49 states. [2018-02-04 17:40:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:37,503 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-02-04 17:40:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 17:40:37,503 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-02-04 17:40:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:37,504 INFO L225 Difference]: With dead ends: 243 [2018-02-04 17:40:37,504 INFO L226 Difference]: Without dead ends: 243 [2018-02-04 17:40:37,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3246, Invalid=5496, Unknown=0, NotChecked=0, Total=8742 [2018-02-04 17:40:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-04 17:40:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-04 17:40:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 17:40:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-02-04 17:40:37,508 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-02-04 17:40:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:37,508 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-02-04 17:40:37,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 17:40:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-02-04 17:40:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 17:40:37,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:37,509 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:37,509 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash -222667652, now seen corresponding path program 46 times [2018-02-04 17:40:37,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:37,510 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:37,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:37,510 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:37,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:37,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:38,126 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-04 17:40:38,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:38,126 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:38,126 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:38,133 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:38,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:38,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:38,170 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-04 17:40:38,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:38,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-02-04 17:40:38,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 17:40:38,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 17:40:38,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 17:40:38,171 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 50 states. [2018-02-04 17:40:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:39,070 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-02-04 17:40:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 17:40:39,070 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 237 [2018-02-04 17:40:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:39,071 INFO L225 Difference]: With dead ends: 248 [2018-02-04 17:40:39,071 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 17:40:39,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3295, Invalid=5825, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 17:40:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 17:40:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-02-04 17:40:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 17:40:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-02-04 17:40:39,073 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 237 [2018-02-04 17:40:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:39,073 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-02-04 17:40:39,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 17:40:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-02-04 17:40:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-02-04 17:40:39,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:39,074 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:39,074 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2053710729, now seen corresponding path program 47 times [2018-02-04 17:40:39,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:39,074 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:39,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:39,075 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:39,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:39,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:39,698 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-04 17:40:39,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:39,699 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:39,699 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:39,718 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-02-04 17:40:39,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:39,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:40,427 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-04 17:40:40,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:40,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49] total 96 [2018-02-04 17:40:40,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-02-04 17:40:40,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-02-04 17:40:40,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2399, Invalid=6913, Unknown=0, NotChecked=0, Total=9312 [2018-02-04 17:40:40,429 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 97 states. [2018-02-04 17:40:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:43,572 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-02-04 17:40:43,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 17:40:43,572 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 242 [2018-02-04 17:40:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:43,573 INFO L225 Difference]: With dead ends: 253 [2018-02-04 17:40:43,573 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 17:40:43,574 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-04 17:40:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 17:40:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-02-04 17:40:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-02-04 17:40:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-02-04 17:40:43,576 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-02-04 17:40:43,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:43,576 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-02-04 17:40:43,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-02-04 17:40:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-02-04 17:40:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-02-04 17:40:43,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:43,578 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:43,578 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1073602212, now seen corresponding path program 48 times [2018-02-04 17:40:43,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:43,578 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:43,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:43,579 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:43,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:43,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:44,216 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-04 17:40:44,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:44,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:44,216 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:40:44,231 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-02-04 17:40:44,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:44,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:44,632 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-04 17:40:44,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:44,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 68 [2018-02-04 17:40:44,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 17:40:44,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 17:40:44,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=3260, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 17:40:44,633 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 69 states. [2018-02-04 17:40:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:46,475 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-02-04 17:40:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 17:40:46,475 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-02-04 17:40:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:46,476 INFO L225 Difference]: With dead ends: 258 [2018-02-04 17:40:46,476 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 17:40:46,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3855, Invalid=9717, Unknown=0, NotChecked=0, Total=13572 [2018-02-04 17:40:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 17:40:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-02-04 17:40:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-04 17:40:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-02-04 17:40:46,478 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 247 [2018-02-04 17:40:46,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:46,479 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-02-04 17:40:46,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 17:40:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-02-04 17:40:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-02-04 17:40:46,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:46,480 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:46,480 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash -523820137, now seen corresponding path program 49 times [2018-02-04 17:40:46,481 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:46,481 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:46,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:46,481 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:46,481 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:46,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:47,189 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-04 17:40:47,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:47,189 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:47,189 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:47,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:47,239 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-04 17:40:47,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:47,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-02-04 17:40:47,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 17:40:47,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 17:40:47,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 17:40:47,240 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 53 states. [2018-02-04 17:40:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:48,152 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-02-04 17:40:48,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-04 17:40:48,152 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-02-04 17:40:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:48,153 INFO L225 Difference]: With dead ends: 263 [2018-02-04 17:40:48,153 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 17:40:48,154 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-04 17:40:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 17:40:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-02-04 17:40:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-04 17:40:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-02-04 17:40:48,155 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-02-04 17:40:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:48,155 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-02-04 17:40:48,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 17:40:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-02-04 17:40:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-02-04 17:40:48,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:48,157 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:48,157 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1098993212, now seen corresponding path program 50 times [2018-02-04 17:40:48,157 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:48,157 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:48,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:48,158 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:40:48,158 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:48,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:48,872 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-04 17:40:48,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:48,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:48,872 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:40:48,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:40:48,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:48,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:48,990 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-04 17:40:48,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:48,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 57 [2018-02-04 17:40:48,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 17:40:48,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 17:40:48,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=2007, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 17:40:48,991 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 58 states. [2018-02-04 17:40:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:50,020 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-02-04 17:40:50,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 17:40:50,020 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 257 [2018-02-04 17:40:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:50,021 INFO L225 Difference]: With dead ends: 268 [2018-02-04 17:40:50,021 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 17:40:50,021 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-04 17:40:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 17:40:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-02-04 17:40:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-04 17:40:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-02-04 17:40:50,023 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 257 [2018-02-04 17:40:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:50,023 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-02-04 17:40:50,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 17:40:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-02-04 17:40:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-02-04 17:40:50,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:50,024 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:50,024 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:50,024 INFO L82 PathProgramCache]: Analyzing trace with hash 169935543, now seen corresponding path program 51 times [2018-02-04 17:40:50,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:50,024 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:50,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:50,025 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:50,025 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:50,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:50,760 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-04 17:40:50,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:50,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:50,772 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:40:50,784 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-02-04 17:40:50,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:50,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:50,821 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-04 17:40:50,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:50,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-02-04 17:40:50,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-04 17:40:50,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-04 17:40:50,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 17:40:50,822 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 55 states. [2018-02-04 17:40:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:51,771 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-02-04 17:40:51,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-04 17:40:51,771 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-02-04 17:40:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:51,772 INFO L225 Difference]: With dead ends: 273 [2018-02-04 17:40:51,772 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 17:40:51,772 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-04 17:40:51,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 17:40:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-02-04 17:40:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-04 17:40:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-02-04 17:40:51,775 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-02-04 17:40:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:51,775 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-02-04 17:40:51,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-04 17:40:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-02-04 17:40:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-04 17:40:51,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:51,776 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:51,777 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:51,777 INFO L82 PathProgramCache]: Analyzing trace with hash -954866916, now seen corresponding path program 52 times [2018-02-04 17:40:51,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:51,777 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:51,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:51,778 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:51,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:51,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:52,526 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-04 17:40:52,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:52,527 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:52,527 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:40:52,535 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:40:52,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:52,536 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:53,273 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-04 17:40:53,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:53,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54] total 108 [2018-02-04 17:40:53,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-02-04 17:40:53,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-02-04 17:40:53,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:40:53,275 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 109 states. [2018-02-04 17:40:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:40:55,997 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-02-04 17:40:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 17:40:55,998 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 267 [2018-02-04 17:40:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:40:55,999 INFO L225 Difference]: With dead ends: 278 [2018-02-04 17:40:55,999 INFO L226 Difference]: Without dead ends: 278 [2018-02-04 17:40:55,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5346 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2862, Invalid=8910, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:40:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-04 17:40:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-02-04 17:40:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-02-04 17:40:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-02-04 17:40:56,001 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 267 [2018-02-04 17:40:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:40:56,001 INFO L432 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-02-04 17:40:56,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-02-04 17:40:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-02-04 17:40:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 17:40:56,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:40:56,002 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-02-04 17:40:56,002 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:40:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash -326731305, now seen corresponding path program 53 times [2018-02-04 17:40:56,002 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:40:56,002 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:40:56,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:56,002 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:40:56,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:40:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:40:56,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:40:56,806 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-04 17:40:56,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:40:56,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:40:56,807 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:40:56,824 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-02-04 17:40:56,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:40:56,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:40:57,678 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-04 17:40:57,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:40:57,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 108 [2018-02-04 17:40:57,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-02-04 17:40:57,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-02-04 17:40:57,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3023, Invalid=8749, Unknown=0, NotChecked=0, Total=11772 [2018-02-04 17:40:57,680 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 109 states. [2018-02-04 17:41:01,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:01,266 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-02-04 17:41:01,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 17:41:01,266 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 272 [2018-02-04 17:41:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:01,267 INFO L225 Difference]: With dead ends: 283 [2018-02-04 17:41:01,267 INFO L226 Difference]: Without dead ends: 283 [2018-02-04 17:41:01,268 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-04 17:41:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-04 17:41:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-02-04 17:41:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-02-04 17:41:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-02-04 17:41:01,269 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-02-04 17:41:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:01,269 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-02-04 17:41:01,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-02-04 17:41:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-02-04 17:41:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-02-04 17:41:01,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:01,270 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:01,270 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash -484581380, now seen corresponding path program 54 times [2018-02-04 17:41:01,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:01,270 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:01,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:01,271 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:01,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:01,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:02,226 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-04 17:41:02,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:02,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:02,227 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:41:02,251 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-02-04 17:41:02,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:02,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:02,511 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-04 17:41:02,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:02,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 60 [2018-02-04 17:41:02,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-02-04 17:41:02,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-02-04 17:41:02,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1558, Invalid=2102, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 17:41:02,513 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 61 states. [2018-02-04 17:41:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:03,832 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-02-04 17:41:03,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:41:03,832 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 277 [2018-02-04 17:41:03,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:03,833 INFO L225 Difference]: With dead ends: 288 [2018-02-04 17:41:03,833 INFO L226 Difference]: Without dead ends: 288 [2018-02-04 17:41:03,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4742, Invalid=8368, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 17:41:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-04 17:41:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-02-04 17:41:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-02-04 17:41:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-02-04 17:41:03,835 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 277 [2018-02-04 17:41:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:03,836 INFO L432 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-02-04 17:41:03,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-02-04 17:41:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-02-04 17:41:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-02-04 17:41:03,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:03,836 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:03,836 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1067874057, now seen corresponding path program 55 times [2018-02-04 17:41:03,837 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:03,837 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:03,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:03,837 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:03,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:03,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:04,686 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-04 17:41:04,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:04,686 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:04,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:41:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:04,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:04,734 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-04 17:41:04,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:04,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-02-04 17:41:04,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 17:41:04,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 17:41:04,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:41:04,735 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 59 states. [2018-02-04 17:41:05,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:05,818 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-02-04 17:41:05,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 17:41:05,819 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-02-04 17:41:05,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:05,820 INFO L225 Difference]: With dead ends: 293 [2018-02-04 17:41:05,820 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 17:41:05,821 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-04 17:41:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 17:41:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-02-04 17:41:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-04 17:41:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-02-04 17:41:05,824 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-02-04 17:41:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:05,824 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-02-04 17:41:05,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 17:41:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-02-04 17:41:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-02-04 17:41:05,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:05,825 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:05,825 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:05,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1249330396, now seen corresponding path program 56 times [2018-02-04 17:41:05,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:05,826 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:05,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:05,826 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:41:05,826 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:05,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:06,696 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-04 17:41:06,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:06,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:06,696 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:41:06,704 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:41:06,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:06,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:06,749 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-04 17:41:06,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:06,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-02-04 17:41:06,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 17:41:06,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 17:41:06,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1294, Invalid=2246, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 17:41:06,750 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 60 states. [2018-02-04 17:41:08,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:08,446 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-02-04 17:41:08,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 17:41:08,446 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 287 [2018-02-04 17:41:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:08,446 INFO L225 Difference]: With dead ends: 298 [2018-02-04 17:41:08,447 INFO L226 Difference]: Without dead ends: 298 [2018-02-04 17:41:08,447 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-04 17:41:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-04 17:41:08,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-02-04 17:41:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 17:41:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-02-04 17:41:08,449 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 287 [2018-02-04 17:41:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:08,449 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-02-04 17:41:08,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 17:41:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-02-04 17:41:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-02-04 17:41:08,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:08,450 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:08,450 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash 729559063, now seen corresponding path program 57 times [2018-02-04 17:41:08,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:08,450 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:08,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:08,450 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:08,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:08,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:09,356 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-04 17:41:09,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:09,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:09,356 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:41:09,379 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-02-04 17:41:09,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:09,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:10,267 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-04 17:41:10,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:10,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59] total 118 [2018-02-04 17:41:10,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-02-04 17:41:10,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-02-04 17:41:10,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 17:41:10,269 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 119 states. [2018-02-04 17:41:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:12,886 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-02-04 17:41:12,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-04 17:41:12,887 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 292 [2018-02-04 17:41:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:12,887 INFO L225 Difference]: With dead ends: 303 [2018-02-04 17:41:12,887 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 17:41:12,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6611 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 17:41:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 17:41:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-02-04 17:41:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 17:41:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-02-04 17:41:12,889 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-02-04 17:41:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:12,890 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-02-04 17:41:12,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-02-04 17:41:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-02-04 17:41:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-04 17:41:12,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:12,890 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:12,891 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1266675268, now seen corresponding path program 58 times [2018-02-04 17:41:12,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:12,891 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:12,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:12,891 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:12,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:12,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:13,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:13,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:13,774 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:41:13,787 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:41:13,787 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:13,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8381 backedges. 0 proven. 8381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:13,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:13,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 66 [2018-02-04 17:41:13,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 17:41:13,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 17:41:13,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1743, Invalid=2679, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:41:13,919 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 67 states. [2018-02-04 17:41:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:15,424 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-02-04 17:41:15,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 17:41:15,424 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 297 [2018-02-04 17:41:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:15,425 INFO L225 Difference]: With dead ends: 308 [2018-02-04 17:41:15,425 INFO L226 Difference]: Without dead ends: 308 [2018-02-04 17:41:15,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5387, Invalid=10113, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 17:41:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-02-04 17:41:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-02-04 17:41:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-02-04 17:41:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-02-04 17:41:15,427 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 297 [2018-02-04 17:41:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:15,427 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-02-04 17:41:15,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 17:41:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-02-04 17:41:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 17:41:15,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:15,428 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:15,428 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1632661303, now seen corresponding path program 59 times [2018-02-04 17:41:15,429 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:15,429 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:15,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:15,429 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:15,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:15,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:16,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:16,385 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:16,385 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:41:16,405 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-02-04 17:41:16,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:16,408 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8673 backedges. 0 proven. 8673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:17,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:17,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61] total 120 [2018-02-04 17:41:17,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-02-04 17:41:17,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-02-04 17:41:17,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3719, Invalid=10801, Unknown=0, NotChecked=0, Total=14520 [2018-02-04 17:41:17,474 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 121 states. [2018-02-04 17:41:22,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:22,139 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-02-04 17:41:22,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 17:41:22,139 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 302 [2018-02-04 17:41:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:22,140 INFO L225 Difference]: With dead ends: 313 [2018-02-04 17:41:22,140 INFO L226 Difference]: Without dead ends: 313 [2018-02-04 17:41:22,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11636 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5839, Invalid=26381, Unknown=0, NotChecked=0, Total=32220 [2018-02-04 17:41:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-04 17:41:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-02-04 17:41:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-02-04 17:41:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-02-04 17:41:22,144 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-02-04 17:41:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:22,144 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-02-04 17:41:22,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-02-04 17:41:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-02-04 17:41:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-02-04 17:41:22,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:22,146 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:22,146 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1156168036, now seen corresponding path program 60 times [2018-02-04 17:41:22,146 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:22,146 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:22,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:22,147 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:22,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:22,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:23,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:23,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:23,126 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:41:23,146 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-02-04 17:41:23,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:23,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 8970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:24,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:24,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62] total 117 [2018-02-04 17:41:24,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-02-04 17:41:24,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-02-04 17:41:24,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3359, Invalid=10447, Unknown=0, NotChecked=0, Total=13806 [2018-02-04 17:41:24,205 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 118 states. [2018-02-04 17:41:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:29,505 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-02-04 17:41:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 17:41:29,506 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 307 [2018-02-04 17:41:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:29,506 INFO L225 Difference]: With dead ends: 318 [2018-02-04 17:41:29,506 INFO L226 Difference]: Without dead ends: 318 [2018-02-04 17:41:29,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10275 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5808, Invalid=25698, Unknown=0, NotChecked=0, Total=31506 [2018-02-04 17:41:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-04 17:41:29,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-02-04 17:41:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-04 17:41:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-02-04 17:41:29,509 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 307 [2018-02-04 17:41:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:29,509 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-02-04 17:41:29,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-02-04 17:41:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-02-04 17:41:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-02-04 17:41:29,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:29,510 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:29,510 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:29,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1119372887, now seen corresponding path program 61 times [2018-02-04 17:41:29,511 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:29,511 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:29,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:29,512 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:29,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:29,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:30,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:30,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:30,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:41:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:30,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 9272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:30,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:30,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-02-04 17:41:30,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 17:41:30,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 17:41:30,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 17:41:30,659 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 65 states. [2018-02-04 17:41:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:31,937 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-02-04 17:41:31,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-02-04 17:41:31,937 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-02-04 17:41:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:31,938 INFO L225 Difference]: With dead ends: 323 [2018-02-04 17:41:31,938 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 17:41:31,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=5862, Invalid=9888, Unknown=0, NotChecked=0, Total=15750 [2018-02-04 17:41:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 17:41:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-02-04 17:41:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-04 17:41:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-02-04 17:41:31,940 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-02-04 17:41:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:31,941 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-02-04 17:41:31,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 17:41:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-02-04 17:41:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-02-04 17:41:31,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:31,941 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:31,941 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1164450948, now seen corresponding path program 62 times [2018-02-04 17:41:31,942 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:31,942 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:31,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:31,942 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:41:31,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:31,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:32,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:32,989 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:32,989 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:41:32,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:41:32,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:33,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9579 backedges. 0 proven. 9579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:33,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:33,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-02-04 17:41:33,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 17:41:33,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 17:41:33,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 17:41:33,063 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 66 states. [2018-02-04 17:41:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:34,484 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-02-04 17:41:34,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 17:41:34,485 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-02-04 17:41:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:34,485 INFO L225 Difference]: With dead ends: 328 [2018-02-04 17:41:34,485 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 17:41:34,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=5927, Invalid=10329, Unknown=0, NotChecked=0, Total=16256 [2018-02-04 17:41:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 17:41:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-02-04 17:41:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-02-04 17:41:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-02-04 17:41:34,487 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 317 [2018-02-04 17:41:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:34,488 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-02-04 17:41:34,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 17:41:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-02-04 17:41:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-02-04 17:41:34,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:34,488 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:34,488 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2115351927, now seen corresponding path program 63 times [2018-02-04 17:41:34,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:34,489 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:34,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:34,489 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:34,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:34,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:35,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:35,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:35,645 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:41:35,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-02-04 17:41:35,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:35,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9891 backedges. 0 proven. 9891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:36,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:36,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65] total 130 [2018-02-04 17:41:36,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-02-04 17:41:36,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-02-04 17:41:36,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 17:41:36,708 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 131 states. [2018-02-04 17:41:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:41,164 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-02-04 17:41:41,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 17:41:41,164 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 322 [2018-02-04 17:41:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:41,165 INFO L225 Difference]: With dead ends: 333 [2018-02-04 17:41:41,165 INFO L226 Difference]: Without dead ends: 333 [2018-02-04 17:41:41,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8063 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-02-04 17:41:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-04 17:41:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-02-04 17:41:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-04 17:41:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-02-04 17:41:41,167 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-02-04 17:41:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:41,167 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-02-04 17:41:41,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-02-04 17:41:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-02-04 17:41:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-04 17:41:41,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:41,168 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:41,168 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:41,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1310529444, now seen corresponding path program 64 times [2018-02-04 17:41:41,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:41,169 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:41,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:41,169 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:41,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:41,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:42,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:42,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:42,632 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:41:42,641 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:41:42,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:42,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10208 backedges. 0 proven. 10208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:42,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:42,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-02-04 17:41:42,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-04 17:41:42,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-04 17:41:42,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:41:42,730 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 67 states. [2018-02-04 17:41:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:46,764 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-02-04 17:41:46,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 17:41:46,764 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 327 [2018-02-04 17:41:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:46,765 INFO L225 Difference]: With dead ends: 338 [2018-02-04 17:41:46,765 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 17:41:46,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-02-04 17:41:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 17:41:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-02-04 17:41:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-04 17:41:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-02-04 17:41:46,767 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 327 [2018-02-04 17:41:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:46,767 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-02-04 17:41:46,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-04 17:41:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-02-04 17:41:46,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-02-04 17:41:46,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:46,768 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:46,768 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:46,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1354056553, now seen corresponding path program 65 times [2018-02-04 17:41:46,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:46,768 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:46,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:46,769 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:46,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:46,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:47,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:47,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:47,956 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:41:47,978 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-02-04 17:41:47,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:47,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:49,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:49,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67] total 132 [2018-02-04 17:41:49,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-02-04 17:41:49,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-02-04 17:41:49,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4487, Invalid=13069, Unknown=0, NotChecked=0, Total=17556 [2018-02-04 17:41:49,240 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 133 states. [2018-02-04 17:41:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:41:55,057 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-02-04 17:41:55,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 17:41:55,057 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 332 [2018-02-04 17:41:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:41:55,058 INFO L225 Difference]: With dead ends: 343 [2018-02-04 17:41:55,058 INFO L226 Difference]: Without dead ends: 343 [2018-02-04 17:41:55,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14183 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7018, Invalid=31988, Unknown=0, NotChecked=0, Total=39006 [2018-02-04 17:41:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-04 17:41:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-02-04 17:41:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 17:41:55,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-02-04 17:41:55,061 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-02-04 17:41:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:41:55,061 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-02-04 17:41:55,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-02-04 17:41:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-02-04 17:41:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-02-04 17:41:55,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:41:55,062 INFO L351 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-02-04 17:41:55,062 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:41:55,062 INFO L82 PathProgramCache]: Analyzing trace with hash 576017724, now seen corresponding path program 66 times [2018-02-04 17:41:55,062 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:41:55,063 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:41:55,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:55,063 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:41:55,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:41:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:41:55,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:41:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:56,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:41:56,357 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:41:56,357 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:41:56,377 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-02-04 17:41:56,377 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:41:56,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:41:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:41:57,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:41:57,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68] total 136 [2018-02-04 17:41:57,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-02-04 17:41:57,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-02-04 17:41:57,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 17:41:57,520 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 137 states. [2018-02-04 17:42:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:01,287 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-02-04 17:42:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 17:42:01,287 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 337 [2018-02-04 17:42:01,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:01,288 INFO L225 Difference]: With dead ends: 348 [2018-02-04 17:42:01,288 INFO L226 Difference]: Without dead ends: 348 [2018-02-04 17:42:01,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8775 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4692, Invalid=13940, Unknown=0, NotChecked=0, Total=18632 [2018-02-04 17:42:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-04 17:42:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-02-04 17:42:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-02-04 17:42:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-02-04 17:42:01,290 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 337 [2018-02-04 17:42:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:01,290 INFO L432 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-02-04 17:42:01,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-02-04 17:42:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-02-04 17:42:01,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-02-04 17:42:01,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:01,291 INFO L351 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:01,291 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:01,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2142854071, now seen corresponding path program 67 times [2018-02-04 17:42:01,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:01,292 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:01,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:01,292 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:01,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:01,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:02,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:02,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:02,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:02,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11189 backedges. 0 proven. 11189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:02,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:02,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-02-04 17:42:02,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 17:42:02,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 17:42:02,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=2619, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 17:42:02,834 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 71 states. [2018-02-04 17:42:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:04,336 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-02-04 17:42:04,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 17:42:04,336 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-02-04 17:42:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:04,337 INFO L225 Difference]: With dead ends: 353 [2018-02-04 17:42:04,337 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 17:42:04,338 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7041, Invalid=11865, Unknown=0, NotChecked=0, Total=18906 [2018-02-04 17:42:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 17:42:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-02-04 17:42:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-04 17:42:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-02-04 17:42:04,340 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-02-04 17:42:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:04,340 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-02-04 17:42:04,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 17:42:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-02-04 17:42:04,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-02-04 17:42:04,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:04,341 INFO L351 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:04,341 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:04,341 INFO L82 PathProgramCache]: Analyzing trace with hash -271767012, now seen corresponding path program 68 times [2018-02-04 17:42:04,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:04,341 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:04,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:04,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:04,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:04,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:05,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:05,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:05,620 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:05,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:05,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:05,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:05,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:05,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-02-04 17:42:05,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 17:42:05,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 17:42:05,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2222, Invalid=2890, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 17:42:05,747 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 72 states. [2018-02-04 17:42:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:07,626 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-02-04 17:42:07,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 17:42:07,626 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 347 [2018-02-04 17:42:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:07,627 INFO L225 Difference]: With dead ends: 358 [2018-02-04 17:42:07,627 INFO L226 Difference]: Without dead ends: 358 [2018-02-04 17:42:07,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6843, Invalid=12617, Unknown=0, NotChecked=0, Total=19460 [2018-02-04 17:42:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-04 17:42:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-02-04 17:42:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 17:42:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-02-04 17:42:07,629 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 347 [2018-02-04 17:42:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:07,630 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-02-04 17:42:07,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 17:42:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-02-04 17:42:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-02-04 17:42:07,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:07,631 INFO L351 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:07,631 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -968650025, now seen corresponding path program 69 times [2018-02-04 17:42:07,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:07,631 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:07,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:07,631 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:07,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:07,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:08,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:08,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:08,948 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:42:08,967 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-02-04 17:42:08,967 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:08,980 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11868 backedges. 0 proven. 11868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:09,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:09,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-02-04 17:42:09,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-02-04 17:42:09,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-02-04 17:42:09,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2490, Invalid=2766, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 17:42:09,037 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 73 states. [2018-02-04 17:42:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:10,569 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-02-04 17:42:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-02-04 17:42:10,569 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-02-04 17:42:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:10,570 INFO L225 Difference]: With dead ends: 363 [2018-02-04 17:42:10,570 INFO L226 Difference]: Without dead ends: 363 [2018-02-04 17:42:10,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=7458, Invalid=12564, Unknown=0, NotChecked=0, Total=20022 [2018-02-04 17:42:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-04 17:42:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-02-04 17:42:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-02-04 17:42:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-02-04 17:42:10,572 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-02-04 17:42:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:10,572 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-02-04 17:42:10,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-02-04 17:42:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-02-04 17:42:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-02-04 17:42:10,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:10,574 INFO L351 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:10,574 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1084778236, now seen corresponding path program 70 times [2018-02-04 17:42:10,574 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:10,574 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:10,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:10,574 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:10,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:10,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:11,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:11,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:11,939 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:42:11,950 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:42:11,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:11,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12215 backedges. 0 proven. 12215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:12,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:12,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-02-04 17:42:12,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 17:42:12,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 17:42:12,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2492, Invalid=2910, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 17:42:12,028 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 74 states. [2018-02-04 17:42:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:13,743 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-02-04 17:42:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 17:42:13,744 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 357 [2018-02-04 17:42:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:13,744 INFO L225 Difference]: With dead ends: 368 [2018-02-04 17:42:13,745 INFO L226 Difference]: Without dead ends: 368 [2018-02-04 17:42:13,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=7531, Invalid=13061, Unknown=0, NotChecked=0, Total=20592 [2018-02-04 17:42:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-04 17:42:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-02-04 17:42:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-02-04 17:42:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-02-04 17:42:13,747 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 357 [2018-02-04 17:42:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:13,747 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-02-04 17:42:13,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 17:42:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-02-04 17:42:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-02-04 17:42:13,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:13,748 INFO L351 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:13,748 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1488231945, now seen corresponding path program 71 times [2018-02-04 17:42:13,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:13,749 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:13,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:13,749 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:13,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:13,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:15,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:15,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:15,135 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:42:15,168 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-02-04 17:42:15,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:15,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12567 backedges. 0 proven. 12567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:16,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:16,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 73] total 144 [2018-02-04 17:42:16,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-02-04 17:42:16,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-02-04 17:42:16,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5327, Invalid=15553, Unknown=0, NotChecked=0, Total=20880 [2018-02-04 17:42:16,760 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 145 states. [2018-02-04 17:42:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:21,793 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-02-04 17:42:21,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 17:42:21,793 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 362 [2018-02-04 17:42:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:21,794 INFO L225 Difference]: With dead ends: 373 [2018-02-04 17:42:21,794 INFO L226 Difference]: Without dead ends: 373 [2018-02-04 17:42:21,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16982 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=8305, Invalid=38135, Unknown=0, NotChecked=0, Total=46440 [2018-02-04 17:42:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-04 17:42:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-02-04 17:42:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-04 17:42:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-02-04 17:42:21,797 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-02-04 17:42:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:21,798 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-02-04 17:42:21,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-02-04 17:42:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-02-04 17:42:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-02-04 17:42:21,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:21,799 INFO L351 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:21,799 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1573194716, now seen corresponding path program 72 times [2018-02-04 17:42:21,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:21,799 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:21,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:21,799 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:21,800 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:21,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:23,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:23,220 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:23,221 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:42:23,244 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-02-04 17:42:23,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:23,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12924 backedges. 0 proven. 12924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:23,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:23,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 84 [2018-02-04 17:42:23,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-04 17:42:23,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-04 17:42:23,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=4364, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 17:42:23,567 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 85 states. [2018-02-04 17:42:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:26,118 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-02-04 17:42:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 17:42:26,119 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 367 [2018-02-04 17:42:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:26,119 INFO L225 Difference]: With dead ends: 378 [2018-02-04 17:42:26,119 INFO L226 Difference]: Without dead ends: 378 [2018-02-04 17:42:26,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=8291, Invalid=16201, Unknown=0, NotChecked=0, Total=24492 [2018-02-04 17:42:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-02-04 17:42:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-02-04 17:42:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 17:42:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-02-04 17:42:26,122 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 367 [2018-02-04 17:42:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:26,122 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-02-04 17:42:26,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-02-04 17:42:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-02-04 17:42:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-02-04 17:42:26,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:26,123 INFO L351 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:26,123 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1263351529, now seen corresponding path program 73 times [2018-02-04 17:42:26,123 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:26,123 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:26,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:26,124 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:26,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:26,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:27,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:27,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:27,593 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:27,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13286 backedges. 0 proven. 13286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:27,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:27,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-02-04 17:42:27,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 17:42:27,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 17:42:27,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2780, Invalid=3072, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 17:42:27,668 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 77 states. [2018-02-04 17:42:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:29,320 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-02-04 17:42:29,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-02-04 17:42:29,320 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-02-04 17:42:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:29,321 INFO L225 Difference]: With dead ends: 383 [2018-02-04 17:42:29,321 INFO L226 Difference]: Without dead ends: 383 [2018-02-04 17:42:29,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=8328, Invalid=14022, Unknown=0, NotChecked=0, Total=22350 [2018-02-04 17:42:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-02-04 17:42:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-02-04 17:42:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-02-04 17:42:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-02-04 17:42:29,324 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-02-04 17:42:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:29,324 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-02-04 17:42:29,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 17:42:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-02-04 17:42:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-02-04 17:42:29,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:29,326 INFO L351 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:29,326 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1837033284, now seen corresponding path program 74 times [2018-02-04 17:42:29,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:29,326 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:29,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:29,326 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:42:29,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:29,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:30,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:30,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:30,873 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:42:30,884 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:42:30,885 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:30,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:30,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13653 backedges. 0 proven. 13653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:30,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:30,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-02-04 17:42:30,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 17:42:30,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 17:42:30,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2782, Invalid=3224, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 17:42:30,969 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 78 states. [2018-02-04 17:42:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:32,850 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-02-04 17:42:32,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 17:42:32,850 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-02-04 17:42:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:32,851 INFO L225 Difference]: With dead ends: 388 [2018-02-04 17:42:32,851 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 17:42:32,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8405, Invalid=14547, Unknown=0, NotChecked=0, Total=22952 [2018-02-04 17:42:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 17:42:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-02-04 17:42:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-02-04 17:42:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-02-04 17:42:32,855 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 377 [2018-02-04 17:42:32,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:32,855 INFO L432 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-02-04 17:42:32,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 17:42:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-02-04 17:42:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-02-04 17:42:32,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:32,856 INFO L351 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:32,856 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:32,856 INFO L82 PathProgramCache]: Analyzing trace with hash 232507447, now seen corresponding path program 75 times [2018-02-04 17:42:32,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:32,856 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:32,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:32,857 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:32,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:32,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:34,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:34,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:34,429 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:42:34,451 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-02-04 17:42:34,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:34,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14025 backedges. 0 proven. 14025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:34,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:34,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-02-04 17:42:34,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-02-04 17:42:34,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-02-04 17:42:34,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2931, Invalid=3231, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 17:42:34,524 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 79 states. [2018-02-04 17:42:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:36,328 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-02-04 17:42:36,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-02-04 17:42:36,329 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-02-04 17:42:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:36,329 INFO L225 Difference]: With dead ends: 393 [2018-02-04 17:42:36,330 INFO L226 Difference]: Without dead ends: 393 [2018-02-04 17:42:36,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=8781, Invalid=14781, Unknown=0, NotChecked=0, Total=23562 [2018-02-04 17:42:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-04 17:42:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-02-04 17:42:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-02-04 17:42:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-02-04 17:42:36,332 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-02-04 17:42:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:36,333 INFO L432 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-02-04 17:42:36,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-02-04 17:42:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-02-04 17:42:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-02-04 17:42:36,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:36,335 INFO L351 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:36,335 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:36,335 INFO L82 PathProgramCache]: Analyzing trace with hash 213552540, now seen corresponding path program 76 times [2018-02-04 17:42:36,335 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:36,335 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:36,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:36,336 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:36,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:36,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:37,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:37,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:37,908 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 17:42:37,919 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 17:42:37,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:37,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 0 proven. 14402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:38,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:38,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-02-04 17:42:38,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-02-04 17:42:38,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-02-04 17:42:38,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2786, Invalid=3534, Unknown=0, NotChecked=0, Total=6320 [2018-02-04 17:42:38,014 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 80 states. [2018-02-04 17:42:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:40,221 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-02-04 17:42:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 17:42:40,222 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 387 [2018-02-04 17:42:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:40,223 INFO L225 Difference]: With dead ends: 398 [2018-02-04 17:42:40,223 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 17:42:40,224 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=8559, Invalid=15621, Unknown=0, NotChecked=0, Total=24180 [2018-02-04 17:42:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 17:42:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-02-04 17:42:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-02-04 17:42:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-02-04 17:42:40,226 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 387 [2018-02-04 17:42:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:40,226 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-02-04 17:42:40,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-02-04 17:42:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-02-04 17:42:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-02-04 17:42:40,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:40,227 INFO L351 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:40,227 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2141740887, now seen corresponding path program 77 times [2018-02-04 17:42:40,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:40,227 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:40,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:40,228 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:40,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:40,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:41,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:41,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:41,993 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 17:42:42,030 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-02-04 17:42:42,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:42,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14784 backedges. 0 proven. 14784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:43,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:43,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 79] total 156 [2018-02-04 17:42:43,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-02-04 17:42:43,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-02-04 17:42:43,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6239, Invalid=18253, Unknown=0, NotChecked=0, Total=24492 [2018-02-04 17:42:43,838 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 157 states. [2018-02-04 17:42:50,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:42:50,709 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-02-04 17:42:50,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 17:42:50,709 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 392 [2018-02-04 17:42:50,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:42:50,710 INFO L225 Difference]: With dead ends: 403 [2018-02-04 17:42:50,710 INFO L226 Difference]: Without dead ends: 403 [2018-02-04 17:42:50,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20033 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=9700, Invalid=44822, Unknown=0, NotChecked=0, Total=54522 [2018-02-04 17:42:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-04 17:42:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-02-04 17:42:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 17:42:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-02-04 17:42:50,715 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-02-04 17:42:50,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:42:50,715 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-02-04 17:42:50,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-02-04 17:42:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-02-04 17:42:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-02-04 17:42:50,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:42:50,716 INFO L351 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-02-04 17:42:50,716 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr0AssertViolation, mainErr2AssertViolation, mainErr4AssertViolation, mainErr3AssertViolation, mainErr1AssertViolation]=== [2018-02-04 17:42:50,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1127257476, now seen corresponding path program 78 times [2018-02-04 17:42:50,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:42:50,716 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:42:50,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:50,717 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:42:50,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:42:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:42:50,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:42:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:52,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:42:52,465 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:42:52,465 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 17:42:52,492 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-02-04 17:42:52,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:42:52,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:42:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15171 backedges. 0 proven. 15171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:42:52,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:42:52,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 84 [2018-02-04 17:42:52,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-02-04 17:42:52,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-02-04 17:42:52,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3178, Invalid=3962, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 17:42:52,645 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 85 states. Received shutdown request... [2018-02-04 17:42:53,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 17:42:53,872 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 17:42:53,879 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 17:42:53,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:42:53 BoogieIcfgContainer [2018-02-04 17:42:53,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:42:53,880 INFO L168 Benchmark]: Toolchain (without parser) took 180321.16 ms. Allocated memory was 395.3 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 353.4 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 214.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:53,881 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 395.3 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:42:53,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.87 ms. Allocated memory is still 395.3 MB. Free memory was 353.4 MB in the beginning and 345.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:53,881 INFO L168 Benchmark]: Boogie Preprocessor took 18.19 ms. Allocated memory is still 395.3 MB. Free memory was 345.4 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:53,881 INFO L168 Benchmark]: RCFGBuilder took 138.80 ms. Allocated memory is still 395.3 MB. Free memory was 344.1 MB in the beginning and 331.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:53,881 INFO L168 Benchmark]: TraceAbstraction took 180000.64 ms. Allocated memory was 395.3 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 331.4 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 192.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:42:53,882 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.14 ms. Allocated memory is still 395.3 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.87 ms. Allocated memory is still 395.3 MB. Free memory was 353.4 MB in the beginning and 345.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.19 ms. Allocated memory is still 395.3 MB. Free memory was 345.4 MB in the beginning and 344.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 138.80 ms. Allocated memory is still 395.3 MB. Free memory was 344.1 MB in the beginning and 331.4 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 180000.64 ms. Allocated memory was 395.3 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 331.4 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 192.1 MB. 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 (403states) and interpolant automaton (currently 57 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 140 known predicates. - 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 (403states) and interpolant automaton (currently 57 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 140 known predicates. - 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 (403states) and interpolant automaton (currently 57 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 140 known predicates. - 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 (403states) and interpolant automaton (currently 57 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 140 known predicates. - 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 (403states) and interpolant automaton (currently 57 states, 85 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 140 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 5 error locations. TIMEOUT Result, 179.9s OverallTime, 83 OverallIterations, 79 TraceHistogramMax, 109.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2049 SDtfs, 21453 SDslu, 67734 SDs, 0 SdLazy, 245401 SolverSat, 3376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21866 GetRequests, 15029 SyntacticMatches, 9 SemanticMatches, 6827 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196916 ImplicationChecksByTransitivity, 99.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=82, 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.2s AutomataMinimizationTime, 82 MinimizatonAttempts, 125 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 66.4s InterpolantComputationTime, 32056 NumberOfCodeBlocks, 32056 NumberOfCodeBlocksAsserted, 1776 NumberOfCheckSat, 31893 ConstructedInterpolants, 0 QuantifiedInterpolants, 30483093 SizeOfPredicates, 3 NumberOfNonLiveVariables, 35094 ConjunctsInSsa, 4450 ConjunctsInUnsatCore, 163 InterpolantComputations, 3 PerfectInterpolantSequences, 33/803157 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-04_17-42-53-888.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-04_17-42-53-888.csv Completed graceful shutdown