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/loop-acceleration/array3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:19:46,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:19:46,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:19:46,983 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:19:46,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:19:46,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:19:46,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:19:46,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:19:46,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:19:46,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:19:46,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:19:46,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:19:46,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:19:46,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:19:46,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:19:46,994 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:19:46,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:19:46,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:19:46,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:19:46,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:19:47,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:19:47,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:19:47,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:19:47,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:19:47,002 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:19:47,003 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:19:47,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:19:47,004 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:19:47,004 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:19:47,004 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:19:47,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:19:47,005 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 04:19:47,014 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:19:47,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:19:47,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:19:47,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:19:47,015 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:19:47,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:19:47,016 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:19:47,017 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:19:47,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:19:47,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:19:47,017 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:19:47,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:19:47,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:19:47,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:19:47,017 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:19:47,018 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:19:47,018 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:19:47,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:19:47,056 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:19:47,058 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:19:47,060 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:19:47,060 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:19:47,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array3_false-valid-deref.i [2018-02-04 04:19:47,134 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:19:47,135 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:19:47,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:19:47,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:19:47,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:19:47,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd3b65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47, skipping insertion in model container [2018-02-04 04:19:47,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,161 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:19:47,173 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:19:47,256 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:19:47,265 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:19:47,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47 WrapperNode [2018-02-04 04:19:47,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:19:47,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:19:47,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:19:47,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:19:47,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (1/1) ... [2018-02-04 04:19:47,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:19:47,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:19:47,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:19:47,288 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:19:47,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (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 04:19:47,327 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:19:47,327 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:19:47,327 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 04:19:47,327 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:19:47,328 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 04:19:47,328 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:19:47,328 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 04:19:47,328 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:19:47,328 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:19:47,328 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:19:47,411 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:19:47,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:19:47 BoogieIcfgContainer [2018-02-04 04:19:47,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:19:47,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:19:47,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:19:47,414 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:19:47,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:19:47" (1/3) ... [2018-02-04 04:19:47,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552c654b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:19:47, skipping insertion in model container [2018-02-04 04:19:47,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:19:47" (2/3) ... [2018-02-04 04:19:47,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552c654b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:19:47, skipping insertion in model container [2018-02-04 04:19:47,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:19:47" (3/3) ... [2018-02-04 04:19:47,416 INFO L107 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i [2018-02-04 04:19:47,421 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:19:47,424 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-02-04 04:19:47,446 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:19:47,446 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:19:47,446 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:19:47,446 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:19:47,446 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:19:47,446 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:19:47,446 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:19:47,446 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:19:47,447 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:19:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-02-04 04:19:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 04:19:47,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:47,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:47,460 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1213833872, now seen corresponding path program 1 times [2018-02-04 04:19:47,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:47,465 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:47,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:47,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:47,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:47,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:47,595 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 04:19:47,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:47,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:19:47,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:19:47,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:19:47,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:19:47,608 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2018-02-04 04:19:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:47,695 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 04:19:47,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:19:47,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 04:19:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:47,701 INFO L225 Difference]: With dead ends: 44 [2018-02-04 04:19:47,701 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 04:19:47,702 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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 04:19:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 04:19:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 04:19:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 04:19:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 04:19:47,765 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 8 [2018-02-04 04:19:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:47,766 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 04:19:47,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:19:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 04:19:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:19:47,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:47,767 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:47,767 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:47,767 INFO L82 PathProgramCache]: Analyzing trace with hash -863334142, now seen corresponding path program 1 times [2018-02-04 04:19:47,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:47,767 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:47,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:47,768 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:47,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:47,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:19:47,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:19:47,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:19:47,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:19:47,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:19:47,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:47,817 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 5 states. [2018-02-04 04:19:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:47,852 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 04:19:47,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:19:47,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 04:19:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:47,853 INFO L225 Difference]: With dead ends: 30 [2018-02-04 04:19:47,854 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 04:19:47,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 04:19:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-02-04 04:19:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 04:19:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-04 04:19:47,858 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2018-02-04 04:19:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:47,858 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-04 04:19:47,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:19:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-04 04:19:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 04:19:47,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:47,859 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:47,859 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:47,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1135364244, now seen corresponding path program 1 times [2018-02-04 04:19:47,859 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:47,859 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:47,860 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:47,861 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:47,861 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:47,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 04:19:47,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:47,934 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:47,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:47,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 04:19:47,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:47,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 04:19:47,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:19:47,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:19:47,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:47,973 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-02-04 04:19:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:48,040 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-04 04:19:48,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:19:48,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 04:19:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:48,041 INFO L225 Difference]: With dead ends: 44 [2018-02-04 04:19:48,041 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 04:19:48,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:19:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 04:19:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2018-02-04 04:19:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 04:19:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-02-04 04:19:48,046 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-02-04 04:19:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:48,046 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-02-04 04:19:48,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:19:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-02-04 04:19:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 04:19:48,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:48,047 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:48,047 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1230203493, now seen corresponding path program 2 times [2018-02-04 04:19:48,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:48,048 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:48,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,049 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:48,049 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:48,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 04:19:48,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:48,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:48,101 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:19:48,119 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:19:48,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:48,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 04:19:48,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:48,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 04:19:48,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:19:48,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:19:48,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:19:48,130 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2018-02-04 04:19:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:48,176 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 04:19:48,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:19:48,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-04 04:19:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:48,178 INFO L225 Difference]: With dead ends: 53 [2018-02-04 04:19:48,178 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 04:19:48,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:19:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 04:19:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-02-04 04:19:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 04:19:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-04 04:19:48,182 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2018-02-04 04:19:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:48,182 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-04 04:19:48,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:19:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-04 04:19:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 04:19:48,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:48,183 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:48,183 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash 417265886, now seen corresponding path program 3 times [2018-02-04 04:19:48,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:48,184 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:48,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,185 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:48,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:48,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 04:19:48,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:48,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:48,241 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:19:48,262 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 04:19:48,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:48,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-04 04:19:48,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:48,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2018-02-04 04:19:48,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:19:48,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:19:48,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:19:48,286 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 9 states. [2018-02-04 04:19:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:48,375 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 04:19:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:19:48,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-02-04 04:19:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:48,376 INFO L225 Difference]: With dead ends: 62 [2018-02-04 04:19:48,376 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 04:19:48,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:19:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 04:19:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-02-04 04:19:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 04:19:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-04 04:19:48,381 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 36 [2018-02-04 04:19:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:48,381 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-04 04:19:48,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:19:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-04 04:19:48,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 04:19:48,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:48,383 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:48,383 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:48,383 INFO L82 PathProgramCache]: Analyzing trace with hash 576961419, now seen corresponding path program 4 times [2018-02-04 04:19:48,383 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:48,383 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:48,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,384 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:48,384 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:48,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 04:19:48,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:48,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:48,449 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:19:48,461 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:19:48,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:48,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-04 04:19:48,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:48,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-02-04 04:19:48,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:19:48,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:19:48,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:19:48,488 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 12 states. [2018-02-04 04:19:48,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:48,599 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-02-04 04:19:48,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:19:48,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-04 04:19:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:48,600 INFO L225 Difference]: With dead ends: 71 [2018-02-04 04:19:48,600 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 04:19:48,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:19:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 04:19:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2018-02-04 04:19:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 04:19:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-04 04:19:48,605 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2018-02-04 04:19:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:48,605 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-04 04:19:48,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:19:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-04 04:19:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 04:19:48,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:48,608 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:48,608 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash -922733168, now seen corresponding path program 5 times [2018-02-04 04:19:48,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:48,609 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:48,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,610 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:48,610 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:48,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 04:19:48,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:48,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:48,685 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:19:48,746 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 04:19:48,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:48,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:48,770 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 04:19:48,771 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:48,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-02-04 04:19:48,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:19:48,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:19:48,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:19:48,772 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 9 states. [2018-02-04 04:19:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:48,863 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-02-04 04:19:48,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:19:48,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-04 04:19:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:48,864 INFO L225 Difference]: With dead ends: 80 [2018-02-04 04:19:48,865 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 04:19:48,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:19:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 04:19:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2018-02-04 04:19:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 04:19:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-02-04 04:19:48,868 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-02-04 04:19:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:48,869 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-02-04 04:19:48,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:19:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-02-04 04:19:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 04:19:48,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:48,870 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:48,870 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:48,870 INFO L82 PathProgramCache]: Analyzing trace with hash 582923081, now seen corresponding path program 6 times [2018-02-04 04:19:48,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:48,870 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:48,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,871 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:48,871 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:48,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 04:19:48,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:48,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:48,939 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:19:48,954 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-02-04 04:19:48,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:48,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-04 04:19:48,991 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:48,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2018-02-04 04:19:48,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:19:48,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:19:48,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:19:48,993 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2018-02-04 04:19:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:49,127 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-02-04 04:19:49,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:19:49,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-02-04 04:19:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:49,129 INFO L225 Difference]: With dead ends: 89 [2018-02-04 04:19:49,129 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 04:19:49,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2018-02-04 04:19:49,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 04:19:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-02-04 04:19:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 04:19:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-02-04 04:19:49,134 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2018-02-04 04:19:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:49,134 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-02-04 04:19:49,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:19:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-02-04 04:19:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 04:19:49,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:49,135 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:49,135 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:49,135 INFO L82 PathProgramCache]: Analyzing trace with hash -119208768, now seen corresponding path program 7 times [2018-02-04 04:19:49,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:49,135 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:49,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:49,136 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:49,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:49,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 04:19:49,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:49,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:49,242 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:49,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 04:19:49,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:49,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-02-04 04:19:49,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:19:49,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:19:49,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:19:49,265 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 11 states. [2018-02-04 04:19:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:49,341 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-02-04 04:19:49,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:19:49,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-02-04 04:19:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:49,343 INFO L225 Difference]: With dead ends: 98 [2018-02-04 04:19:49,343 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 04:19:49,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:19:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 04:19:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-02-04 04:19:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 04:19:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-02-04 04:19:49,349 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2018-02-04 04:19:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:49,349 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-02-04 04:19:49,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:19:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-02-04 04:19:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 04:19:49,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:49,350 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:49,350 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1755339687, now seen corresponding path program 8 times [2018-02-04 04:19:49,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:49,351 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:49,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:49,352 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:49,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:49,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 04:19:49,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:49,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:49,427 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:19:49,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:19:49,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:49,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 04:19:49,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:49,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-02-04 04:19:49,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:19:49,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:19:49,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:19:49,462 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 12 states. [2018-02-04 04:19:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:49,549 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-02-04 04:19:49,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:19:49,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-02-04 04:19:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:49,550 INFO L225 Difference]: With dead ends: 107 [2018-02-04 04:19:49,550 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 04:19:49,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:19:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 04:19:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 76. [2018-02-04 04:19:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 04:19:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-04 04:19:49,554 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2018-02-04 04:19:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:49,555 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-04 04:19:49,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:19:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-04 04:19:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 04:19:49,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:49,556 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:49,556 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1266149134, now seen corresponding path program 9 times [2018-02-04 04:19:49,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:49,556 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:49,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:49,557 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:49,557 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:49,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-04 04:19:49,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:49,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:49,664 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:19:49,676 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 04:19:49,676 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:49,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 04:19:49,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:49,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 15 [2018-02-04 04:19:49,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:19:49,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:19:49,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=115, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:19:49,702 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 15 states. [2018-02-04 04:19:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:49,864 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-04 04:19:49,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:19:49,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-02-04 04:19:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:49,865 INFO L225 Difference]: With dead ends: 116 [2018-02-04 04:19:49,865 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 04:19:49,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=215, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:19:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 04:19:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2018-02-04 04:19:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 04:19:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-02-04 04:19:49,870 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 75 [2018-02-04 04:19:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:49,870 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-02-04 04:19:49,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:19:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-02-04 04:19:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 04:19:49,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:49,872 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:49,872 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash 449763885, now seen corresponding path program 10 times [2018-02-04 04:19:49,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:49,872 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:49,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:49,873 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:49,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:49,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-02-04 04:19:49,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:49,956 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:49,956 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:19:49,963 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:19:49,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:49,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-02-04 04:19:50,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:50,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 21 [2018-02-04 04:19:50,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:19:50,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:19:50,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=252, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:19:50,011 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 21 states. [2018-02-04 04:19:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:50,175 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-02-04 04:19:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:19:50,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-02-04 04:19:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:50,176 INFO L225 Difference]: With dead ends: 125 [2018-02-04 04:19:50,176 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 04:19:50,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=168, Invalid=252, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:19:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 04:19:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2018-02-04 04:19:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 04:19:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-02-04 04:19:50,179 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-02-04 04:19:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:50,180 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-02-04 04:19:50,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:19:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-02-04 04:19:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 04:19:50,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:50,180 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:50,180 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2072720996, now seen corresponding path program 11 times [2018-02-04 04:19:50,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:50,181 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:50,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:50,182 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:50,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:50,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-04 04:19:50,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:50,312 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:50,313 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:19:50,379 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-02-04 04:19:50,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:50,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-04 04:19:50,397 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:50,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-02-04 04:19:50,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:19:50,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:19:50,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:19:50,398 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 15 states. [2018-02-04 04:19:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:50,507 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-02-04 04:19:50,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 04:19:50,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-02-04 04:19:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:50,508 INFO L225 Difference]: With dead ends: 134 [2018-02-04 04:19:50,509 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 04:19:50,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:19:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 04:19:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2018-02-04 04:19:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 04:19:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-02-04 04:19:50,512 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 93 [2018-02-04 04:19:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:50,512 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-02-04 04:19:50,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:19:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-02-04 04:19:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 04:19:50,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:50,514 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:50,514 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1681309123, now seen corresponding path program 12 times [2018-02-04 04:19:50,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:50,515 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:50,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:50,516 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:50,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:50,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-02-04 04:19:50,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:50,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:50,631 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:19:50,652 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-02-04 04:19:50,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:50,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-02-04 04:19:50,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:50,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 18 [2018-02-04 04:19:50,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:19:50,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:19:50,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:19:50,676 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 18 states. [2018-02-04 04:19:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:50,831 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-02-04 04:19:50,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:19:50,831 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2018-02-04 04:19:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:50,832 INFO L225 Difference]: With dead ends: 143 [2018-02-04 04:19:50,832 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 04:19:50,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:19:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 04:19:50,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2018-02-04 04:19:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 04:19:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-02-04 04:19:50,836 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 97 [2018-02-04 04:19:50,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:50,836 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-02-04 04:19:50,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:19:50,836 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-02-04 04:19:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-04 04:19:50,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:50,838 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:50,838 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash 572677080, now seen corresponding path program 13 times [2018-02-04 04:19:50,838 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:50,838 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:50,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:50,839 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:50,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:50,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-02-04 04:19:50,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:50,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:50,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:50,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-02-04 04:19:51,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:51,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-02-04 04:19:51,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:19:51,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:19:51,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:19:51,013 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 17 states. [2018-02-04 04:19:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:51,103 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-02-04 04:19:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 04:19:51,103 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2018-02-04 04:19:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:51,104 INFO L225 Difference]: With dead ends: 152 [2018-02-04 04:19:51,104 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 04:19:51,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:19:51,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 04:19:51,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2018-02-04 04:19:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 04:19:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-02-04 04:19:51,107 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2018-02-04 04:19:51,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:51,108 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-02-04 04:19:51,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:19:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-02-04 04:19:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 04:19:51,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:51,109 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:51,109 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1895210769, now seen corresponding path program 14 times [2018-02-04 04:19:51,110 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:51,110 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:51,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:51,110 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:51,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:51,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-02-04 04:19:51,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:51,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:51,222 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:19:51,229 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:19:51,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:51,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-02-04 04:19:51,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:51,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 27 [2018-02-04 04:19:51,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:19:51,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:19:51,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=423, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:19:51,274 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 27 states. [2018-02-04 04:19:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:51,591 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-02-04 04:19:51,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 04:19:51,591 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-02-04 04:19:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:51,592 INFO L225 Difference]: With dead ends: 161 [2018-02-04 04:19:51,592 INFO L226 Difference]: Without dead ends: 161 [2018-02-04 04:19:51,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=279, Invalid=423, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:19:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-04 04:19:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-02-04 04:19:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 04:19:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-02-04 04:19:51,599 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 110 [2018-02-04 04:19:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:51,599 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-02-04 04:19:51,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:19:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-02-04 04:19:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-02-04 04:19:51,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:51,600 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:51,601 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash -394157960, now seen corresponding path program 15 times [2018-02-04 04:19:51,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:51,601 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:51,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:51,602 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:51,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:51,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-02-04 04:19:51,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:51,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:51,758 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:19:51,775 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-02-04 04:19:51,775 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:51,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-02-04 04:19:51,816 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:51,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 21 [2018-02-04 04:19:51,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:19:51,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:19:51,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:19:51,818 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 21 states. [2018-02-04 04:19:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:52,067 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-02-04 04:19:52,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:19:52,068 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-02-04 04:19:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:52,069 INFO L225 Difference]: With dead ends: 170 [2018-02-04 04:19:52,069 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 04:19:52,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=372, Invalid=498, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:19:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 04:19:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 129. [2018-02-04 04:19:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 04:19:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-02-04 04:19:52,072 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 119 [2018-02-04 04:19:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:52,073 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-02-04 04:19:52,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:19:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-02-04 04:19:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-04 04:19:52,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:52,074 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:52,074 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1009410435, now seen corresponding path program 16 times [2018-02-04 04:19:52,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:52,076 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:52,076 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:52,077 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:52,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:52,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-02-04 04:19:52,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:52,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:52,258 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:19:52,265 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:19:52,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:52,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-02-04 04:19:52,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:52,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-02-04 04:19:52,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 04:19:52,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 04:19:52,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:19:52,279 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 20 states. [2018-02-04 04:19:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:52,423 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-02-04 04:19:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 04:19:52,423 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 128 [2018-02-04 04:19:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:52,424 INFO L225 Difference]: With dead ends: 179 [2018-02-04 04:19:52,424 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 04:19:52,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:19:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 04:19:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 133. [2018-02-04 04:19:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 04:19:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-02-04 04:19:52,427 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2018-02-04 04:19:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:52,427 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-02-04 04:19:52,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 04:19:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-02-04 04:19:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-02-04 04:19:52,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:52,429 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:52,429 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1948615676, now seen corresponding path program 17 times [2018-02-04 04:19:52,429 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:52,429 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:52,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:52,430 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:52,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:52,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-02-04 04:19:52,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:52,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:52,631 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:19:52,766 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-02-04 04:19:52,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:52,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-02-04 04:19:52,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:52,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 32 [2018-02-04 04:19:52,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 04:19:52,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 04:19:52,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=606, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:19:52,867 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 32 states. [2018-02-04 04:19:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:53,399 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-02-04 04:19:53,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 04:19:53,399 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 132 [2018-02-04 04:19:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:53,400 INFO L225 Difference]: With dead ends: 188 [2018-02-04 04:19:53,400 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 04:19:53,401 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=386, Invalid=606, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:19:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 04:19:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 142. [2018-02-04 04:19:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 04:19:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-02-04 04:19:53,403 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 132 [2018-02-04 04:19:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:53,404 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-02-04 04:19:53,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 04:19:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-02-04 04:19:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 04:19:53,405 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:53,405 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:53,405 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:53,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1636065069, now seen corresponding path program 18 times [2018-02-04 04:19:53,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:53,406 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:53,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:53,406 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:53,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:53,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-02-04 04:19:53,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:53,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:53,604 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:19:53,632 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2018-02-04 04:19:53,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:53,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-02-04 04:19:53,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:53,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 24 [2018-02-04 04:19:53,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:19:53,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:19:53,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=298, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:19:53,666 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 24 states. [2018-02-04 04:19:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:53,885 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2018-02-04 04:19:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:19:53,885 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2018-02-04 04:19:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:53,886 INFO L225 Difference]: With dead ends: 197 [2018-02-04 04:19:53,886 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 04:19:53,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=507, Invalid=683, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:19:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 04:19:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 151. [2018-02-04 04:19:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 04:19:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-02-04 04:19:53,888 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 141 [2018-02-04 04:19:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:53,888 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-02-04 04:19:53,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:19:53,888 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-02-04 04:19:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-02-04 04:19:53,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:53,889 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:53,889 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:53,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2089739474, now seen corresponding path program 19 times [2018-02-04 04:19:53,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:53,889 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:53,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:53,890 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:53,890 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:53,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-04 04:19:54,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:54,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:54,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:54,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-04 04:19:54,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:54,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-02-04 04:19:54,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:19:54,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:19:54,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:19:54,110 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 23 states. [2018-02-04 04:19:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:54,269 INFO L93 Difference]: Finished difference Result 206 states and 215 transitions. [2018-02-04 04:19:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:19:54,269 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 150 [2018-02-04 04:19:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:54,270 INFO L225 Difference]: With dead ends: 206 [2018-02-04 04:19:54,270 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 04:19:54,270 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:19:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 04:19:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 155. [2018-02-04 04:19:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 04:19:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-02-04 04:19:54,274 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 150 [2018-02-04 04:19:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:54,274 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-02-04 04:19:54,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:19:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-02-04 04:19:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-04 04:19:54,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:54,275 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:54,275 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:54,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1693986023, now seen corresponding path program 20 times [2018-02-04 04:19:54,275 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:54,276 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:54,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:54,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:54,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:54,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-04 04:19:54,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:54,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:54,539 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:19:54,550 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:19:54,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:54,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-04 04:19:54,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:54,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-02-04 04:19:54,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 04:19:54,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 04:19:54,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:19:54,579 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 24 states. [2018-02-04 04:19:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:54,758 INFO L93 Difference]: Finished difference Result 215 states and 225 transitions. [2018-02-04 04:19:54,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 04:19:54,759 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 154 [2018-02-04 04:19:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:54,760 INFO L225 Difference]: With dead ends: 215 [2018-02-04 04:19:54,760 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 04:19:54,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-02-04 04:19:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 04:19:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 159. [2018-02-04 04:19:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-04 04:19:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-02-04 04:19:54,764 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-02-04 04:19:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:54,764 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-02-04 04:19:54,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 04:19:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-02-04 04:19:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-02-04 04:19:54,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:54,765 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:54,765 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash 616413728, now seen corresponding path program 21 times [2018-02-04 04:19:54,765 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:54,766 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:54,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:54,766 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:54,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:54,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-02-04 04:19:55,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:55,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:55,053 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:19:55,073 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-02-04 04:19:55,073 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:55,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-02-04 04:19:55,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:55,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15] total 27 [2018-02-04 04:19:55,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:19:55,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:19:55,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:19:55,125 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 27 states. [2018-02-04 04:19:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:55,421 INFO L93 Difference]: Finished difference Result 224 states and 234 transitions. [2018-02-04 04:19:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:19:55,421 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 158 [2018-02-04 04:19:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:55,422 INFO L225 Difference]: With dead ends: 224 [2018-02-04 04:19:55,422 INFO L226 Difference]: Without dead ends: 224 [2018-02-04 04:19:55,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=639, Invalid=843, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:19:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-04 04:19:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 168. [2018-02-04 04:19:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 04:19:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-02-04 04:19:55,426 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 158 [2018-02-04 04:19:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:55,426 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-02-04 04:19:55,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:19:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-02-04 04:19:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-02-04 04:19:55,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:55,428 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:55,428 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:55,428 INFO L82 PathProgramCache]: Analyzing trace with hash -294777655, now seen corresponding path program 22 times [2018-02-04 04:19:55,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:55,428 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:55,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:55,429 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:55,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:55,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-02-04 04:19:55,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:55,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:55,775 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:19:55,787 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:19:55,787 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:55,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-02-04 04:19:55,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:55,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15] total 40 [2018-02-04 04:19:55,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 04:19:55,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 04:19:55,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=962, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:19:55,903 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 40 states. [2018-02-04 04:19:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:56,462 INFO L93 Difference]: Finished difference Result 233 states and 243 transitions. [2018-02-04 04:19:56,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:19:56,463 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 167 [2018-02-04 04:19:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:56,463 INFO L225 Difference]: With dead ends: 233 [2018-02-04 04:19:56,463 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 04:19:56,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=598, Invalid=962, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 04:19:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 04:19:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 177. [2018-02-04 04:19:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 04:19:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-02-04 04:19:56,466 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 167 [2018-02-04 04:19:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:56,466 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-02-04 04:19:56,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 04:19:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-02-04 04:19:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-02-04 04:19:56,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:56,466 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:56,467 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1773352494, now seen corresponding path program 23 times [2018-02-04 04:19:56,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:56,467 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:56,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:56,467 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:56,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:56,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-04 04:19:56,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:56,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:56,783 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:19:57,246 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-02-04 04:19:57,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:57,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1635 backedges. 0 proven. 1152 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-04 04:19:57,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:57,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-02-04 04:19:57,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 04:19:57,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 04:19:57,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:19:57,291 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 27 states. [2018-02-04 04:19:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:57,479 INFO L93 Difference]: Finished difference Result 242 states and 253 transitions. [2018-02-04 04:19:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 04:19:57,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 176 [2018-02-04 04:19:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:57,480 INFO L225 Difference]: With dead ends: 242 [2018-02-04 04:19:57,480 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 04:19:57,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:19:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 04:19:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 181. [2018-02-04 04:19:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 04:19:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-02-04 04:19:57,485 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2018-02-04 04:19:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:57,486 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-02-04 04:19:57,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 04:19:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-02-04 04:19:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-04 04:19:57,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:57,487 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:57,487 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash -624576949, now seen corresponding path program 24 times [2018-02-04 04:19:57,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:57,487 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:57,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:57,488 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:57,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:57,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:57,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 0 proven. 1250 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-02-04 04:19:57,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:57,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:57,851 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:19:57,928 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-02-04 04:19:57,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:57,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2018-02-04 04:19:57,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:57,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 30 [2018-02-04 04:19:57,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 04:19:57,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 04:19:57,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=463, Unknown=0, NotChecked=0, Total=870 [2018-02-04 04:19:57,977 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 30 states. [2018-02-04 04:19:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:58,293 INFO L93 Difference]: Finished difference Result 251 states and 262 transitions. [2018-02-04 04:19:58,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:19:58,293 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 180 [2018-02-04 04:19:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:58,294 INFO L225 Difference]: With dead ends: 251 [2018-02-04 04:19:58,294 INFO L226 Difference]: Without dead ends: 251 [2018-02-04 04:19:58,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=813, Invalid=1079, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:19:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-04 04:19:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 190. [2018-02-04 04:19:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-04 04:19:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-02-04 04:19:58,298 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 180 [2018-02-04 04:19:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:58,298 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-02-04 04:19:58,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 04:19:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-02-04 04:19:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-04 04:19:58,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:58,299 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:58,299 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:58,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1687700418, now seen corresponding path program 25 times [2018-02-04 04:19:58,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:58,299 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:58,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:58,300 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:58,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:58,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1907 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-02-04 04:19:58,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:58,652 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:58,653 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:58,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1907 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-02-04 04:19:58,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:58,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-02-04 04:19:58,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 04:19:58,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 04:19:58,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:19:58,701 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 29 states. [2018-02-04 04:19:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:58,894 INFO L93 Difference]: Finished difference Result 260 states and 272 transitions. [2018-02-04 04:19:58,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:19:58,895 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 189 [2018-02-04 04:19:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:58,896 INFO L225 Difference]: With dead ends: 260 [2018-02-04 04:19:58,896 INFO L226 Difference]: Without dead ends: 260 [2018-02-04 04:19:58,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-02-04 04:19:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-04 04:19:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 194. [2018-02-04 04:19:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-04 04:19:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-02-04 04:19:58,900 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 189 [2018-02-04 04:19:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:58,900 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-02-04 04:19:58,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 04:19:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-02-04 04:19:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-02-04 04:19:58,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:58,902 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:58,902 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1851614107, now seen corresponding path program 26 times [2018-02-04 04:19:58,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:58,902 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:58,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:58,903 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:19:58,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:58,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:19:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2013 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2018-02-04 04:19:59,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:19:59,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:19:59,337 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:19:59,349 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:19:59,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:19:59,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:19:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2013 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2018-02-04 04:19:59,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:19:59,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 18] total 35 [2018-02-04 04:19:59,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:19:59,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:19:59,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=670, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:19:59,428 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 35 states. [2018-02-04 04:19:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:19:59,774 INFO L93 Difference]: Finished difference Result 269 states and 281 transitions. [2018-02-04 04:19:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 04:19:59,774 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 193 [2018-02-04 04:19:59,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:19:59,775 INFO L225 Difference]: With dead ends: 269 [2018-02-04 04:19:59,775 INFO L226 Difference]: Without dead ends: 269 [2018-02-04 04:19:59,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=979, Invalid=1471, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 04:19:59,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-04 04:19:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 203. [2018-02-04 04:19:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 04:19:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-02-04 04:19:59,780 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 193 [2018-02-04 04:19:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:19:59,780 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-02-04 04:19:59,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:19:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-02-04 04:19:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-02-04 04:19:59,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:19:59,781 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:19:59,781 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:19:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash -323819914, now seen corresponding path program 27 times [2018-02-04 04:19:59,782 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:19:59,782 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:19:59,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:59,782 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:19:59,783 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:19:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:19:59,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 1568 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2018-02-04 04:20:00,204 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:00,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:00,205 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:20:00,223 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-02-04 04:20:00,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:00,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2018-02-04 04:20:00,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:00,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19] total 33 [2018-02-04 04:20:00,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 04:20:00,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 04:20:00,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=560, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:20:00,279 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 33 states. [2018-02-04 04:20:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:00,681 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2018-02-04 04:20:00,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:20:00,681 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 202 [2018-02-04 04:20:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:00,682 INFO L225 Difference]: With dead ends: 278 [2018-02-04 04:20:00,683 INFO L226 Difference]: Without dead ends: 278 [2018-02-04 04:20:00,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1008, Invalid=1344, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 04:20:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-04 04:20:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 212. [2018-02-04 04:20:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-04 04:20:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-02-04 04:20:00,687 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 202 [2018-02-04 04:20:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:00,687 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-02-04 04:20:00,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 04:20:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-02-04 04:20:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-02-04 04:20:00,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:00,688 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:00,688 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2142656589, now seen corresponding path program 28 times [2018-02-04 04:20:00,689 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:00,689 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:00,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:00,689 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:00,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:00,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-02-04 04:20:01,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:01,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:01,151 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:20:01,159 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:20:01,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:01,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 0 proven. 1682 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-02-04 04:20:01,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:01,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-02-04 04:20:01,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 04:20:01,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 04:20:01,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:20:01,184 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 32 states. [2018-02-04 04:20:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:01,373 INFO L93 Difference]: Finished difference Result 287 states and 300 transitions. [2018-02-04 04:20:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:20:01,373 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 211 [2018-02-04 04:20:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:01,374 INFO L225 Difference]: With dead ends: 287 [2018-02-04 04:20:01,374 INFO L226 Difference]: Without dead ends: 287 [2018-02-04 04:20:01,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-02-04 04:20:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-04 04:20:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 216. [2018-02-04 04:20:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 04:20:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-02-04 04:20:01,377 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 211 [2018-02-04 04:20:01,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:01,377 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-02-04 04:20:01,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 04:20:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-02-04 04:20:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-02-04 04:20:01,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:01,378 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:01,378 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:01,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1655365786, now seen corresponding path program 29 times [2018-02-04 04:20:01,378 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:01,378 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:01,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:01,379 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:01,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:01,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2514 backedges. 0 proven. 1800 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2018-02-04 04:20:01,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:01,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:01,812 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:20:02,966 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-02-04 04:20:02,966 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:02,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2514 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-02-04 04:20:03,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:03,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20] total 51 [2018-02-04 04:20:03,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 04:20:03,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 04:20:03,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=969, Invalid=1581, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:20:03,467 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 51 states. [2018-02-04 04:20:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:04,332 INFO L93 Difference]: Finished difference Result 296 states and 309 transitions. [2018-02-04 04:20:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 04:20:04,332 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 215 [2018-02-04 04:20:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:04,332 INFO L225 Difference]: With dead ends: 296 [2018-02-04 04:20:04,333 INFO L226 Difference]: Without dead ends: 296 [2018-02-04 04:20:04,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=969, Invalid=1581, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:20:04,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-04 04:20:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 225. [2018-02-04 04:20:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 04:20:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-02-04 04:20:04,335 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 215 [2018-02-04 04:20:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:04,335 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-02-04 04:20:04,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 04:20:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-02-04 04:20:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-02-04 04:20:04,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:04,336 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:04,336 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1187546463, now seen corresponding path program 30 times [2018-02-04 04:20:04,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:04,337 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:04,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:04,337 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:04,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:04,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2723 backedges. 0 proven. 1922 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2018-02-04 04:20:04,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:04,783 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:04,784 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:20:04,824 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-02-04 04:20:04,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:04,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2723 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2018-02-04 04:20:04,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:04,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 21] total 36 [2018-02-04 04:20:04,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 04:20:04,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 04:20:04,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=666, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:20:04,866 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 36 states. [2018-02-04 04:20:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:05,309 INFO L93 Difference]: Finished difference Result 305 states and 318 transitions. [2018-02-04 04:20:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:20:05,310 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 224 [2018-02-04 04:20:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:05,310 INFO L225 Difference]: With dead ends: 305 [2018-02-04 04:20:05,311 INFO L226 Difference]: Without dead ends: 305 [2018-02-04 04:20:05,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1224, Invalid=1638, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:20:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-04 04:20:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 234. [2018-02-04 04:20:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 04:20:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-02-04 04:20:05,314 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 224 [2018-02-04 04:20:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:05,314 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-02-04 04:20:05,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 04:20:05,314 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-02-04 04:20:05,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-02-04 04:20:05,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:05,316 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:05,316 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:05,316 INFO L82 PathProgramCache]: Analyzing trace with hash -51667160, now seen corresponding path program 31 times [2018-02-04 04:20:05,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:05,316 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:05,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:05,317 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:05,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:05,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-02-04 04:20:05,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:05,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:05,729 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:05,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2048 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-02-04 04:20:05,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:05,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-02-04 04:20:05,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 04:20:05,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 04:20:05,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:20:05,781 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 35 states. [2018-02-04 04:20:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:05,957 INFO L93 Difference]: Finished difference Result 314 states and 328 transitions. [2018-02-04 04:20:05,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 04:20:05,957 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 233 [2018-02-04 04:20:05,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:05,958 INFO L225 Difference]: With dead ends: 314 [2018-02-04 04:20:05,958 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 04:20:05,958 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:20:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 04:20:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 238. [2018-02-04 04:20:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-04 04:20:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-02-04 04:20:05,962 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 233 [2018-02-04 04:20:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:05,962 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-02-04 04:20:05,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 04:20:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-02-04 04:20:05,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-04 04:20:05,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:05,963 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:05,963 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1020534991, now seen corresponding path program 32 times [2018-02-04 04:20:05,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:05,964 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:05,964 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:05,964 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:05,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:05,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3071 backedges. 0 proven. 2178 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2018-02-04 04:20:06,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:06,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:06,342 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:20:06,350 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:20:06,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:06,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3071 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2018-02-04 04:20:06,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:06,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 21] total 56 [2018-02-04 04:20:06,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 04:20:06,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 04:20:06,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=1920, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:20:06,517 INFO L87 Difference]: Start difference. First operand 238 states and 239 transitions. Second operand 56 states. [2018-02-04 04:20:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:07,414 INFO L93 Difference]: Finished difference Result 323 states and 337 transitions. [2018-02-04 04:20:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:20:07,414 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 237 [2018-02-04 04:20:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:07,415 INFO L225 Difference]: With dead ends: 323 [2018-02-04 04:20:07,415 INFO L226 Difference]: Without dead ends: 323 [2018-02-04 04:20:07,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1160, Invalid=1920, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:20:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-04 04:20:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 247. [2018-02-04 04:20:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 04:20:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-02-04 04:20:07,418 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 237 [2018-02-04 04:20:07,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:07,418 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-02-04 04:20:07,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 04:20:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-02-04 04:20:07,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-02-04 04:20:07,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:07,419 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:07,419 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:07,419 INFO L82 PathProgramCache]: Analyzing trace with hash 713401036, now seen corresponding path program 33 times [2018-02-04 04:20:07,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:07,419 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:07,419 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:07,420 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:07,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:07,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 0 proven. 2312 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-02-04 04:20:07,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:07,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:07,910 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:20:07,941 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-02-04 04:20:07,941 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:07,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2018-02-04 04:20:08,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:08,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 23] total 39 [2018-02-04 04:20:08,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 04:20:08,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 04:20:08,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=781, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:20:08,023 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 39 states. [2018-02-04 04:20:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:08,601 INFO L93 Difference]: Finished difference Result 332 states and 346 transitions. [2018-02-04 04:20:08,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:20:08,601 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 246 [2018-02-04 04:20:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:08,602 INFO L225 Difference]: With dead ends: 332 [2018-02-04 04:20:08,602 INFO L226 Difference]: Without dead ends: 332 [2018-02-04 04:20:08,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1461, Invalid=1961, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:20:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-02-04 04:20:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 256. [2018-02-04 04:20:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-02-04 04:20:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 257 transitions. [2018-02-04 04:20:08,605 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 257 transitions. Word has length 246 [2018-02-04 04:20:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:08,605 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 257 transitions. [2018-02-04 04:20:08,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 04:20:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 257 transitions. [2018-02-04 04:20:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-02-04 04:20:08,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:08,606 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:08,606 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1935314275, now seen corresponding path program 34 times [2018-02-04 04:20:08,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:08,606 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:08,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:08,607 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:08,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:08,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-04 04:20:09,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:09,039 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:09,040 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:20:09,047 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:20:09,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:09,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3542 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-04 04:20:09,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:09,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-02-04 04:20:09,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-04 04:20:09,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-04 04:20:09,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:20:09,083 INFO L87 Difference]: Start difference. First operand 256 states and 257 transitions. Second operand 38 states. [2018-02-04 04:20:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:09,280 INFO L93 Difference]: Finished difference Result 341 states and 356 transitions. [2018-02-04 04:20:09,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:20:09,281 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 255 [2018-02-04 04:20:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:09,282 INFO L225 Difference]: With dead ends: 341 [2018-02-04 04:20:09,282 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 04:20:09,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:20:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 04:20:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 260. [2018-02-04 04:20:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-04 04:20:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2018-02-04 04:20:09,284 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 255 [2018-02-04 04:20:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:09,284 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2018-02-04 04:20:09,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-04 04:20:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2018-02-04 04:20:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-02-04 04:20:09,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:09,285 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:09,285 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash -752734972, now seen corresponding path program 35 times [2018-02-04 04:20:09,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:09,285 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:09,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:09,286 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:09,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:09,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-04 04:20:09,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:09,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:09,734 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:20:11,825 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-02-04 04:20:11,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:11,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 2592 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-04 04:20:11,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:11,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-02-04 04:20:11,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 04:20:11,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 04:20:11,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:20:11,880 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 39 states. [2018-02-04 04:20:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:12,104 INFO L93 Difference]: Finished difference Result 350 states and 366 transitions. [2018-02-04 04:20:12,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 04:20:12,105 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 259 [2018-02-04 04:20:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:12,105 INFO L225 Difference]: With dead ends: 350 [2018-02-04 04:20:12,106 INFO L226 Difference]: Without dead ends: 350 [2018-02-04 04:20:12,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 04:20:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-02-04 04:20:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 264. [2018-02-04 04:20:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-04 04:20:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2018-02-04 04:20:12,108 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 259 [2018-02-04 04:20:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:12,108 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2018-02-04 04:20:12,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 04:20:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2018-02-04 04:20:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-02-04 04:20:12,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:12,109 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:12,109 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:12,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1101177877, now seen corresponding path program 36 times [2018-02-04 04:20:12,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:12,109 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:12,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:12,109 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:12,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:12,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3830 backedges. 0 proven. 2738 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2018-02-04 04:20:12,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:12,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:12,547 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:20:12,699 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2018-02-04 04:20:12,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:12,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3830 backedges. 0 proven. 1092 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2018-02-04 04:20:12,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:12,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 24] total 42 [2018-02-04 04:20:12,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-04 04:20:12,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-04 04:20:12,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=903, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:20:12,766 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 42 states. [2018-02-04 04:20:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:13,161 INFO L93 Difference]: Finished difference Result 359 states and 375 transitions. [2018-02-04 04:20:13,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:20:13,162 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 263 [2018-02-04 04:20:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:13,162 INFO L225 Difference]: With dead ends: 359 [2018-02-04 04:20:13,162 INFO L226 Difference]: Without dead ends: 359 [2018-02-04 04:20:13,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1680, Invalid=2226, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:20:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-04 04:20:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 273. [2018-02-04 04:20:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-04 04:20:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-02-04 04:20:13,165 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 263 [2018-02-04 04:20:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:13,165 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-02-04 04:20:13,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-04 04:20:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-02-04 04:20:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-02-04 04:20:13,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:13,166 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:13,166 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:13,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1190317072, now seen corresponding path program 37 times [2018-02-04 04:20:13,166 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:13,166 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:13,167 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:13,167 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:13,167 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:13,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4087 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-02-04 04:20:13,661 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:13,661 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:13,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:13,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4087 backedges. 0 proven. 2888 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-02-04 04:20:13,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:13,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-02-04 04:20:13,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 04:20:13,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 04:20:13,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:20:13,727 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 41 states. [2018-02-04 04:20:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:13,967 INFO L93 Difference]: Finished difference Result 368 states and 385 transitions. [2018-02-04 04:20:13,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 04:20:13,968 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 272 [2018-02-04 04:20:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:13,968 INFO L225 Difference]: With dead ends: 368 [2018-02-04 04:20:13,968 INFO L226 Difference]: Without dead ends: 368 [2018-02-04 04:20:13,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 04:20:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-02-04 04:20:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 277. [2018-02-04 04:20:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-02-04 04:20:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-02-04 04:20:13,971 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 272 [2018-02-04 04:20:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:13,971 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-02-04 04:20:13,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 04:20:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-02-04 04:20:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-02-04 04:20:13,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:13,972 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:13,972 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash -821185431, now seen corresponding path program 38 times [2018-02-04 04:20:13,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:13,972 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:13,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:13,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:13,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:13,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 3042 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2018-02-04 04:20:14,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:14,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:14,512 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:20:14,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:20:14,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:14,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:14,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2018-02-04 04:20:14,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:14,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 25] total 46 [2018-02-04 04:20:14,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 04:20:14,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 04:20:14,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=947, Invalid=1123, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 04:20:14,626 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 46 states. [2018-02-04 04:20:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:15,104 INFO L93 Difference]: Finished difference Result 377 states and 394 transitions. [2018-02-04 04:20:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 04:20:15,104 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 276 [2018-02-04 04:20:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:15,105 INFO L225 Difference]: With dead ends: 377 [2018-02-04 04:20:15,105 INFO L226 Difference]: Without dead ends: 377 [2018-02-04 04:20:15,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1890, Invalid=2666, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:20:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-04 04:20:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 286. [2018-02-04 04:20:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-04 04:20:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 287 transitions. [2018-02-04 04:20:15,108 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 287 transitions. Word has length 276 [2018-02-04 04:20:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:15,108 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 287 transitions. [2018-02-04 04:20:15,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 04:20:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 287 transitions. [2018-02-04 04:20:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-04 04:20:15,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:15,109 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:15,109 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1230949600, now seen corresponding path program 39 times [2018-02-04 04:20:15,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:15,109 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:15,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:15,110 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:15,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:15,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 0 proven. 3200 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2018-02-04 04:20:15,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:15,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:15,629 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:20:15,670 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-02-04 04:20:15,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:15,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 0 proven. 1311 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2018-02-04 04:20:15,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:15,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 26] total 45 [2018-02-04 04:20:15,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 04:20:15,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 04:20:15,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=944, Invalid=1036, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:20:15,766 INFO L87 Difference]: Start difference. First operand 286 states and 287 transitions. Second operand 45 states. [2018-02-04 04:20:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:16,267 INFO L93 Difference]: Finished difference Result 386 states and 403 transitions. [2018-02-04 04:20:16,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:20:16,267 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 285 [2018-02-04 04:20:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:16,268 INFO L225 Difference]: With dead ends: 386 [2018-02-04 04:20:16,268 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 04:20:16,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1956, Invalid=2600, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:20:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 04:20:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 295. [2018-02-04 04:20:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 04:20:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-02-04 04:20:16,271 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 285 [2018-02-04 04:20:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:16,271 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-02-04 04:20:16,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 04:20:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-02-04 04:20:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-02-04 04:20:16,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:16,272 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:16,272 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:16,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2083529563, now seen corresponding path program 40 times [2018-02-04 04:20:16,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:16,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:16,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:16,272 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:16,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:16,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-04 04:20:16,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:16,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:16,823 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:20:16,833 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:20:16,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:16,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 3362 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-04 04:20:16,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:16,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-02-04 04:20:16,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 04:20:16,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 04:20:16,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:20:16,878 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 44 states. [2018-02-04 04:20:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:17,129 INFO L93 Difference]: Finished difference Result 395 states and 413 transitions. [2018-02-04 04:20:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-04 04:20:17,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 294 [2018-02-04 04:20:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:17,130 INFO L225 Difference]: With dead ends: 395 [2018-02-04 04:20:17,130 INFO L226 Difference]: Without dead ends: 395 [2018-02-04 04:20:17,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 04:20:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-02-04 04:20:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 299. [2018-02-04 04:20:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-04 04:20:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-02-04 04:20:17,134 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-02-04 04:20:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:17,134 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-02-04 04:20:17,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 04:20:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-02-04 04:20:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-02-04 04:20:17,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:17,136 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:17,136 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:17,136 INFO L82 PathProgramCache]: Analyzing trace with hash -264105196, now seen corresponding path program 41 times [2018-02-04 04:20:17,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:17,136 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:17,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:17,137 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:17,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:17,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:17,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4956 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-04 04:20:17,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:17,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:17,777 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:20:17,844 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-02-04 04:20:17,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:17,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4956 backedges. 0 proven. 3528 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-04 04:20:17,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:17,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-02-04 04:20:17,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-04 04:20:17,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-04 04:20:17,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:20:17,894 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 45 states. [2018-02-04 04:20:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:18,156 INFO L93 Difference]: Finished difference Result 404 states and 423 transitions. [2018-02-04 04:20:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 04:20:18,156 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 298 [2018-02-04 04:20:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:18,157 INFO L225 Difference]: With dead ends: 404 [2018-02-04 04:20:18,157 INFO L226 Difference]: Without dead ends: 404 [2018-02-04 04:20:18,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 04:20:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-02-04 04:20:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 303. [2018-02-04 04:20:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-04 04:20:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-02-04 04:20:18,160 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 298 [2018-02-04 04:20:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:18,160 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-02-04 04:20:18,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-04 04:20:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-02-04 04:20:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-02-04 04:20:18,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:18,163 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:18,163 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash 636714573, now seen corresponding path program 42 times [2018-02-04 04:20:18,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:18,163 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:18,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:18,164 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:18,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:18,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5126 backedges. 0 proven. 3698 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2018-02-04 04:20:18,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:18,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:18,820 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:20:18,938 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2018-02-04 04:20:18,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:18,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5126 backedges. 0 proven. 1428 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2018-02-04 04:20:19,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:19,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 27] total 48 [2018-02-04 04:20:19,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 04:20:19,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 04:20:19,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=1176, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 04:20:19,002 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 48 states. [2018-02-04 04:20:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:19,479 INFO L93 Difference]: Finished difference Result 413 states and 432 transitions. [2018-02-04 04:20:19,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:20:19,479 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 302 [2018-02-04 04:20:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:19,480 INFO L225 Difference]: With dead ends: 413 [2018-02-04 04:20:19,480 INFO L226 Difference]: Without dead ends: 413 [2018-02-04 04:20:19,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2208, Invalid=2904, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 04:20:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-02-04 04:20:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 312. [2018-02-04 04:20:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-04 04:20:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2018-02-04 04:20:19,482 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 302 [2018-02-04 04:20:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:19,482 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2018-02-04 04:20:19,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 04:20:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2018-02-04 04:20:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-02-04 04:20:19,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:19,483 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:19,483 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:19,483 INFO L82 PathProgramCache]: Analyzing trace with hash -611664196, now seen corresponding path program 43 times [2018-02-04 04:20:19,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:19,483 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:19,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:19,484 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:19,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:19,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5422 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-02-04 04:20:20,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:20,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:20,116 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:20,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5422 backedges. 0 proven. 3872 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-02-04 04:20:20,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:20,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-02-04 04:20:20,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 04:20:20,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 04:20:20,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:20:20,169 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 47 states. [2018-02-04 04:20:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:20,477 INFO L93 Difference]: Finished difference Result 422 states and 442 transitions. [2018-02-04 04:20:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 04:20:20,478 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 311 [2018-02-04 04:20:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:20,479 INFO L225 Difference]: With dead ends: 422 [2018-02-04 04:20:20,479 INFO L226 Difference]: Without dead ends: 422 [2018-02-04 04:20:20,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 04:20:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-04 04:20:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 316. [2018-02-04 04:20:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 04:20:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 317 transitions. [2018-02-04 04:20:20,482 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 317 transitions. Word has length 311 [2018-02-04 04:20:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:20,482 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 317 transitions. [2018-02-04 04:20:20,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 04:20:20,483 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 317 transitions. [2018-02-04 04:20:20,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-02-04 04:20:20,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:20,484 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:20,484 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:20,484 INFO L82 PathProgramCache]: Analyzing trace with hash 723589155, now seen corresponding path program 44 times [2018-02-04 04:20:20,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:20,484 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:20,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:20,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:20,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:20,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 0 proven. 4050 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2018-02-04 04:20:21,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:21,171 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:21,171 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:20:21,183 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:20:21,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:21,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 0 proven. 1550 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2018-02-04 04:20:21,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:21,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 28] total 52 [2018-02-04 04:20:21,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-04 04:20:21,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-04 04:20:21,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1226, Invalid=1426, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 04:20:21,253 INFO L87 Difference]: Start difference. First operand 316 states and 317 transitions. Second operand 52 states. [2018-02-04 04:20:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:21,843 INFO L93 Difference]: Finished difference Result 431 states and 451 transitions. [2018-02-04 04:20:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 04:20:21,843 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 315 [2018-02-04 04:20:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:21,844 INFO L225 Difference]: With dead ends: 431 [2018-02-04 04:20:21,844 INFO L226 Difference]: Without dead ends: 431 [2018-02-04 04:20:21,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2448, Invalid=3404, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 04:20:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-02-04 04:20:21,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 325. [2018-02-04 04:20:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-04 04:20:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-02-04 04:20:21,847 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 315 [2018-02-04 04:20:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:21,847 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-02-04 04:20:21,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-04 04:20:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-02-04 04:20:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-02-04 04:20:21,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:21,848 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:21,848 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2145714120, now seen corresponding path program 45 times [2018-02-04 04:20:21,848 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:21,848 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:21,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:21,849 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:21,849 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:21,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5909 backedges. 0 proven. 4232 refuted. 0 times theorem prover too weak. 1677 trivial. 0 not checked. [2018-02-04 04:20:22,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:22,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:22,543 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:20:22,582 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-02-04 04:20:22,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:22,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5909 backedges. 0 proven. 1677 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2018-02-04 04:20:22,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:22,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 29] total 51 [2018-02-04 04:20:22,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 04:20:22,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 04:20:22,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1223, Invalid=1327, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:20:22,666 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 51 states. [2018-02-04 04:20:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:23,264 INFO L93 Difference]: Finished difference Result 440 states and 460 transitions. [2018-02-04 04:20:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-04 04:20:23,264 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 324 [2018-02-04 04:20:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:23,265 INFO L225 Difference]: With dead ends: 440 [2018-02-04 04:20:23,265 INFO L226 Difference]: Without dead ends: 440 [2018-02-04 04:20:23,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2523, Invalid=3329, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 04:20:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-02-04 04:20:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 334. [2018-02-04 04:20:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-04 04:20:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 335 transitions. [2018-02-04 04:20:23,268 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 335 transitions. Word has length 324 [2018-02-04 04:20:23,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:23,268 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 335 transitions. [2018-02-04 04:20:23,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 04:20:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 335 transitions. [2018-02-04 04:20:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-02-04 04:20:23,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:23,269 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:23,269 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1921187727, now seen corresponding path program 46 times [2018-02-04 04:20:23,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:23,269 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:23,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:23,270 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:23,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:23,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6227 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2018-02-04 04:20:23,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:23,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:23,989 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:20:24,004 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:20:24,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:24,006 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6227 backedges. 0 proven. 1809 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2018-02-04 04:20:24,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:24,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 29] total 78 [2018-02-04 04:20:24,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 04:20:24,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 04:20:24,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2247, Invalid=3759, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 04:20:24,236 INFO L87 Difference]: Start difference. First operand 334 states and 335 transitions. Second operand 78 states. [2018-02-04 04:20:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:25,865 INFO L93 Difference]: Finished difference Result 449 states and 469 transitions. [2018-02-04 04:20:25,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 04:20:25,866 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 333 [2018-02-04 04:20:25,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:25,867 INFO L225 Difference]: With dead ends: 449 [2018-02-04 04:20:25,867 INFO L226 Difference]: Without dead ends: 449 [2018-02-04 04:20:25,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2632 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2247, Invalid=3759, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 04:20:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-02-04 04:20:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 343. [2018-02-04 04:20:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-04 04:20:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-02-04 04:20:25,870 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 333 [2018-02-04 04:20:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:25,870 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-02-04 04:20:25,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 04:20:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-02-04 04:20:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-02-04 04:20:25,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:25,872 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:25,872 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1330891882, now seen corresponding path program 47 times [2018-02-04 04:20:25,873 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:25,873 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:25,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:25,873 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:25,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:25,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6554 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2018-02-04 04:20:26,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:26,627 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:26,628 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:20:27,384 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-02-04 04:20:27,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:27,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6554 backedges. 0 proven. 4608 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2018-02-04 04:20:27,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:27,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-02-04 04:20:27,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-04 04:20:27,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-04 04:20:27,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:20:27,435 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 51 states. [2018-02-04 04:20:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:27,705 INFO L93 Difference]: Finished difference Result 458 states and 479 transitions. [2018-02-04 04:20:27,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 04:20:27,705 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 342 [2018-02-04 04:20:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:27,706 INFO L225 Difference]: With dead ends: 458 [2018-02-04 04:20:27,706 INFO L226 Difference]: Without dead ends: 458 [2018-02-04 04:20:27,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:20:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-02-04 04:20:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 347. [2018-02-04 04:20:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-02-04 04:20:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-02-04 04:20:27,708 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 342 [2018-02-04 04:20:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:27,708 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-02-04 04:20:27,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-04 04:20:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-02-04 04:20:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-02-04 04:20:27,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:27,709 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:27,709 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:27,710 INFO L82 PathProgramCache]: Analyzing trace with hash 513541667, now seen corresponding path program 48 times [2018-02-04 04:20:27,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:27,710 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:27,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:27,710 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:27,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:27,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6748 backedges. 0 proven. 4802 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2018-02-04 04:20:28,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:28,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:28,490 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:20:28,598 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 50 check-sat command(s) [2018-02-04 04:20:28,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:28,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6748 backedges. 0 proven. 1946 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2018-02-04 04:20:28,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:28,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 31] total 54 [2018-02-04 04:20:28,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-04 04:20:28,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-04 04:20:28,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1375, Invalid=1487, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 04:20:28,676 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 54 states. [2018-02-04 04:20:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:29,286 INFO L93 Difference]: Finished difference Result 467 states and 488 transitions. [2018-02-04 04:20:29,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 04:20:29,286 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 346 [2018-02-04 04:20:29,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:29,287 INFO L225 Difference]: With dead ends: 467 [2018-02-04 04:20:29,287 INFO L226 Difference]: Without dead ends: 467 [2018-02-04 04:20:29,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2859, Invalid=3783, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 04:20:29,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-02-04 04:20:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 356. [2018-02-04 04:20:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-02-04 04:20:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 357 transitions. [2018-02-04 04:20:29,290 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 357 transitions. Word has length 346 [2018-02-04 04:20:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:29,290 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 357 transitions. [2018-02-04 04:20:29,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-04 04:20:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 357 transitions. [2018-02-04 04:20:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-02-04 04:20:29,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:29,291 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:29,292 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash -466276826, now seen corresponding path program 49 times [2018-02-04 04:20:29,292 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:29,292 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:29,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:29,292 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:29,292 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:29,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7088 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-02-04 04:20:30,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:30,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:30,107 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:30,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7088 backedges. 0 proven. 5000 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-02-04 04:20:30,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:30,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-02-04 04:20:30,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-04 04:20:30,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-04 04:20:30,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:20:30,166 INFO L87 Difference]: Start difference. First operand 356 states and 357 transitions. Second operand 53 states. [2018-02-04 04:20:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:30,479 INFO L93 Difference]: Finished difference Result 476 states and 498 transitions. [2018-02-04 04:20:30,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 04:20:30,479 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 355 [2018-02-04 04:20:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:30,480 INFO L225 Difference]: With dead ends: 476 [2018-02-04 04:20:30,480 INFO L226 Difference]: Without dead ends: 476 [2018-02-04 04:20:30,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 04:20:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-02-04 04:20:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 360. [2018-02-04 04:20:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-02-04 04:20:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2018-02-04 04:20:30,482 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 355 [2018-02-04 04:20:30,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:30,483 INFO L432 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2018-02-04 04:20:30,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-04 04:20:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2018-02-04 04:20:30,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-02-04 04:20:30,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:30,484 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:30,484 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:30,484 INFO L82 PathProgramCache]: Analyzing trace with hash -988264179, now seen corresponding path program 50 times [2018-02-04 04:20:30,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:30,484 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:30,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:30,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:30,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:30,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7290 backedges. 0 proven. 5202 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2018-02-04 04:20:31,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:31,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:31,418 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:20:31,428 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:20:31,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:31,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:31,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7290 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2018-02-04 04:20:31,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:31,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 32] total 62 [2018-02-04 04:20:31,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 04:20:31,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 04:20:31,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1659, Invalid=2123, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:20:31,634 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 62 states. [2018-02-04 04:20:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:32,570 INFO L93 Difference]: Finished difference Result 485 states and 507 transitions. [2018-02-04 04:20:32,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-04 04:20:32,571 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 359 [2018-02-04 04:20:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:32,572 INFO L225 Difference]: With dead ends: 485 [2018-02-04 04:20:32,572 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 04:20:32,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3233, Invalid=4957, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 04:20:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 04:20:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 369. [2018-02-04 04:20:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-02-04 04:20:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-02-04 04:20:32,575 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 359 [2018-02-04 04:20:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:32,575 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-02-04 04:20:32,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 04:20:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-02-04 04:20:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-02-04 04:20:32,576 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:32,576 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:32,576 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1482375154, now seen corresponding path program 51 times [2018-02-04 04:20:32,576 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:32,576 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:32,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:32,577 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:32,577 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:32,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7643 backedges. 0 proven. 5408 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2018-02-04 04:20:33,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:33,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:33,478 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:20:33,537 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-02-04 04:20:33,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:33,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7643 backedges. 0 proven. 2235 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2018-02-04 04:20:33,618 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:33,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 33] total 57 [2018-02-04 04:20:33,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 04:20:33,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 04:20:33,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1536, Invalid=1656, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:20:33,619 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 57 states. [2018-02-04 04:20:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:34,308 INFO L93 Difference]: Finished difference Result 494 states and 516 transitions. [2018-02-04 04:20:34,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 04:20:34,308 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 368 [2018-02-04 04:20:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:34,309 INFO L225 Difference]: With dead ends: 494 [2018-02-04 04:20:34,309 INFO L226 Difference]: Without dead ends: 494 [2018-02-04 04:20:34,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3216, Invalid=4266, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:20:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-04 04:20:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 378. [2018-02-04 04:20:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-02-04 04:20:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-02-04 04:20:34,311 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 368 [2018-02-04 04:20:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:34,311 INFO L432 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-02-04 04:20:34,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 04:20:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-02-04 04:20:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-02-04 04:20:34,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:34,312 INFO L351 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:34,313 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1383131173, now seen corresponding path program 52 times [2018-02-04 04:20:34,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:34,313 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:34,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:34,313 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:34,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:34,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8005 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-04 04:20:35,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:35,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:35,254 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:20:35,266 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:20:35,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:35,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8005 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-04 04:20:35,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:35,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-02-04 04:20:35,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 04:20:35,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 04:20:35,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:20:35,321 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 56 states. [2018-02-04 04:20:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:35,652 INFO L93 Difference]: Finished difference Result 503 states and 526 transitions. [2018-02-04 04:20:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 04:20:35,653 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 377 [2018-02-04 04:20:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:35,653 INFO L225 Difference]: With dead ends: 503 [2018-02-04 04:20:35,654 INFO L226 Difference]: Without dead ends: 503 [2018-02-04 04:20:35,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 04:20:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-04 04:20:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 382. [2018-02-04 04:20:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-02-04 04:20:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 383 transitions. [2018-02-04 04:20:35,656 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 383 transitions. Word has length 377 [2018-02-04 04:20:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:35,656 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 383 transitions. [2018-02-04 04:20:35,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 04:20:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 383 transitions. [2018-02-04 04:20:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-02-04 04:20:35,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:35,657 INFO L351 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:35,658 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:35,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1854143362, now seen corresponding path program 53 times [2018-02-04 04:20:35,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:35,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:35,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:35,658 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:35,658 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:35,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8219 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-04 04:20:36,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:36,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:36,641 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:20:38,236 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2018-02-04 04:20:38,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:38,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8219 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-04 04:20:38,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:38,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-02-04 04:20:38,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 04:20:38,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 04:20:38,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:20:38,352 INFO L87 Difference]: Start difference. First operand 382 states and 383 transitions. Second operand 57 states. [2018-02-04 04:20:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:38,727 INFO L93 Difference]: Finished difference Result 512 states and 536 transitions. [2018-02-04 04:20:38,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 04:20:38,727 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 381 [2018-02-04 04:20:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:38,728 INFO L225 Difference]: With dead ends: 512 [2018-02-04 04:20:38,728 INFO L226 Difference]: Without dead ends: 512 [2018-02-04 04:20:38,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 04:20:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-02-04 04:20:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 386. [2018-02-04 04:20:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-02-04 04:20:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 387 transitions. [2018-02-04 04:20:38,730 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 387 transitions. Word has length 381 [2018-02-04 04:20:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:38,730 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 387 transitions. [2018-02-04 04:20:38,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 04:20:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 387 transitions. [2018-02-04 04:20:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-02-04 04:20:38,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:38,731 INFO L351 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:38,731 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash 494973865, now seen corresponding path program 54 times [2018-02-04 04:20:38,731 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:38,731 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:38,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:38,732 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:38,732 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:38,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8437 backedges. 0 proven. 6050 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2018-02-04 04:20:39,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:39,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:39,736 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:20:39,860 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 56 check-sat command(s) [2018-02-04 04:20:39,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:39,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8437 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-02-04 04:20:39,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:39,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 34] total 60 [2018-02-04 04:20:39,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 04:20:39,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 04:20:39,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1708, Invalid=1832, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 04:20:39,950 INFO L87 Difference]: Start difference. First operand 386 states and 387 transitions. Second operand 60 states. [2018-02-04 04:20:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:40,711 INFO L93 Difference]: Finished difference Result 521 states and 545 transitions. [2018-02-04 04:20:40,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 04:20:40,711 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 385 [2018-02-04 04:20:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:40,712 INFO L225 Difference]: With dead ends: 521 [2018-02-04 04:20:40,712 INFO L226 Difference]: Without dead ends: 521 [2018-02-04 04:20:40,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3537, Invalid=4653, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 04:20:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-02-04 04:20:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 395. [2018-02-04 04:20:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-04 04:20:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-02-04 04:20:40,715 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 385 [2018-02-04 04:20:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:40,715 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-02-04 04:20:40,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 04:20:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-02-04 04:20:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-02-04 04:20:40,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:40,716 INFO L351 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:40,716 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1457906098, now seen corresponding path program 55 times [2018-02-04 04:20:40,717 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:40,717 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:40,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:40,717 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:40,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:40,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8816 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-02-04 04:20:41,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:41,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:41,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:41,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8816 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-02-04 04:20:41,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:41,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-02-04 04:20:41,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-02-04 04:20:41,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-02-04 04:20:41,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:20:41,832 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 59 states. [2018-02-04 04:20:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:42,317 INFO L93 Difference]: Finished difference Result 530 states and 555 transitions. [2018-02-04 04:20:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 04:20:42,317 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 394 [2018-02-04 04:20:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:42,318 INFO L225 Difference]: With dead ends: 530 [2018-02-04 04:20:42,318 INFO L226 Difference]: Without dead ends: 530 [2018-02-04 04:20:42,319 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 04:20:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-02-04 04:20:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 399. [2018-02-04 04:20:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-02-04 04:20:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-02-04 04:20:42,321 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 394 [2018-02-04 04:20:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:42,321 INFO L432 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-02-04 04:20:42,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-02-04 04:20:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-02-04 04:20:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-02-04 04:20:42,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:42,322 INFO L351 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:42,322 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1289887509, now seen corresponding path program 56 times [2018-02-04 04:20:42,322 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:42,322 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:42,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:42,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:42,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:42,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9042 backedges. 0 proven. 6498 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2018-02-04 04:20:43,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:43,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:43,402 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:20:43,412 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:20:43,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:43,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9042 backedges. 0 proven. 2544 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2018-02-04 04:20:43,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:43,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 34] total 93 [2018-02-04 04:20:43,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-02-04 04:20:43,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-02-04 04:20:43,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3222, Invalid=5334, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 04:20:43,709 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 93 states. [2018-02-04 04:20:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:45,813 INFO L93 Difference]: Finished difference Result 539 states and 564 transitions. [2018-02-04 04:20:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-02-04 04:20:45,814 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 398 [2018-02-04 04:20:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:45,815 INFO L225 Difference]: With dead ends: 539 [2018-02-04 04:20:45,815 INFO L226 Difference]: Without dead ends: 539 [2018-02-04 04:20:45,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3222, Invalid=5334, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 04:20:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-02-04 04:20:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 408. [2018-02-04 04:20:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-02-04 04:20:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2018-02-04 04:20:45,817 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 398 [2018-02-04 04:20:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:45,817 INFO L432 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2018-02-04 04:20:45,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-02-04 04:20:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2018-02-04 04:20:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-02-04 04:20:45,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:45,819 INFO L351 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:45,819 INFO L371 AbstractCegarLoop]: === Iteration 59 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:45,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2033501474, now seen corresponding path program 57 times [2018-02-04 04:20:45,819 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:45,819 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:45,819 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:45,819 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:45,819 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:45,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9434 backedges. 0 proven. 6728 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2018-02-04 04:20:46,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:46,895 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:46,895 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:20:46,944 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-02-04 04:20:46,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:46,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9434 backedges. 0 proven. 2706 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2018-02-04 04:20:47,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:47,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 36] total 63 [2018-02-04 04:20:47,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 04:20:47,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 04:20:47,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1887, Invalid=2019, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:20:47,030 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 63 states. [2018-02-04 04:20:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:47,755 INFO L93 Difference]: Finished difference Result 548 states and 573 transitions. [2018-02-04 04:20:47,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 04:20:47,755 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 407 [2018-02-04 04:20:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:47,756 INFO L225 Difference]: With dead ends: 548 [2018-02-04 04:20:47,756 INFO L226 Difference]: Without dead ends: 548 [2018-02-04 04:20:47,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3933, Invalid=5187, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 04:20:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-04 04:20:47,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 417. [2018-02-04 04:20:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-02-04 04:20:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-02-04 04:20:47,759 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 407 [2018-02-04 04:20:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:47,759 INFO L432 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-02-04 04:20:47,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 04:20:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-02-04 04:20:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-02-04 04:20:47,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:47,760 INFO L351 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:47,760 INFO L371 AbstractCegarLoop]: === Iteration 60 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1447826141, now seen corresponding path program 58 times [2018-02-04 04:20:47,760 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:47,760 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:47,761 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:47,761 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:47,761 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:47,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9835 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-04 04:20:48,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:48,853 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:48,853 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:20:48,865 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:20:48,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:48,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9835 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-04 04:20:48,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:48,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-02-04 04:20:48,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-04 04:20:48,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-04 04:20:48,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:20:48,927 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 62 states. [2018-02-04 04:20:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:49,348 INFO L93 Difference]: Finished difference Result 557 states and 583 transitions. [2018-02-04 04:20:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-02-04 04:20:49,348 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 416 [2018-02-04 04:20:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:49,349 INFO L225 Difference]: With dead ends: 557 [2018-02-04 04:20:49,349 INFO L226 Difference]: Without dead ends: 557 [2018-02-04 04:20:49,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 04:20:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-02-04 04:20:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 421. [2018-02-04 04:20:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-02-04 04:20:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-02-04 04:20:49,352 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 416 [2018-02-04 04:20:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:49,352 INFO L432 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-02-04 04:20:49,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-04 04:20:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-02-04 04:20:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-02-04 04:20:49,353 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:49,353 INFO L351 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:49,353 INFO L371 AbstractCegarLoop]: === Iteration 61 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1946816170, now seen corresponding path program 59 times [2018-02-04 04:20:49,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:49,353 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:49,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:49,354 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:49,354 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:49,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10073 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-04 04:20:50,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:50,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:50,434 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:20:53,466 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2018-02-04 04:20:53,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:53,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10073 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-04 04:20:53,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:53,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-02-04 04:20:53,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-04 04:20:53,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-04 04:20:53,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:20:53,628 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 63 states. [2018-02-04 04:20:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:54,156 INFO L93 Difference]: Finished difference Result 566 states and 593 transitions. [2018-02-04 04:20:54,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 04:20:54,157 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 420 [2018-02-04 04:20:54,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:54,158 INFO L225 Difference]: With dead ends: 566 [2018-02-04 04:20:54,158 INFO L226 Difference]: Without dead ends: 566 [2018-02-04 04:20:54,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-02-04 04:20:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-02-04 04:20:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 425. [2018-02-04 04:20:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-02-04 04:20:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-02-04 04:20:54,160 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 420 [2018-02-04 04:20:54,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:54,160 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-02-04 04:20:54,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-02-04 04:20:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-02-04 04:20:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-02-04 04:20:54,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:54,162 INFO L351 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:54,162 INFO L371 AbstractCegarLoop]: === Iteration 62 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:54,162 INFO L82 PathProgramCache]: Analyzing trace with hash 69856079, now seen corresponding path program 60 times [2018-02-04 04:20:54,162 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:54,162 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:54,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:54,162 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:54,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:54,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10315 backedges. 0 proven. 7442 refuted. 0 times theorem prover too weak. 2873 trivial. 0 not checked. [2018-02-04 04:20:55,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:55,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:55,326 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:20:55,905 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 62 check-sat command(s) [2018-02-04 04:20:55,905 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:55,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10315 backedges. 0 proven. 2873 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2018-02-04 04:20:55,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:55,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 37] total 66 [2018-02-04 04:20:55,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-02-04 04:20:55,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-02-04 04:20:55,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=2213, Unknown=0, NotChecked=0, Total=4290 [2018-02-04 04:20:55,999 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 66 states. [2018-02-04 04:20:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:56,762 INFO L93 Difference]: Finished difference Result 575 states and 602 transitions. [2018-02-04 04:20:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 04:20:56,762 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 424 [2018-02-04 04:20:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:56,763 INFO L225 Difference]: With dead ends: 575 [2018-02-04 04:20:56,763 INFO L226 Difference]: Without dead ends: 575 [2018-02-04 04:20:56,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=4287, Invalid=5613, Unknown=0, NotChecked=0, Total=9900 [2018-02-04 04:20:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-04 04:20:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 434. [2018-02-04 04:20:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-02-04 04:20:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 435 transitions. [2018-02-04 04:20:56,766 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 435 transitions. Word has length 424 [2018-02-04 04:20:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:56,766 INFO L432 AbstractCegarLoop]: Abstraction has 434 states and 435 transitions. [2018-02-04 04:20:56,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-02-04 04:20:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 435 transitions. [2018-02-04 04:20:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-02-04 04:20:56,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:56,767 INFO L351 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:56,767 INFO L371 AbstractCegarLoop]: === Iteration 63 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:56,767 INFO L82 PathProgramCache]: Analyzing trace with hash -699651014, now seen corresponding path program 61 times [2018-02-04 04:20:56,767 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:56,768 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:56,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:56,768 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:20:56,768 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:56,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10733 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2018-02-04 04:20:57,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:57,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:57,950 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:57,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:20:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10733 backedges. 0 proven. 7688 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2018-02-04 04:20:58,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:20:58,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-02-04 04:20:58,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-02-04 04:20:58,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-02-04 04:20:58,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:20:58,025 INFO L87 Difference]: Start difference. First operand 434 states and 435 transitions. Second operand 65 states. [2018-02-04 04:20:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:20:58,510 INFO L93 Difference]: Finished difference Result 584 states and 612 transitions. [2018-02-04 04:20:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-04 04:20:58,510 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 433 [2018-02-04 04:20:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:20:58,512 INFO L225 Difference]: With dead ends: 584 [2018-02-04 04:20:58,512 INFO L226 Difference]: Without dead ends: 584 [2018-02-04 04:20:58,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 04:20:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-04 04:20:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 438. [2018-02-04 04:20:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-02-04 04:20:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 439 transitions. [2018-02-04 04:20:58,514 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 439 transitions. Word has length 433 [2018-02-04 04:20:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:20:58,514 INFO L432 AbstractCegarLoop]: Abstraction has 438 states and 439 transitions. [2018-02-04 04:20:58,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-02-04 04:20:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 439 transitions. [2018-02-04 04:20:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-02-04 04:20:58,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:20:58,515 INFO L351 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:20:58,515 INFO L371 AbstractCegarLoop]: === Iteration 64 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:20:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash -221384991, now seen corresponding path program 62 times [2018-02-04 04:20:58,515 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:20:58,515 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:20:58,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:58,516 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:20:58,516 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:20:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:20:58,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:20:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10983 backedges. 0 proven. 7938 refuted. 0 times theorem prover too weak. 3045 trivial. 0 not checked. [2018-02-04 04:20:59,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:20:59,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:20:59,763 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:20:59,774 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:20:59,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:20:59,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10983 backedges. 0 proven. 3045 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2018-02-04 04:21:00,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:00,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 37] total 102 [2018-02-04 04:21:00,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-02-04 04:21:00,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-02-04 04:21:00,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3891, Invalid=6411, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 04:21:00,129 INFO L87 Difference]: Start difference. First operand 438 states and 439 transitions. Second operand 102 states. [2018-02-04 04:21:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:01,643 INFO L93 Difference]: Finished difference Result 593 states and 621 transitions. [2018-02-04 04:21:01,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 04:21:01,643 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 437 [2018-02-04 04:21:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:01,644 INFO L225 Difference]: With dead ends: 593 [2018-02-04 04:21:01,644 INFO L226 Difference]: Without dead ends: 593 [2018-02-04 04:21:01,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4536 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3891, Invalid=6411, Unknown=0, NotChecked=0, Total=10302 [2018-02-04 04:21:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-02-04 04:21:01,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 447. [2018-02-04 04:21:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-02-04 04:21:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-02-04 04:21:01,647 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 437 [2018-02-04 04:21:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:01,647 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-02-04 04:21:01,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-02-04 04:21:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-02-04 04:21:01,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-02-04 04:21:01,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:01,649 INFO L351 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:01,649 INFO L371 AbstractCegarLoop]: === Iteration 65 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:01,649 INFO L82 PathProgramCache]: Analyzing trace with hash -764170502, now seen corresponding path program 63 times [2018-02-04 04:21:01,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:01,649 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:01,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:01,649 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:01,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:01,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11414 backedges. 0 proven. 8192 refuted. 0 times theorem prover too weak. 3222 trivial. 0 not checked. [2018-02-04 04:21:03,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:03,044 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:03,045 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:21:03,119 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-02-04 04:21:03,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:03,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11414 backedges. 0 proven. 3222 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2018-02-04 04:21:03,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:03,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 39] total 69 [2018-02-04 04:21:03,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-02-04 04:21:03,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-02-04 04:21:03,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2274, Invalid=2418, Unknown=0, NotChecked=0, Total=4692 [2018-02-04 04:21:03,260 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 69 states. [2018-02-04 04:21:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:04,109 INFO L93 Difference]: Finished difference Result 602 states and 630 transitions. [2018-02-04 04:21:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 04:21:04,109 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 446 [2018-02-04 04:21:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:04,110 INFO L225 Difference]: With dead ends: 602 [2018-02-04 04:21:04,110 INFO L226 Difference]: Without dead ends: 602 [2018-02-04 04:21:04,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=4722, Invalid=6198, Unknown=0, NotChecked=0, Total=10920 [2018-02-04 04:21:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-02-04 04:21:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 456. [2018-02-04 04:21:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-02-04 04:21:04,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2018-02-04 04:21:04,113 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 446 [2018-02-04 04:21:04,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:04,113 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2018-02-04 04:21:04,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-02-04 04:21:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2018-02-04 04:21:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-02-04 04:21:04,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:04,116 INFO L351 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:04,116 INFO L371 AbstractCegarLoop]: === Iteration 66 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash -45558737, now seen corresponding path program 64 times [2018-02-04 04:21:04,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:04,116 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:04,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:04,117 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:04,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:04,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 11854 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 3404 trivial. 0 not checked. [2018-02-04 04:21:05,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:05,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:05,447 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:21:05,461 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:21:05,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:05,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 11854 backedges. 0 proven. 8450 refuted. 0 times theorem prover too weak. 3404 trivial. 0 not checked. [2018-02-04 04:21:05,532 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:05,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-02-04 04:21:05,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-02-04 04:21:05,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-02-04 04:21:05,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:21:05,534 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 68 states. [2018-02-04 04:21:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:06,106 INFO L93 Difference]: Finished difference Result 611 states and 640 transitions. [2018-02-04 04:21:06,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 04:21:06,106 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 455 [2018-02-04 04:21:06,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:06,107 INFO L225 Difference]: With dead ends: 611 [2018-02-04 04:21:06,107 INFO L226 Difference]: Without dead ends: 611 [2018-02-04 04:21:06,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 04:21:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-02-04 04:21:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 460. [2018-02-04 04:21:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 04:21:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 461 transitions. [2018-02-04 04:21:06,109 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 461 transitions. Word has length 455 [2018-02-04 04:21:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:06,110 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 461 transitions. [2018-02-04 04:21:06,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-02-04 04:21:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 461 transitions. [2018-02-04 04:21:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-02-04 04:21:06,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:06,111 INFO L351 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:06,111 INFO L371 AbstractCegarLoop]: === Iteration 67 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1334316950, now seen corresponding path program 65 times [2018-02-04 04:21:06,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:06,111 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:06,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:06,112 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:06,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:06,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12116 backedges. 0 proven. 8712 refuted. 0 times theorem prover too weak. 3404 trivial. 0 not checked. [2018-02-04 04:21:07,464 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:07,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:07,465 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:21:07,572 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 67 check-sat command(s) [2018-02-04 04:21:07,572 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:07,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12116 backedges. 0 proven. 3404 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2018-02-04 04:21:08,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:08,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 40] total 107 [2018-02-04 04:21:08,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-02-04 04:21:08,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-02-04 04:21:08,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=7077, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 04:21:08,043 INFO L87 Difference]: Start difference. First operand 460 states and 461 transitions. Second operand 107 states. [2018-02-04 04:21:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:10,467 INFO L93 Difference]: Finished difference Result 620 states and 649 transitions. [2018-02-04 04:21:10,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-02-04 04:21:10,468 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 459 [2018-02-04 04:21:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:10,469 INFO L225 Difference]: With dead ends: 620 [2018-02-04 04:21:10,469 INFO L226 Difference]: Without dead ends: 620 [2018-02-04 04:21:10,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=4265, Invalid=7077, Unknown=0, NotChecked=0, Total=11342 [2018-02-04 04:21:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-02-04 04:21:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 469. [2018-02-04 04:21:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-02-04 04:21:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 470 transitions. [2018-02-04 04:21:10,472 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 470 transitions. Word has length 459 [2018-02-04 04:21:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:10,472 INFO L432 AbstractCegarLoop]: Abstraction has 469 states and 470 transitions. [2018-02-04 04:21:10,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-02-04 04:21:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 470 transitions. [2018-02-04 04:21:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2018-02-04 04:21:10,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:10,473 INFO L351 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 39, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:10,473 INFO L371 AbstractCegarLoop]: === Iteration 68 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1125575003, now seen corresponding path program 66 times [2018-02-04 04:21:10,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:10,474 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:10,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:10,474 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:10,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:10,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12569 backedges. 0 proven. 8978 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2018-02-04 04:21:11,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:11,935 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:11,935 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:21:12,245 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2018-02-04 04:21:12,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:12,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12569 backedges. 0 proven. 3591 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2018-02-04 04:21:12,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:12,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 41] total 72 [2018-02-04 04:21:12,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-02-04 04:21:12,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-02-04 04:21:12,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2480, Invalid=2632, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 04:21:12,347 INFO L87 Difference]: Start difference. First operand 469 states and 470 transitions. Second operand 72 states. [2018-02-04 04:21:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:13,248 INFO L93 Difference]: Finished difference Result 629 states and 658 transitions. [2018-02-04 04:21:13,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 04:21:13,248 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 468 [2018-02-04 04:21:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:13,249 INFO L225 Difference]: With dead ends: 629 [2018-02-04 04:21:13,249 INFO L226 Difference]: Without dead ends: 629 [2018-02-04 04:21:13,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=5178, Invalid=6812, Unknown=0, NotChecked=0, Total=11990 [2018-02-04 04:21:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-02-04 04:21:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 478. [2018-02-04 04:21:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-02-04 04:21:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 479 transitions. [2018-02-04 04:21:13,252 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 479 transitions. Word has length 468 [2018-02-04 04:21:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:13,253 INFO L432 AbstractCegarLoop]: Abstraction has 478 states and 479 transitions. [2018-02-04 04:21:13,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-02-04 04:21:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 479 transitions. [2018-02-04 04:21:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-02-04 04:21:13,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:13,254 INFO L351 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:13,254 INFO L371 AbstractCegarLoop]: === Iteration 69 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2030127140, now seen corresponding path program 67 times [2018-02-04 04:21:13,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:13,254 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:13,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:13,255 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:13,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:13,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13031 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-02-04 04:21:14,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:14,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:14,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:21:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:14,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13031 backedges. 0 proven. 9248 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-02-04 04:21:14,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:14,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-02-04 04:21:14,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-04 04:21:14,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-04 04:21:14,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 04:21:14,813 INFO L87 Difference]: Start difference. First operand 478 states and 479 transitions. Second operand 71 states. [2018-02-04 04:21:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:15,313 INFO L93 Difference]: Finished difference Result 638 states and 668 transitions. [2018-02-04 04:21:15,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-02-04 04:21:15,313 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 477 [2018-02-04 04:21:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:15,314 INFO L225 Difference]: With dead ends: 638 [2018-02-04 04:21:15,315 INFO L226 Difference]: Without dead ends: 638 [2018-02-04 04:21:15,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 04:21:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-02-04 04:21:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 482. [2018-02-04 04:21:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-02-04 04:21:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 483 transitions. [2018-02-04 04:21:15,317 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 483 transitions. Word has length 477 [2018-02-04 04:21:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:15,317 INFO L432 AbstractCegarLoop]: Abstraction has 482 states and 483 transitions. [2018-02-04 04:21:15,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-04 04:21:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 483 transitions. [2018-02-04 04:21:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2018-02-04 04:21:15,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:15,319 INFO L351 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 40, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:15,319 INFO L371 AbstractCegarLoop]: === Iteration 70 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1246161995, now seen corresponding path program 68 times [2018-02-04 04:21:15,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:15,319 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:15,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:15,319 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:21:15,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:15,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13305 backedges. 0 proven. 9522 refuted. 0 times theorem prover too weak. 3783 trivial. 0 not checked. [2018-02-04 04:21:16,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:16,833 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:16,834 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:21:16,845 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:21:16,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:16,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13305 backedges. 0 proven. 3783 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2018-02-04 04:21:16,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:16,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 42] total 77 [2018-02-04 04:21:16,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 04:21:16,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 04:21:16,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2731, Invalid=3121, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 04:21:16,977 INFO L87 Difference]: Start difference. First operand 482 states and 483 transitions. Second operand 77 states. [2018-02-04 04:21:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:18,137 INFO L93 Difference]: Finished difference Result 647 states and 677 transitions. [2018-02-04 04:21:18,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-02-04 04:21:18,137 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 481 [2018-02-04 04:21:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:18,139 INFO L225 Difference]: With dead ends: 647 [2018-02-04 04:21:18,139 INFO L226 Difference]: Without dead ends: 647 [2018-02-04 04:21:18,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5572, Invalid=7768, Unknown=0, NotChecked=0, Total=13340 [2018-02-04 04:21:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-02-04 04:21:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 491. [2018-02-04 04:21:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-02-04 04:21:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 492 transitions. [2018-02-04 04:21:18,141 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 492 transitions. Word has length 481 [2018-02-04 04:21:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:18,142 INFO L432 AbstractCegarLoop]: Abstraction has 491 states and 492 transitions. [2018-02-04 04:21:18,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 04:21:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 492 transitions. [2018-02-04 04:21:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-02-04 04:21:18,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:18,143 INFO L351 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 41, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:18,143 INFO L371 AbstractCegarLoop]: === Iteration 71 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2092192336, now seen corresponding path program 69 times [2018-02-04 04:21:18,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:18,143 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:18,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:18,144 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:18,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:18,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13780 backedges. 0 proven. 9800 refuted. 0 times theorem prover too weak. 3980 trivial. 0 not checked. [2018-02-04 04:21:19,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:19,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:19,684 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:21:19,837 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-02-04 04:21:19,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:19,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13780 backedges. 0 proven. 3980 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2018-02-04 04:21:19,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:19,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 43] total 75 [2018-02-04 04:21:19,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 04:21:19,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 04:21:19,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2695, Invalid=2855, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 04:21:19,950 INFO L87 Difference]: Start difference. First operand 491 states and 492 transitions. Second operand 75 states. [2018-02-04 04:21:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:20,945 INFO L93 Difference]: Finished difference Result 656 states and 686 transitions. [2018-02-04 04:21:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 04:21:20,945 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 490 [2018-02-04 04:21:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:20,947 INFO L225 Difference]: With dead ends: 656 [2018-02-04 04:21:20,947 INFO L226 Difference]: Without dead ends: 656 [2018-02-04 04:21:20,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5655, Invalid=7455, Unknown=0, NotChecked=0, Total=13110 [2018-02-04 04:21:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-02-04 04:21:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 500. [2018-02-04 04:21:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-02-04 04:21:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 501 transitions. [2018-02-04 04:21:20,949 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 501 transitions. Word has length 490 [2018-02-04 04:21:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:20,950 INFO L432 AbstractCegarLoop]: Abstraction has 500 states and 501 transitions. [2018-02-04 04:21:20,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 04:21:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 501 transitions. [2018-02-04 04:21:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-02-04 04:21:20,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:20,951 INFO L351 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:20,951 INFO L371 AbstractCegarLoop]: === Iteration 72 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash 852842521, now seen corresponding path program 70 times [2018-02-04 04:21:20,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:20,951 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:20,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:20,952 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:20,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:20,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14264 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 4182 trivial. 0 not checked. [2018-02-04 04:21:22,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:22,539 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:22,540 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:21:22,555 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:21:22,555 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:22,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14264 backedges. 0 proven. 10082 refuted. 0 times theorem prover too weak. 4182 trivial. 0 not checked. [2018-02-04 04:21:22,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:22,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-02-04 04:21:22,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-04 04:21:22,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-04 04:21:22,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:21:22,647 INFO L87 Difference]: Start difference. First operand 500 states and 501 transitions. Second operand 74 states. [2018-02-04 04:21:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:23,260 INFO L93 Difference]: Finished difference Result 665 states and 696 transitions. [2018-02-04 04:21:23,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-02-04 04:21:23,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 499 [2018-02-04 04:21:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:23,262 INFO L225 Difference]: With dead ends: 665 [2018-02-04 04:21:23,262 INFO L226 Difference]: Without dead ends: 665 [2018-02-04 04:21:23,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 04:21:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-02-04 04:21:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 504. [2018-02-04 04:21:23,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-02-04 04:21:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 505 transitions. [2018-02-04 04:21:23,264 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 505 transitions. Word has length 499 [2018-02-04 04:21:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:23,265 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 505 transitions. [2018-02-04 04:21:23,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-04 04:21:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 505 transitions. [2018-02-04 04:21:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-02-04 04:21:23,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:23,266 INFO L351 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:23,266 INFO L371 AbstractCegarLoop]: === Iteration 73 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:23,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1508485888, now seen corresponding path program 71 times [2018-02-04 04:21:23,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:23,267 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:23,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:23,267 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:23,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:23,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14550 backedges. 0 proven. 10368 refuted. 0 times theorem prover too weak. 4182 trivial. 0 not checked. [2018-02-04 04:21:24,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:24,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:24,882 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:21:36,969 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2018-02-04 04:21:36,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-02-04 04:21:37,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:21:37,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-04 04:21:37,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 04:21:37,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 04:21:37,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 04:21:37,042 INFO L87 Difference]: Start difference. First operand 504 states and 505 transitions. Second operand 75 states. [2018-02-04 04:21:37,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:37,740 INFO L93 Difference]: Finished difference Result 674 states and 706 transitions. [2018-02-04 04:21:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-02-04 04:21:37,740 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 503 [2018-02-04 04:21:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:37,742 INFO L225 Difference]: With dead ends: 674 [2018-02-04 04:21:37,742 INFO L226 Difference]: Without dead ends: 674 [2018-02-04 04:21:37,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 04:21:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-02-04 04:21:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 508. [2018-02-04 04:21:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-02-04 04:21:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 509 transitions. [2018-02-04 04:21:37,744 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 509 transitions. Word has length 503 [2018-02-04 04:21:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:37,744 INFO L432 AbstractCegarLoop]: Abstraction has 508 states and 509 transitions. [2018-02-04 04:21:37,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 04:21:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 509 transitions. [2018-02-04 04:21:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-02-04 04:21:37,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:37,746 INFO L351 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 42, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:37,746 INFO L371 AbstractCegarLoop]: === Iteration 74 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1697678951, now seen corresponding path program 72 times [2018-02-04 04:21:37,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:37,746 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:37,746 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:37,746 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:37,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:37,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14840 backedges. 0 proven. 10658 refuted. 0 times theorem prover too weak. 4182 trivial. 0 not checked. [2018-02-04 04:21:39,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:39,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:39,426 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:21:39,917 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 74 check-sat command(s) [2018-02-04 04:21:39,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:39,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 14840 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2018-02-04 04:21:40,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:40,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 44] total 78 [2018-02-04 04:21:40,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-02-04 04:21:40,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-02-04 04:21:40,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2921, Invalid=3085, Unknown=0, NotChecked=0, Total=6006 [2018-02-04 04:21:40,055 INFO L87 Difference]: Start difference. First operand 508 states and 509 transitions. Second operand 78 states. [2018-02-04 04:21:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:41,182 INFO L93 Difference]: Finished difference Result 683 states and 715 transitions. [2018-02-04 04:21:41,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 04:21:41,182 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 507 [2018-02-04 04:21:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:41,183 INFO L225 Difference]: With dead ends: 683 [2018-02-04 04:21:41,183 INFO L226 Difference]: Without dead ends: 683 [2018-02-04 04:21:41,184 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=6078, Invalid=7964, Unknown=0, NotChecked=0, Total=14042 [2018-02-04 04:21:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-02-04 04:21:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 517. [2018-02-04 04:21:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-02-04 04:21:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 518 transitions. [2018-02-04 04:21:41,186 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 518 transitions. Word has length 507 [2018-02-04 04:21:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:41,186 INFO L432 AbstractCegarLoop]: Abstraction has 517 states and 518 transitions. [2018-02-04 04:21:41,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-02-04 04:21:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 518 transitions. [2018-02-04 04:21:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-02-04 04:21:41,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:41,188 INFO L351 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:41,188 INFO L371 AbstractCegarLoop]: === Iteration 75 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:41,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1411840908, now seen corresponding path program 73 times [2018-02-04 04:21:41,188 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:41,188 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:41,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:41,189 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:41,189 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:41,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15341 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-02-04 04:21:42,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:42,954 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:42,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:21:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:42,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15341 backedges. 0 proven. 10952 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-02-04 04:21:43,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:43,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-02-04 04:21:43,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-02-04 04:21:43,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-02-04 04:21:43,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 04:21:43,072 INFO L87 Difference]: Start difference. First operand 517 states and 518 transitions. Second operand 77 states. [2018-02-04 04:21:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:43,742 INFO L93 Difference]: Finished difference Result 692 states and 725 transitions. [2018-02-04 04:21:43,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-02-04 04:21:43,742 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 516 [2018-02-04 04:21:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:43,743 INFO L225 Difference]: With dead ends: 692 [2018-02-04 04:21:43,743 INFO L226 Difference]: Without dead ends: 692 [2018-02-04 04:21:43,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 04:21:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-02-04 04:21:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 521. [2018-02-04 04:21:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-02-04 04:21:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 522 transitions. [2018-02-04 04:21:43,746 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 522 transitions. Word has length 516 [2018-02-04 04:21:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:43,746 INFO L432 AbstractCegarLoop]: Abstraction has 521 states and 522 transitions. [2018-02-04 04:21:43,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-02-04 04:21:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 522 transitions. [2018-02-04 04:21:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-02-04 04:21:43,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:43,748 INFO L351 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 43, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:43,748 INFO L371 AbstractCegarLoop]: === Iteration 76 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:43,748 INFO L82 PathProgramCache]: Analyzing trace with hash 450007661, now seen corresponding path program 74 times [2018-02-04 04:21:43,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:43,748 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:43,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:43,748 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:21:43,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:43,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15639 backedges. 0 proven. 11250 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2018-02-04 04:21:45,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:45,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:45,459 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:21:45,473 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:21:45,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:45,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15639 backedges. 0 proven. 4389 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2018-02-04 04:21:45,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:45,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 45] total 83 [2018-02-04 04:21:45,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 04:21:45,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 04:21:45,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3193, Invalid=3613, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 04:21:45,627 INFO L87 Difference]: Start difference. First operand 521 states and 522 transitions. Second operand 83 states. [2018-02-04 04:21:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:46,966 INFO L93 Difference]: Finished difference Result 701 states and 734 transitions. [2018-02-04 04:21:46,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-02-04 04:21:46,966 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 520 [2018-02-04 04:21:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:46,967 INFO L225 Difference]: With dead ends: 701 [2018-02-04 04:21:46,967 INFO L226 Difference]: Without dead ends: 701 [2018-02-04 04:21:46,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1559 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=6505, Invalid=8995, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 04:21:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-02-04 04:21:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 530. [2018-02-04 04:21:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-02-04 04:21:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 531 transitions. [2018-02-04 04:21:46,970 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 531 transitions. Word has length 520 [2018-02-04 04:21:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:46,970 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 531 transitions. [2018-02-04 04:21:46,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 04:21:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 531 transitions. [2018-02-04 04:21:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-02-04 04:21:46,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:46,972 INFO L351 BasicCegarLoop]: trace histogram [77, 76, 76, 76, 44, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:46,972 INFO L371 AbstractCegarLoop]: === Iteration 77 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash 560346076, now seen corresponding path program 75 times [2018-02-04 04:21:46,972 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:46,972 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:46,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:46,973 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:46,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:46,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:48,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16153 backedges. 0 proven. 11552 refuted. 0 times theorem prover too weak. 4601 trivial. 0 not checked. [2018-02-04 04:21:48,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:48,789 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:48,789 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:21:48,890 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-02-04 04:21:48,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:48,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16153 backedges. 0 proven. 4601 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2018-02-04 04:21:49,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:49,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 46] total 81 [2018-02-04 04:21:49,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 04:21:49,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 04:21:49,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3154, Invalid=3326, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 04:21:49,027 INFO L87 Difference]: Start difference. First operand 530 states and 531 transitions. Second operand 81 states. [2018-02-04 04:21:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:50,242 INFO L93 Difference]: Finished difference Result 710 states and 743 transitions. [2018-02-04 04:21:50,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-02-04 04:21:50,242 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 529 [2018-02-04 04:21:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:50,243 INFO L225 Difference]: With dead ends: 710 [2018-02-04 04:21:50,243 INFO L226 Difference]: Without dead ends: 710 [2018-02-04 04:21:50,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=6594, Invalid=8658, Unknown=0, NotChecked=0, Total=15252 [2018-02-04 04:21:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-02-04 04:21:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 539. [2018-02-04 04:21:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-02-04 04:21:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 540 transitions. [2018-02-04 04:21:50,246 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 540 transitions. Word has length 529 [2018-02-04 04:21:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:50,247 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 540 transitions. [2018-02-04 04:21:50,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 04:21:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 540 transitions. [2018-02-04 04:21:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-02-04 04:21:50,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:50,248 INFO L351 BasicCegarLoop]: trace histogram [78, 77, 77, 77, 45, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:50,248 INFO L371 AbstractCegarLoop]: === Iteration 78 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:50,248 INFO L82 PathProgramCache]: Analyzing trace with hash 901670751, now seen corresponding path program 76 times [2018-02-04 04:21:50,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:50,248 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:50,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:50,249 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:50,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:50,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16676 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 4818 trivial. 0 not checked. [2018-02-04 04:21:52,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:52,201 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:52,201 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:21:52,218 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:21:52,218 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:21:52,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:21:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16676 backedges. 0 proven. 4818 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2018-02-04 04:21:52,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:21:52,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 46] total 125 [2018-02-04 04:21:52,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-02-04 04:21:52,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-02-04 04:21:52,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5770, Invalid=9730, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 04:21:52,751 INFO L87 Difference]: Start difference. First operand 539 states and 540 transitions. Second operand 125 states. [2018-02-04 04:21:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:21:55,979 INFO L93 Difference]: Finished difference Result 719 states and 752 transitions. [2018-02-04 04:21:55,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-02-04 04:21:55,979 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 538 [2018-02-04 04:21:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:21:55,981 INFO L225 Difference]: With dead ends: 719 [2018-02-04 04:21:55,981 INFO L226 Difference]: Without dead ends: 719 [2018-02-04 04:21:55,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6930 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=5770, Invalid=9730, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 04:21:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-02-04 04:21:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 548. [2018-02-04 04:21:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2018-02-04 04:21:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 549 transitions. [2018-02-04 04:21:55,984 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 549 transitions. Word has length 538 [2018-02-04 04:21:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:21:55,984 INFO L432 AbstractCegarLoop]: Abstraction has 548 states and 549 transitions. [2018-02-04 04:21:55,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-02-04 04:21:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 549 transitions. [2018-02-04 04:21:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2018-02-04 04:21:55,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:21:55,985 INFO L351 BasicCegarLoop]: trace histogram [79, 78, 78, 78, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:21:55,985 INFO L371 AbstractCegarLoop]: === Iteration 79 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:21:55,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1939212906, now seen corresponding path program 77 times [2018-02-04 04:21:55,986 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:21:55,986 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:21:55,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:55,986 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:21:55,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:21:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:21:55,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:21:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 17208 backedges. 0 proven. 12168 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-02-04 04:21:57,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:21:57,958 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:21:57,958 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:22:10,021 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2018-02-04 04:22:10,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-02-04 04:22:10,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:22:10,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-02-04 04:22:10,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-02-04 04:22:10,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-02-04 04:22:10,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 04:22:10,112 INFO L87 Difference]: Start difference. First operand 548 states and 549 transitions. Second operand 81 states. [2018-02-04 04:22:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:22:10,774 INFO L93 Difference]: Finished difference Result 728 states and 762 transitions. [2018-02-04 04:22:10,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-02-04 04:22:10,774 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 547 [2018-02-04 04:22:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:22:10,776 INFO L225 Difference]: With dead ends: 728 [2018-02-04 04:22:10,776 INFO L226 Difference]: Without dead ends: 728 [2018-02-04 04:22:10,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 04:22:10,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-02-04 04:22:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 552. [2018-02-04 04:22:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-02-04 04:22:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 553 transitions. [2018-02-04 04:22:10,779 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 553 transitions. Word has length 547 [2018-02-04 04:22:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:22:10,779 INFO L432 AbstractCegarLoop]: Abstraction has 552 states and 553 transitions. [2018-02-04 04:22:10,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-02-04 04:22:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 553 transitions. [2018-02-04 04:22:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-02-04 04:22:10,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:22:10,781 INFO L351 BasicCegarLoop]: trace histogram [80, 79, 79, 79, 46, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:22:10,781 INFO L371 AbstractCegarLoop]: === Iteration 80 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:22:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1872297297, now seen corresponding path program 78 times [2018-02-04 04:22:10,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:22:10,781 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:22:10,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:10,782 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:22:10,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:22:10,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:22:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17522 backedges. 0 proven. 12482 refuted. 0 times theorem prover too weak. 5040 trivial. 0 not checked. [2018-02-04 04:22:12,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:22:12,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:22:12,843 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 04:22:13,041 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 80 check-sat command(s) [2018-02-04 04:22:13,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:22:13,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:22:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 17522 backedges. 0 proven. 5040 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2018-02-04 04:22:13,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:22:13,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 48] total 84 [2018-02-04 04:22:13,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-02-04 04:22:13,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-02-04 04:22:13,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3396, Invalid=3576, Unknown=0, NotChecked=0, Total=6972 [2018-02-04 04:22:13,187 INFO L87 Difference]: Start difference. First operand 552 states and 553 transitions. Second operand 84 states. [2018-02-04 04:22:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:22:14,552 INFO L93 Difference]: Finished difference Result 737 states and 771 transitions. [2018-02-04 04:22:14,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 04:22:14,552 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 551 [2018-02-04 04:22:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:22:14,553 INFO L225 Difference]: With dead ends: 737 [2018-02-04 04:22:14,553 INFO L226 Difference]: Without dead ends: 737 [2018-02-04 04:22:14,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=7131, Invalid=9381, Unknown=0, NotChecked=0, Total=16512 [2018-02-04 04:22:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-02-04 04:22:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 561. [2018-02-04 04:22:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-02-04 04:22:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 562 transitions. [2018-02-04 04:22:14,557 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 562 transitions. Word has length 551 [2018-02-04 04:22:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:22:14,557 INFO L432 AbstractCegarLoop]: Abstraction has 561 states and 562 transitions. [2018-02-04 04:22:14,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-02-04 04:22:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 562 transitions. [2018-02-04 04:22:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-02-04 04:22:14,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:22:14,559 INFO L351 BasicCegarLoop]: trace histogram [81, 80, 80, 80, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:22:14,559 INFO L371 AbstractCegarLoop]: === Iteration 81 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:22:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash 414269002, now seen corresponding path program 79 times [2018-02-04 04:22:14,559 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:22:14,559 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:22:14,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:14,559 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:22:14,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:22:14,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:22:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18067 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 5267 trivial. 0 not checked. [2018-02-04 04:22:16,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:22:16,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:22:16,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:22:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:22:16,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:22:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 18067 backedges. 0 proven. 12800 refuted. 0 times theorem prover too weak. 5267 trivial. 0 not checked. [2018-02-04 04:22:16,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:22:16,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-02-04 04:22:16,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-02-04 04:22:16,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-02-04 04:22:16,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 04:22:16,903 INFO L87 Difference]: Start difference. First operand 561 states and 562 transitions. Second operand 83 states. [2018-02-04 04:22:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:22:17,961 INFO L93 Difference]: Finished difference Result 746 states and 781 transitions. [2018-02-04 04:22:17,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-02-04 04:22:17,961 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 560 [2018-02-04 04:22:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:22:17,963 INFO L225 Difference]: With dead ends: 746 [2018-02-04 04:22:17,963 INFO L226 Difference]: Without dead ends: 746 [2018-02-04 04:22:17,963 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-02-04 04:22:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-02-04 04:22:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 565. [2018-02-04 04:22:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-02-04 04:22:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 566 transitions. [2018-02-04 04:22:17,966 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 566 transitions. Word has length 560 [2018-02-04 04:22:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:22:17,966 INFO L432 AbstractCegarLoop]: Abstraction has 565 states and 566 transitions. [2018-02-04 04:22:17,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-02-04 04:22:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 566 transitions. [2018-02-04 04:22:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-02-04 04:22:17,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:22:17,968 INFO L351 BasicCegarLoop]: trace histogram [82, 81, 81, 81, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:22:17,968 INFO L371 AbstractCegarLoop]: === Iteration 82 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:22:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1482130749, now seen corresponding path program 80 times [2018-02-04 04:22:17,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:22:17,968 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:22:17,968 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:17,968 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:22:17,969 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:22:17,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:22:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18389 backedges. 0 proven. 13122 refuted. 0 times theorem prover too weak. 5267 trivial. 0 not checked. [2018-02-04 04:22:20,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:22:20,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:22:20,108 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:22:20,123 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:22:20,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:22:20,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:22:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 18389 backedges. 0 proven. 5267 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2018-02-04 04:22:20,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:22:20,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 49] total 93 [2018-02-04 04:22:20,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-02-04 04:22:20,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-02-04 04:22:20,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3864, Invalid=4692, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 04:22:20,336 INFO L87 Difference]: Start difference. First operand 565 states and 566 transitions. Second operand 93 states. [2018-02-04 04:22:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:22:22,187 INFO L93 Difference]: Finished difference Result 755 states and 790 transitions. [2018-02-04 04:22:22,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-02-04 04:22:22,187 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 564 [2018-02-04 04:22:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:22:22,188 INFO L225 Difference]: With dead ends: 755 [2018-02-04 04:22:22,188 INFO L226 Difference]: Without dead ends: 755 [2018-02-04 04:22:22,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 601 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2504 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=7746, Invalid=11436, Unknown=0, NotChecked=0, Total=19182 [2018-02-04 04:22:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-02-04 04:22:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 574. [2018-02-04 04:22:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-02-04 04:22:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2018-02-04 04:22:22,192 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 564 [2018-02-04 04:22:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:22:22,192 INFO L432 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2018-02-04 04:22:22,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-02-04 04:22:22,192 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2018-02-04 04:22:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2018-02-04 04:22:22,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:22:22,194 INFO L351 BasicCegarLoop]: trace histogram [83, 82, 82, 82, 48, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:22:22,194 INFO L371 AbstractCegarLoop]: === Iteration 83 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:22:22,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1694544582, now seen corresponding path program 81 times [2018-02-04 04:22:22,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:22:22,194 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:22:22,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:22,195 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:22:22,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:22:22,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:22:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18947 backedges. 0 proven. 13448 refuted. 0 times theorem prover too weak. 5499 trivial. 0 not checked. [2018-02-04 04:22:24,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:22:24,388 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:22:24,388 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:22:24,576 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-02-04 04:22:24,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:22:24,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:22:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 18947 backedges. 0 proven. 5499 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2018-02-04 04:22:24,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:22:24,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 50] total 87 [2018-02-04 04:22:24,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-02-04 04:22:24,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-02-04 04:22:24,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3647, Invalid=3835, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:22:24,730 INFO L87 Difference]: Start difference. First operand 574 states and 575 transitions. Second operand 87 states. [2018-02-04 04:22:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:22:26,079 INFO L93 Difference]: Finished difference Result 764 states and 799 transitions. [2018-02-04 04:22:26,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-02-04 04:22:26,079 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 573 [2018-02-04 04:22:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:22:26,080 INFO L225 Difference]: With dead ends: 764 [2018-02-04 04:22:26,080 INFO L226 Difference]: Without dead ends: 764 [2018-02-04 04:22:26,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=7689, Invalid=10133, Unknown=0, NotChecked=0, Total=17822 [2018-02-04 04:22:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-02-04 04:22:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 583. [2018-02-04 04:22:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-02-04 04:22:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 584 transitions. [2018-02-04 04:22:26,086 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 584 transitions. Word has length 573 [2018-02-04 04:22:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:22:26,086 INFO L432 AbstractCegarLoop]: Abstraction has 583 states and 584 transitions. [2018-02-04 04:22:26,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-02-04 04:22:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 584 transitions. [2018-02-04 04:22:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-02-04 04:22:26,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:22:26,088 INFO L351 BasicCegarLoop]: trace histogram [84, 83, 83, 83, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:22:26,088 INFO L371 AbstractCegarLoop]: === Iteration 84 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:22:26,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1387247925, now seen corresponding path program 82 times [2018-02-04 04:22:26,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:22:26,088 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:22:26,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:26,089 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:22:26,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:22:26,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:22:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 19514 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 5736 trivial. 0 not checked. [2018-02-04 04:22:28,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:22:28,339 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:22:28,339 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 04:22:28,358 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 04:22:28,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:22:28,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:22:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 19514 backedges. 0 proven. 13778 refuted. 0 times theorem prover too weak. 5736 trivial. 0 not checked. [2018-02-04 04:22:28,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:22:28,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-02-04 04:22:28,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-02-04 04:22:28,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-02-04 04:22:28,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 04:22:28,497 INFO L87 Difference]: Start difference. First operand 583 states and 584 transitions. Second operand 86 states. [2018-02-04 04:22:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:22:29,654 INFO L93 Difference]: Finished difference Result 773 states and 809 transitions. [2018-02-04 04:22:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-02-04 04:22:29,654 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 582 [2018-02-04 04:22:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:22:29,655 INFO L225 Difference]: With dead ends: 773 [2018-02-04 04:22:29,655 INFO L226 Difference]: Without dead ends: 773 [2018-02-04 04:22:29,655 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 04:22:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-02-04 04:22:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 587. [2018-02-04 04:22:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-02-04 04:22:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 588 transitions. [2018-02-04 04:22:29,658 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 588 transitions. Word has length 582 [2018-02-04 04:22:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:22:29,658 INFO L432 AbstractCegarLoop]: Abstraction has 587 states and 588 transitions. [2018-02-04 04:22:29,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-02-04 04:22:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 588 transitions. [2018-02-04 04:22:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-02-04 04:22:29,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:22:29,660 INFO L351 BasicCegarLoop]: trace histogram [85, 84, 84, 84, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:22:29,660 INFO L371 AbstractCegarLoop]: === Iteration 85 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:22:29,660 INFO L82 PathProgramCache]: Analyzing trace with hash -272407314, now seen corresponding path program 83 times [2018-02-04 04:22:29,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:22:29,660 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:22:29,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:29,660 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:22:29,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:22:29,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:22:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19848 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 5736 trivial. 0 not checked. [2018-02-04 04:22:32,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:22:32,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:22:32,004 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 04:22:39,603 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2018-02-04 04:22:39,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:22:39,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:22:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 19848 backedges. 0 proven. 14112 refuted. 0 times theorem prover too weak. 5736 trivial. 0 not checked. [2018-02-04 04:22:39,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:22:39,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-02-04 04:22:39,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-02-04 04:22:39,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-02-04 04:22:39,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:22:39,754 INFO L87 Difference]: Start difference. First operand 587 states and 588 transitions. Second operand 87 states. [2018-02-04 04:22:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:22:40,964 INFO L93 Difference]: Finished difference Result 782 states and 819 transitions. [2018-02-04 04:22:40,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-02-04 04:22:40,964 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 586 [2018-02-04 04:22:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:22:40,965 INFO L225 Difference]: With dead ends: 782 [2018-02-04 04:22:40,965 INFO L226 Difference]: Without dead ends: 782 [2018-02-04 04:22:40,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-02-04 04:22:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-02-04 04:22:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 591. [2018-02-04 04:22:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-02-04 04:22:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 592 transitions. [2018-02-04 04:22:40,968 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 592 transitions. Word has length 586 [2018-02-04 04:22:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:22:40,969 INFO L432 AbstractCegarLoop]: Abstraction has 591 states and 592 transitions. [2018-02-04 04:22:40,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-02-04 04:22:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 592 transitions. [2018-02-04 04:22:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-02-04 04:22:40,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:22:40,970 INFO L351 BasicCegarLoop]: trace histogram [86, 85, 85, 85, 49, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:22:40,971 INFO L371 AbstractCegarLoop]: === Iteration 86 === [mainErr0AssertViolation, mainErr1AssertViolation]=== [2018-02-04 04:22:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1060670503, now seen corresponding path program 84 times [2018-02-04 04:22:40,971 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:22:40,971 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:22:40,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:40,971 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:22:40,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:22:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:22:40,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:22:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 20186 backedges. 0 proven. 14450 refuted. 0 times theorem prover too weak. 5736 trivial. 0 not checked. [2018-02-04 04:22:43,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:22:43,354 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:22:43,355 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... [2018-02-04 04:22:43,924 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 86 check-sat command(s) [2018-02-04 04:22:43,924 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-02-04 04:22:43,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:22:43,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-02-04 04:22:43,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-02-04 04:22:43,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-02-04 04:22:43,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-02-04 04:22:43,963 INFO L87 Difference]: Start difference. First operand 591 states and 592 transitions. Second operand 88 states. [2018-02-04 04:22:43,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 04:22:43,963 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 04:22:43,967 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 04:22:43,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:22:43 BoogieIcfgContainer [2018-02-04 04:22:43,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:22:43,967 INFO L168 Benchmark]: Toolchain (without parser) took 176832.83 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 357.7 MB in the beginning and 403.5 MB in the end (delta: -45.7 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-02-04 04:22:43,968 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory was 365.7 MB in the beginning and 363.0 MB in the end (delta: 2.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:22:43,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.87 ms. Allocated memory is still 403.7 MB. Free memory was 357.7 MB in the beginning and 349.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. [2018-02-04 04:22:43,968 INFO L168 Benchmark]: Boogie Preprocessor took 18.87 ms. Allocated memory is still 403.7 MB. Free memory is still 349.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:22:43,968 INFO L168 Benchmark]: RCFGBuilder took 123.01 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 335.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 04:22:43,969 INFO L168 Benchmark]: TraceAbstraction took 176555.19 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 335.3 MB in the beginning and 403.5 MB in the end (delta: -68.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-02-04 04:22:43,970 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.13 ms. Allocated memory is still 403.7 MB. Free memory was 365.7 MB in the beginning and 363.0 MB in the end (delta: 2.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 132.87 ms. Allocated memory is still 403.7 MB. Free memory was 357.7 MB in the beginning and 349.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 18.87 ms. Allocated memory is still 403.7 MB. Free memory is still 349.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 123.01 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 335.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176555.19 ms. Allocated memory was 403.7 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 335.3 MB in the beginning and 403.5 MB in the end (delta: -68.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 (591states) and interpolant automaton (currently 2 states, 88 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 15). Cancelled while BasicCegarLoop was constructing difference of abstraction (591states) and interpolant automaton (currently 2 states, 88 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 2 error locations. TIMEOUT Result, 176.5s OverallTime, 86 OverallIterations, 86 TraceHistogramMax, 51.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1400 SDtfs, 39109 SDslu, 32167 SDs, 0 SdLazy, 90086 SolverSat, 11796 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29825 GetRequests, 24847 SyntacticMatches, 2 SemanticMatches, 4976 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48976 ImplicationChecksByTransitivity, 56.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=85, 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, 85 MinimizatonAttempts, 8344 StatesRemovedByMinimization, 84 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 45.8s SatisfiabilityAnalysisTime, 74.9s InterpolantComputationTime, 51786 NumberOfCodeBlocks, 50746 NumberOfCodeBlocksAsserted, 1814 NumberOfCheckSat, 49979 ConstructedInterpolants, 0 QuantifiedInterpolants, 41147073 SizeOfPredicates, 35 NumberOfNonLiveVariables, 43546 ConjunctsInSsa, 3072 ConjunctsInUnsatCore, 167 InterpolantComputations, 2 PerfectInterpolantSequences, 455484/1117742 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/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-22-43-974.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-22-43-974.csv Completed graceful shutdown