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/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:10:28,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:10:28,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:10:28,674 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:10:28,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:10:28,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:10:28,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:10:28,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:10:28,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:10:28,679 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:10:28,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:10:28,680 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:10:28,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:10:28,682 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:10:28,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:10:28,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:10:28,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:10:28,687 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:10:28,688 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:10:28,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:10:28,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:10:28,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:10:28,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:10:28,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:10:28,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:10:28,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:10:28,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:10:28,693 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:10:28,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:10:28,693 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:10:28,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:10:28,694 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 19:10:28,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:10:28,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:10:28,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:10:28,704 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:10:28,704 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:10:28,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:10:28,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:10:28,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:10:28,705 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:10:28,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:10:28,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:10:28,705 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:10:28,705 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:10:28,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:10:28,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:10:28,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:10:28,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:10:28,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:10:28,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:10:28,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:10:28,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:10:28,707 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:10:28,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:10:28,707 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:10:28,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:10:28,741 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:10:28,744 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:10:28,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:10:28,746 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:10:28,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-04 19:10:28,885 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:10:28,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:10:28,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:10:28,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:10:28,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:10:28,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:10:28" (1/1) ... [2018-02-04 19:10:28,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab8a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:28, skipping insertion in model container [2018-02-04 19:10:28,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:10:28" (1/1) ... [2018-02-04 19:10:28,909 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:10:28,944 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:10:29,023 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:10:29,038 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:10:29,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29 WrapperNode [2018-02-04 19:10:29,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:10:29,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:10:29,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:10:29,045 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:10:29,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (1/1) ... [2018-02-04 19:10:29,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (1/1) ... [2018-02-04 19:10:29,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (1/1) ... [2018-02-04 19:10:29,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (1/1) ... [2018-02-04 19:10:29,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (1/1) ... [2018-02-04 19:10:29,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (1/1) ... [2018-02-04 19:10:29,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (1/1) ... [2018-02-04 19:10:29,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:10:29,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:10:29,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:10:29,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:10:29,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (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 19:10:29,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:10:29,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:10:29,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:10:29,126 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:10:29,126 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:10:29,127 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:10:29,127 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:10:29,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:10:29,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:10:29,127 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:10:29,127 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:10:29,127 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:10:29,127 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:10:29,128 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:10:29,128 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:10:29,128 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:10:29,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:10:29,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:10:29,284 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:10:29,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:10:29 BoogieIcfgContainer [2018-02-04 19:10:29,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:10:29,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:10:29,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:10:29,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:10:29,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:10:28" (1/3) ... [2018-02-04 19:10:29,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873869f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:10:29, skipping insertion in model container [2018-02-04 19:10:29,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:29" (2/3) ... [2018-02-04 19:10:29,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873869f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:10:29, skipping insertion in model container [2018-02-04 19:10:29,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:10:29" (3/3) ... [2018-02-04 19:10:29,289 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-02-04 19:10:29,295 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:10:29,301 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 19:10:29,330 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:10:29,330 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:10:29,330 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:10:29,331 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:10:29,331 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:10:29,331 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:10:29,331 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:10:29,331 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:10:29,331 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:10:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 19:10:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:10:29,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:29,348 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:29,349 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-02-04 19:10:29,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:29,355 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:29,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:29,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:29,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:29,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:29,486 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 19:10:29,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:29,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:10:29,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:10:29,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:10:29,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:10:29,502 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 19:10:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:29,622 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-04 19:10:29,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:10:29,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 19:10:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:29,630 INFO L225 Difference]: With dead ends: 74 [2018-02-04 19:10:29,630 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 19:10:29,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:10:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 19:10:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-02-04 19:10:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 19:10:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 19:10:29,658 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-02-04 19:10:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:29,658 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 19:10:29,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:10:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 19:10:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:10:29,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:29,659 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:29,659 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-02-04 19:10:29,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:29,659 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:29,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:29,661 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:29,661 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:29,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:29,727 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 19:10:29,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:29,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:10:29,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:10:29,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:10:29,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:10:29,730 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-02-04 19:10:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:29,801 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-02-04 19:10:29,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:10:29,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:10:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:29,803 INFO L225 Difference]: With dead ends: 78 [2018-02-04 19:10:29,803 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 19:10:29,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:10:29,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 19:10:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-02-04 19:10:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 19:10:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-04 19:10:29,810 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-02-04 19:10:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:29,811 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-04 19:10:29,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:10:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-04 19:10:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 19:10:29,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:29,812 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:29,812 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-02-04 19:10:29,812 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:29,812 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:29,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:29,814 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:29,814 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:29,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:29,865 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 19:10:29,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:29,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:10:29,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:10:29,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:10:29,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:10:29,866 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-02-04 19:10:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:29,894 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-02-04 19:10:29,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:10:29,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 19:10:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:29,896 INFO L225 Difference]: With dead ends: 86 [2018-02-04 19:10:29,896 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 19:10:29,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 19:10:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 19:10:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-02-04 19:10:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 19:10:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-02-04 19:10:29,902 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-02-04 19:10:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:29,902 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-02-04 19:10:29,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:10:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-02-04 19:10:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:10:29,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:29,903 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:29,903 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:29,904 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-02-04 19:10:29,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:29,904 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:29,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:29,905 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:29,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:29,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:10:29,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:29,963 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:29,964 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:29,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:10:30,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:30,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-02-04 19:10:30,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:10:30,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:10:30,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:30,016 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-02-04 19:10:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:30,034 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 19:10:30,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:30,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 19:10:30,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:30,035 INFO L225 Difference]: With dead ends: 49 [2018-02-04 19:10:30,036 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 19:10:30,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 19:10:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 19:10:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 19:10:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 19:10:30,039 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-02-04 19:10:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:30,040 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 19:10:30,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:10:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 19:10:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:10:30,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:30,041 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:30,041 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:30,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-02-04 19:10:30,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:30,041 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:30,042 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:30,042 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:30,043 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:30,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:10:30,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:30,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:10:30,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:10:30,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:10:30,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:30,088 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-02-04 19:10:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:30,100 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-02-04 19:10:30,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:30,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 19:10:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:30,101 INFO L225 Difference]: With dead ends: 51 [2018-02-04 19:10:30,101 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 19:10:30,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 19:10:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-02-04 19:10:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 19:10:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 19:10:30,104 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-02-04 19:10:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:30,104 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 19:10:30,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:10:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 19:10:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:10:30,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:30,104 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:30,104 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-02-04 19:10:30,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:30,105 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:30,106 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:30,106 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:30,106 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:30,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:30,122 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:30,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:30,122 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:30,123 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:30,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:30,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:10:30,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:10:30,201 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:10:30,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:10:30,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:10:30,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:10:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:10:30,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:30,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 19:10:30,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:10:30,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:10:30,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2018-02-04 19:10:30,225 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 8 states. [2018-02-04 19:10:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:30,324 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-02-04 19:10:30,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:10:30,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 19:10:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:30,326 INFO L225 Difference]: With dead ends: 56 [2018-02-04 19:10:30,326 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 19:10:30,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=53, Unknown=2, NotChecked=14, Total=90 [2018-02-04 19:10:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 19:10:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-02-04 19:10:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 19:10:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 19:10:30,330 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2018-02-04 19:10:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:30,330 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 19:10:30,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:10:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 19:10:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:10:30,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:30,331 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:30,331 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-02-04 19:10:30,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:30,332 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:30,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:30,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:30,333 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:30,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:30,356 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:30,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:30,356 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:30,357 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:30,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:30,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:10:30,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:10:30,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:10:30,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:10:30,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:10:30,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:10:30,561 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse1 (mod v_prenex_2 4294967296))) (and (= (store |c_old(#length)| v_prenex_3 (+ .cse1 (- 4294967296))) |c_#length|) (<= (select |c_old(#valid)| v_prenex_3) 0) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:10:30,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:30,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:30,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-02-04 19:10:30,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:30,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:30,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:10:30,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:30,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:30,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 19:10:30,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-04 19:10:30,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:30,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:10:30,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:10:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:10:30,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:30,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 19:10:30,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:10:30,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:10:30,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=74, Unknown=1, NotChecked=16, Total=110 [2018-02-04 19:10:30,750 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 11 states. [2018-02-04 19:10:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:35,493 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2018-02-04 19:10:35,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:10:35,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-04 19:10:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:35,494 INFO L225 Difference]: With dead ends: 87 [2018-02-04 19:10:35,494 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 19:10:35,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2018-02-04 19:10:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 19:10:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2018-02-04 19:10:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 19:10:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2018-02-04 19:10:35,499 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 28 [2018-02-04 19:10:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:35,499 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2018-02-04 19:10:35,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:10:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2018-02-04 19:10:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 19:10:35,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:35,500 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:35,501 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1097237542, now seen corresponding path program 1 times [2018-02-04 19:10:35,501 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:35,501 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:35,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,502 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:35,502 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:35,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:10:35,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:35,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:10:35,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:10:35,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:10:35,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:10:35,547 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 4 states. [2018-02-04 19:10:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:35,575 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-04 19:10:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:35,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 19:10:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:35,576 INFO L225 Difference]: With dead ends: 70 [2018-02-04 19:10:35,576 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 19:10:35,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:35,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 19:10:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-04 19:10:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 19:10:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-02-04 19:10:35,579 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29 [2018-02-04 19:10:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:35,580 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-02-04 19:10:35,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:10:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-02-04 19:10:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 19:10:35,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:35,581 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:35,581 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1190998490, now seen corresponding path program 1 times [2018-02-04 19:10:35,581 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:35,581 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:35,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,582 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:35,582 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:35,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:35,592 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:35,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:35,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:35,593 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:35,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:10:35,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:35,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 19:10:35,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:10:35,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:10:35,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=50, Unknown=5, NotChecked=0, Total=72 [2018-02-04 19:10:35,664 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 9 states. [2018-02-04 19:10:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:35,764 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-02-04 19:10:35,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:10:35,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 19:10:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:35,765 INFO L225 Difference]: With dead ends: 69 [2018-02-04 19:10:35,765 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 19:10:35,765 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=64, Unknown=5, NotChecked=0, Total=90 [2018-02-04 19:10:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 19:10:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 19:10:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 19:10:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-04 19:10:35,767 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32 [2018-02-04 19:10:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:35,768 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-04 19:10:35,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:10:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-04 19:10:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 19:10:35,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:35,768 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:35,768 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1833910404, now seen corresponding path program 1 times [2018-02-04 19:10:35,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:35,768 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:35,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,769 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:35,769 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:35,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:10:35,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:35,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:10:35,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:10:35,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:10:35,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:10:35,802 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-04 19:10:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:35,821 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-04 19:10:35,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:10:35,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-04 19:10:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:35,822 INFO L225 Difference]: With dead ends: 58 [2018-02-04 19:10:35,822 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 19:10:35,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:10:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 19:10:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-04 19:10:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 19:10:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-04 19:10:35,825 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34 [2018-02-04 19:10:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:35,825 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-04 19:10:35,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:10:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-04 19:10:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 19:10:35,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:35,826 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:35,826 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1409435322, now seen corresponding path program 1 times [2018-02-04 19:10:35,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:35,827 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:35,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:35,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:35,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:10:35,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:35,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:35,861 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:35,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:10:35,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:10:35,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-02-04 19:10:35,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:10:35,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:10:35,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:10:35,894 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states. [2018-02-04 19:10:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:35,934 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-02-04 19:10:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:35,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-02-04 19:10:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:35,935 INFO L225 Difference]: With dead ends: 87 [2018-02-04 19:10:35,935 INFO L226 Difference]: Without dead ends: 87 [2018-02-04 19:10:35,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:10:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-04 19:10:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2018-02-04 19:10:35,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 19:10:35,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-02-04 19:10:35,948 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34 [2018-02-04 19:10:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:35,948 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-02-04 19:10:35,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:10:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-02-04 19:10:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:10:35,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:35,951 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:35,951 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash 804244387, now seen corresponding path program 1 times [2018-02-04 19:10:35,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:35,951 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:35,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,952 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:35,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:35,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:35,968 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:35,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:35,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:35,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:35,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:36,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:10:36,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:10:36,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:10:36,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:10:36,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:10:36,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:10:36,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-02-04 19:10:36,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-02-04 19:10:36,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-02-04 19:10:36,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-02-04 19:10:36,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:10:36,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 19:10:36,394 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_12 Int) (v_prenex_11 Int)) (let ((.cse1 (mod v_prenex_11 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_12) 0) (< 2147483647 .cse1) (= (store |c_old(#length)| v_prenex_12 (+ .cse1 (- 4294967296))) |c_#length|))))) is different from true [2018-02-04 19:10:36,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-02-04 19:10:36,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 92 [2018-02-04 19:10:36,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2018-02-04 19:10:36,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-02-04 19:10:36,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 92 [2018-02-04 19:10:36,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,793 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 88 [2018-02-04 19:10:36,795 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 64 [2018-02-04 19:10:36,869 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:36,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-02-04 19:10:36,927 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:36,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-04 19:10:36,995 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:11:01,822 WARN L146 SmtUtils]: Spent 22775ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 19:11:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2018-02-04 19:11:01,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:11:01,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 19:11:01,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:11:01,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:11:01,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=151, Unknown=5, NotChecked=24, Total=210 [2018-02-04 19:11:01,845 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 15 states. [2018-02-04 19:11:02,136 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-02-04 19:11:24,129 WARN L146 SmtUtils]: Spent 15477ms on a formula simplification. DAG size of input: 99 DAG size of output 97 [2018-02-04 19:11:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:24,188 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-02-04 19:11:24,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:11:24,188 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-04 19:11:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:24,189 INFO L225 Difference]: With dead ends: 75 [2018-02-04 19:11:24,189 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 19:11:24,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=82, Invalid=469, Unknown=5, NotChecked=44, Total=600 [2018-02-04 19:11:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 19:11:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-02-04 19:11:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 19:11:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-02-04 19:11:24,193 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 41 [2018-02-04 19:11:24,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:24,193 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-02-04 19:11:24,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:11:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-02-04 19:11:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 19:11:24,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:24,194 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:24,194 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:24,194 INFO L82 PathProgramCache]: Analyzing trace with hash 835021389, now seen corresponding path program 1 times [2018-02-04 19:11:24,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:24,195 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:24,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:24,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:24,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:24,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:11:24,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:11:24,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:11:24,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:11:24,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:11:24,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:11:24,278 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-02-04 19:11:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:24,350 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-02-04 19:11:24,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:11:24,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-04 19:11:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:24,351 INFO L225 Difference]: With dead ends: 72 [2018-02-04 19:11:24,351 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 19:11:24,351 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:11:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 19:11:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-02-04 19:11:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 19:11:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2018-02-04 19:11:24,354 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 42 [2018-02-04 19:11:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:24,354 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-02-04 19:11:24,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:11:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2018-02-04 19:11:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 19:11:24,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:24,355 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:24,355 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:24,355 INFO L82 PathProgramCache]: Analyzing trace with hash 115859282, now seen corresponding path program 1 times [2018-02-04 19:11:24,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:24,356 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:24,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:24,356 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:24,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:24,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 19:11:24,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:24,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:24,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:24,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:24,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:11:24,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:11:24,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:24,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:24,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:24,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 19:11:24,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:11:24,681 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:11:24,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-02-04 19:11:24,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:24,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:24,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:11:24,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 19:11:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:11:24,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:11:24,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2018-02-04 19:11:24,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:11:24,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:11:24,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:11:24,697 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand 20 states. [2018-02-04 19:11:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:24,847 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-04 19:11:24,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:11:24,847 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2018-02-04 19:11:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:24,848 INFO L225 Difference]: With dead ends: 93 [2018-02-04 19:11:24,848 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 19:11:24,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:11:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 19:11:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-02-04 19:11:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 19:11:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-02-04 19:11:24,851 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 43 [2018-02-04 19:11:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:24,851 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-02-04 19:11:24,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:11:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-02-04 19:11:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 19:11:24,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:24,852 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:24,852 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:24,852 INFO L82 PathProgramCache]: Analyzing trace with hash 115859283, now seen corresponding path program 1 times [2018-02-04 19:11:24,852 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:24,852 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:24,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:24,853 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:24,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:24,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:11:25,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:25,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:25,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:25,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:25,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:11:25,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:11:25,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:11:25,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:11:25,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-02-04 19:11:25,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:11:25,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-02-04 19:11:25,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:11:25,214 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:11:25,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:11:25,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2018-02-04 19:11:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:11:25,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:11:25,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-02-04 19:11:25,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:11:25,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:11:25,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:11:25,222 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 22 states. [2018-02-04 19:11:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:25,554 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-02-04 19:11:25,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:11:25,555 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 19:11:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:25,555 INFO L225 Difference]: With dead ends: 86 [2018-02-04 19:11:25,556 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 19:11:25,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-02-04 19:11:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 19:11:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 19:11:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 19:11:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-02-04 19:11:25,559 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 43 [2018-02-04 19:11:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:25,559 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-02-04 19:11:25,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:11:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-02-04 19:11:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 19:11:25,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:25,560 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:25,560 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash -329856377, now seen corresponding path program 1 times [2018-02-04 19:11:25,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:25,560 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:25,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:25,562 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:25,562 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:25,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:11:25,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:25,583 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:25,584 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:25,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:25,607 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:11:25,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:11:25,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2018-02-04 19:11:25,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:11:25,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:11:25,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:11:25,609 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 6 states. [2018-02-04 19:11:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:25,636 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-04 19:11:25,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:11:25,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-02-04 19:11:25,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:25,637 INFO L225 Difference]: With dead ends: 84 [2018-02-04 19:11:25,637 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 19:11:25,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:11:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 19:11:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 19:11:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 19:11:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-04 19:11:25,639 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 45 [2018-02-04 19:11:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:25,639 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-04 19:11:25,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:11:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-04 19:11:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:11:25,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:25,640 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:25,640 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1632885427, now seen corresponding path program 2 times [2018-02-04 19:11:25,640 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:25,640 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:25,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:25,641 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:25,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:25,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 19:11:25,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:25,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:25,678 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:11:25,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:11:25,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:11:25,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 19:11:25,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:11:25,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 19:11:25,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:11:25,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:11:25,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:11:25,725 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 9 states. [2018-02-04 19:11:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:25,753 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-02-04 19:11:25,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:11:25,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-02-04 19:11:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:25,754 INFO L225 Difference]: With dead ends: 120 [2018-02-04 19:11:25,754 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 19:11:25,754 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:11:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 19:11:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2018-02-04 19:11:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-04 19:11:25,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-02-04 19:11:25,756 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 47 [2018-02-04 19:11:25,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:25,757 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-02-04 19:11:25,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:11:25,757 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-02-04 19:11:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:11:25,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:25,757 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:25,757 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:25,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576177, now seen corresponding path program 1 times [2018-02-04 19:11:25,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:25,757 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:25,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:25,758 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:11:25,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:25,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:25,780 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:11:25,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:25,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:25,781 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:25,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:25,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:11:25,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:11:25,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:25,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:25,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 19:11:25,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-04 19:11:25,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:11:25,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:11:25,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:11:25,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:43 [2018-02-04 19:11:25,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:11:25,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:25,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:11:25,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:41 [2018-02-04 19:11:25,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-02-04 19:11:25,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2018-02-04 19:11:25,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:11:26,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:11:26,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:26,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:58 [2018-02-04 19:11:26,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-02-04 19:11:26,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:26,037 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:11:26,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:26,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:26,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-02-04 19:11:26,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:26,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:26,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:98, output treesize:24 [2018-02-04 19:11:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:11:26,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:11:26,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 19:11:26,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:11:26,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:11:26,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:11:26,131 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 18 states. [2018-02-04 19:11:26,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:26,639 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2018-02-04 19:11:26,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:11:26,639 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 19:11:26,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:26,640 INFO L225 Difference]: With dead ends: 92 [2018-02-04 19:11:26,640 INFO L226 Difference]: Without dead ends: 92 [2018-02-04 19:11:26,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-04 19:11:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-04 19:11:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-04 19:11:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 19:11:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-02-04 19:11:26,644 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 48 [2018-02-04 19:11:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:26,644 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-02-04 19:11:26,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:11:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-02-04 19:11:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:11:26,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:26,645 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:26,645 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576226, now seen corresponding path program 1 times [2018-02-04 19:11:26,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:26,645 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:26,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:26,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:26,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:26,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:11:26,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:26,679 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:26,680 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:26,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:11:26,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:11:26,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 19:11:26,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:11:26,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:11:26,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:11:26,705 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2018-02-04 19:11:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:26,751 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-04 19:11:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:11:26,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-02-04 19:11:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:26,752 INFO L225 Difference]: With dead ends: 89 [2018-02-04 19:11:26,752 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 19:11:26,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:11:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 19:11:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-02-04 19:11:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 19:11:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-02-04 19:11:26,755 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 48 [2018-02-04 19:11:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:26,756 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-02-04 19:11:26,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:11:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-02-04 19:11:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 19:11:26,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:26,756 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:26,756 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:26,757 INFO L82 PathProgramCache]: Analyzing trace with hash 255829617, now seen corresponding path program 1 times [2018-02-04 19:11:26,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:26,757 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:26,757 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:26,758 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:26,758 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:26,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:26,774 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:11:26,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:26,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:26,775 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:26,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:26,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-02-04 19:11:26,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:11:26,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:26,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:26,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2018-02-04 19:11:26,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:11:26,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:26,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:11:26,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:26,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:131 [2018-02-04 19:11:27,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2018-02-04 19:11:27,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:27,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2018-02-04 19:11:27,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:27,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:27,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:103, output treesize:85 [2018-02-04 19:11:29,206 WARN L146 SmtUtils]: Spent 2067ms on a formula simplification. DAG size of input: 44 DAG size of output 24 [2018-02-04 19:11:31,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-02-04 19:11:31,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 38 [2018-02-04 19:11:31,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:31,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:31,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-02-04 19:11:31,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 38 [2018-02-04 19:11:31,405 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:31,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:31,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-02-04 19:11:31,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:217 [2018-02-04 19:11:31,743 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 129 DAG size of output 87 [2018-02-04 19:11:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:11:34,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:11:34,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:11:34,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:11:34,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:11:34,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=354, Unknown=19, NotChecked=0, Total=420 [2018-02-04 19:11:34,129 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 21 states. [2018-02-04 19:11:45,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:11:45,005 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-02-04 19:11:45,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:11:45,006 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-02-04 19:11:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:11:45,006 INFO L225 Difference]: With dead ends: 88 [2018-02-04 19:11:45,006 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 19:11:45,007 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=74, Invalid=551, Unknown=25, NotChecked=0, Total=650 [2018-02-04 19:11:45,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 19:11:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 19:11:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 19:11:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-02-04 19:11:45,009 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 51 [2018-02-04 19:11:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:11:45,009 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-02-04 19:11:45,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:11:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-02-04 19:11:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 19:11:45,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:11:45,010 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:11:45,010 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:11:45,010 INFO L82 PathProgramCache]: Analyzing trace with hash 797091222, now seen corresponding path program 2 times [2018-02-04 19:11:45,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:11:45,010 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:11:45,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:45,011 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:11:45,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:11:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:11:45,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:11:45,040 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:11:45,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:11:45,040 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:11:45,041 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:11:45,064 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:11:45,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:11:45,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:11:45,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:11:45,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:11:45,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:11:45,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:11:45,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:11:45,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:11:45,213 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse1 (mod v_prenex_57 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_58 (+ .cse1 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_58) 0) (< 2147483647 .cse1) (= |c_#valid| (store |c_old(#valid)| v_prenex_58 1)))))) is different from true [2018-02-04 19:11:45,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 56 [2018-02-04 19:11:45,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 49 [2018-02-04 19:11:45,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 44 [2018-02-04 19:11:45,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-02-04 19:11:45,334 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:11:45,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 19:11:45,504 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse1 (mod v_prenex_61 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_62) 0) (= (store |c_old(#length)| v_prenex_62 (+ .cse1 (- 4294967296))) |c_#length|) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:11:45,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2018-02-04 19:11:45,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,604 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 88 [2018-02-04 19:11:45,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2018-02-04 19:11:45,692 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 65 [2018-02-04 19:11:45,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2018-02-04 19:11:45,845 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 77 [2018-02-04 19:11:45,920 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:45,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,983 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:45,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-02-04 19:11:45,984 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:46,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:46,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:46,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:11:46,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 77 [2018-02-04 19:11:46,045 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:11:46,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-02-04 19:11:46,109 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:12:02,526 WARN L146 SmtUtils]: Spent 16381ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 19:12:16,758 WARN L143 SmtUtils]: Spent 14178ms on a formula simplification that was a NOOP. DAG size: 81 [2018-02-04 19:12:29,813 WARN L143 SmtUtils]: Spent 13017ms on a formula simplification that was a NOOP. DAG size: 83 [2018-02-04 19:12:29,832 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_79 Int) (v_prenex_80 Int)) (let ((.cse1 (mod v_prenex_79 4294967296))) (and (< 2147483647 .cse1) (= |c_#length| (store |c_old(#length)| v_prenex_80 (+ .cse1 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_80) 0))))) is different from true [2018-02-04 19:12:29,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:29,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:29,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-02-04 19:12:29,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:29,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:29,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:29,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2018-02-04 19:12:29,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:30,139 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 111 [2018-02-04 19:12:30,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-04 19:12:30,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 75 [2018-02-04 19:12:30,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:30,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 89 [2018-02-04 19:12:30,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-02-04 19:12:30,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,888 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:30,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 115 [2018-02-04 19:12:30,902 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 19:12:31,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-02-04 19:12:31,267 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:31,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:12:31,274 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 19:12:31,277 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:31,603 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,606 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:31,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 121 [2018-02-04 19:12:31,617 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-02-04 19:12:32,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 133 [2018-02-04 19:12:32,052 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-02-04 19:12:32,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:32,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 123 [2018-02-04 19:12:32,557 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-04 19:12:33,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:12:33,094 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:33,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-02-04 19:12:33,097 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:33,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-02-04 19:12:33,099 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:33,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-02-04 19:12:33,561 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:33,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2018-02-04 19:12:33,565 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:33,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:12:33,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2018-02-04 19:12:33,568 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 19:12:34,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 36 dim-0 vars, 12 dim-1 vars, End of recursive call: 84 dim-0 vars, and 18 xjuncts. [2018-02-04 19:12:34,012 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 48 variables, input treesize:455, output treesize:1013 [2018-02-04 19:12:49,876 WARN L146 SmtUtils]: Spent 15708ms on a formula simplification. DAG size of input: 436 DAG size of output 79 [2018-02-04 19:12:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 18 not checked. [2018-02-04 19:12:49,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:12:49,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 19:12:49,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:12:49,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:12:49,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=209, Unknown=3, NotChecked=90, Total=342 [2018-02-04 19:12:49,911 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 19 states. [2018-02-04 19:12:49,987 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse4 (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse9 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse9) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse9 2147483647)))))) (and (let ((.cse2 (<= |c_ldv_malloc_#t~malloc1.offset| 0)) (.cse3 (= 1 (select |c_#valid| |c_ldv_malloc_#t~malloc1.base|))) (.cse1 (mod |c_ldv_malloc_#in~size| 4294967296)) (.cse0 (select |c_#length| |c_ldv_malloc_#t~malloc1.base|))) (or (and (= (+ .cse0 4294967296) .cse1) (< 2147483647 .cse1) .cse2 .cse3) (and .cse2 .cse3 (<= .cse1 2147483647) (= .cse1 .cse0)))) (or .cse4 (exists ((v_prenex_62 Int) (v_prenex_61 Int)) (let ((.cse5 (mod v_prenex_61 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_62) 0) (= (store |c_old(#length)| v_prenex_62 (+ .cse5 (- 4294967296))) |c_#length|) (< 2147483647 .cse5))))) (or .cse4 (exists ((v_prenex_79 Int) (v_prenex_80 Int)) (let ((.cse6 (mod v_prenex_79 4294967296))) (and (< 2147483647 .cse6) (= |c_#length| (store |c_old(#length)| v_prenex_80 (+ .cse6 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_80) 0))))) (= |c_ldv_malloc_#in~size| c_ldv_malloc_~size) (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse7 (mod ldv_malloc_~size 4294967296))) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse7) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse7 2147483647)))) (exists ((v_prenex_58 Int) (v_prenex_57 Int)) (let ((.cse8 (mod v_prenex_57 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_58 (+ .cse8 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_58) 0) (< 2147483647 .cse8) (= |c_#valid| (store |c_old(#valid)| v_prenex_58 1)))))))) is different from true [2018-02-04 19:13:23,944 WARN L146 SmtUtils]: Spent 24945ms on a formula simplification. DAG size of input: 96 DAG size of output 94 [2018-02-04 19:13:38,551 WARN L143 SmtUtils]: Spent 14548ms on a formula simplification that was a NOOP. DAG size: 87 [2018-02-04 19:13:47,793 WARN L143 SmtUtils]: Spent 9161ms on a formula simplification that was a NOOP. DAG size: 83 [2018-02-04 19:13:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:13:49,962 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-02-04 19:13:49,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:13:49,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-04 19:13:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:13:49,963 INFO L225 Difference]: With dead ends: 96 [2018-02-04 19:13:49,963 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 19:13:49,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 112.7s TimeCoverageRelationStatistics Valid=96, Invalid=615, Unknown=7, NotChecked=212, Total=930 [2018-02-04 19:13:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 19:13:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2018-02-04 19:13:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-04 19:13:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-02-04 19:13:49,965 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 54 [2018-02-04 19:13:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:13:49,965 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-02-04 19:13:49,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:13:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-02-04 19:13:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:13:49,966 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:13:49,966 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:13:49,966 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:13:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602309, now seen corresponding path program 2 times [2018-02-04 19:13:49,966 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:13:49,966 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:13:49,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:49,967 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:13:49,967 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:13:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:13:49,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:13:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 19:13:50,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:13:50,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:13:50,121 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:13:50,137 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:13:50,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:13:50,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:13:50,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:13:50,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:13:50,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:50,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:13:50,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:13:50,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 19:13:58,909 WARN L146 SmtUtils]: Spent 695ms on a formula simplification. DAG size of input: 23 DAG size of output 13 [2018-02-04 19:13:58,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 19:13:58,917 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:13:58,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:13:58,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:13:58,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:13:58,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:13:58,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-02-04 19:13:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 19:13:58,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:13:58,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2018-02-04 19:13:58,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:13:58,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:13:58,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=177, Unknown=4, NotChecked=0, Total=210 [2018-02-04 19:13:58,922 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 15 states. [2018-02-04 19:14:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:07,731 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-02-04 19:14:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 19:14:07,731 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-02-04 19:14:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:07,732 INFO L225 Difference]: With dead ends: 103 [2018-02-04 19:14:07,732 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 19:14:07,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=138, Invalid=788, Unknown=4, NotChecked=0, Total=930 [2018-02-04 19:14:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 19:14:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-02-04 19:14:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 19:14:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-02-04 19:14:07,734 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 56 [2018-02-04 19:14:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:07,734 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-02-04 19:14:07,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:14:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-02-04 19:14:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 19:14:07,735 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:07,735 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:14:07,735 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:14:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1831602310, now seen corresponding path program 2 times [2018-02-04 19:14:07,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:07,735 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:07,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:07,736 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:14:07,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:07,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 19:14:07,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:07,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:07,930 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:14:07,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:14:07,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:14:07,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:07,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:14:07,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:07,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:07,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:14:07,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:14:07,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:14:07,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:07,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:07,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:07,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-02-04 19:14:07,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-02-04 19:14:07,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:07,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:07,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-02-04 19:14:08,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-02-04 19:14:08,033 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:14:08,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 19:14:08,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:14:08,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:08,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:14:08,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-02-04 19:14:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 19:14:08,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:14:08,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 15 [2018-02-04 19:14:08,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 19:14:08,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 19:14:08,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:14:08,041 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 16 states. [2018-02-04 19:14:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:14:08,597 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-02-04 19:14:08,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:14:08,597 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-02-04 19:14:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:14:08,598 INFO L225 Difference]: With dead ends: 98 [2018-02-04 19:14:08,598 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 19:14:08,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:14:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 19:14:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-02-04 19:14:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 19:14:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2018-02-04 19:14:08,600 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 56 [2018-02-04 19:14:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:14:08,600 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-02-04 19:14:08,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 19:14:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2018-02-04 19:14:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 19:14:08,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:14:08,601 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:14:08,601 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:14:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1244279398, now seen corresponding path program 3 times [2018-02-04 19:14:08,601 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:14:08,601 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:14:08,601 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:08,601 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:14:08,602 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:14:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:14:08,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:14:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 19:14:08,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:14:08,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:14:08,661 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:14:08,683 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 19:14:08,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:14:08,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:14:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 19:14:08,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:14:08,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-02-04 19:14:08,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:14:08,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:14:08,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:14:08,721 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 11 states. Received shutdown request... [2018-02-04 19:14:08,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:14:08,803 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:14:08,807 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:14:08,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:14:08 BoogieIcfgContainer [2018-02-04 19:14:08,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:14:08,807 INFO L168 Benchmark]: Toolchain (without parser) took 219922.40 ms. Allocated memory was 400.6 MB in the beginning and 683.7 MB in the end (delta: 283.1 MB). Free memory was 357.2 MB in the beginning and 519.9 MB in the end (delta: -162.6 MB). Peak memory consumption was 120.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:08,808 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:14:08,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.86 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 344.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:08,809 INFO L168 Benchmark]: Boogie Preprocessor took 31.94 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:08,809 INFO L168 Benchmark]: RCFGBuilder took 207.62 ms. Allocated memory is still 400.6 MB. Free memory was 342.7 MB in the beginning and 324.2 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:08,809 INFO L168 Benchmark]: TraceAbstraction took 219522.01 ms. Allocated memory was 400.6 MB in the beginning and 683.7 MB in the end (delta: 283.1 MB). Free memory was 322.8 MB in the beginning and 519.9 MB in the end (delta: -197.0 MB). Peak memory consumption was 86.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:14:08,810 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.12 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.86 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 344.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.94 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 207.62 ms. Allocated memory is still 400.6 MB. Free memory was 342.7 MB in the beginning and 324.2 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 219522.01 ms. Allocated memory was 400.6 MB in the beginning and 683.7 MB in the end (delta: 283.1 MB). Free memory was 322.8 MB in the beginning and 519.9 MB in the end (delta: -197.0 MB). Peak memory consumption was 86.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (96states) and interpolant automaton (currently 7 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (102 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 219.4s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 109.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1000 SDtfs, 1114 SDslu, 4707 SDs, 0 SdLazy, 4232 SolverSat, 204 SolverUnsat, 94 SolverUnknown, 0 SolverNotchecked, 38.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 963 GetRequests, 634 SyntacticMatches, 31 SemanticMatches, 298 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 172.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=22, 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.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 195 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 109.4s InterpolantComputationTime, 1664 NumberOfCodeBlocks, 1664 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1348 ConstructedInterpolants, 105 QuantifiedInterpolants, 645609 SizeOfPredicates, 92 NumberOfNonLiveVariables, 2668 ConjunctsInSsa, 357 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 429/724 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/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-14-08-816.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-14-08-816.csv Completed graceful shutdown