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_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:58:37,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:58:37,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:58:37,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:58:37,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:58:37,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:58:37,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:58:37,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:58:37,210 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:58:37,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:58:37,211 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:58:37,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:58:37,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:58:37,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:58:37,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:58:37,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:58:37,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:58:37,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:58:37,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:58:37,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:58:37,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:58:37,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:58:37,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:58:37,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:58:37,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:58:37,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:58:37,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:58:37,225 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:58:37,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:58:37,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:58:37,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:58:37,226 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 18:58:37,235 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:58:37,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:58:37,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:58:37,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:58:37,237 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:58:37,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:58:37,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:58:37,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:58:37,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:58:37,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:58:37,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:58:37,238 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:58:37,238 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:58:37,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:58:37,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:58:37,238 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:58:37,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:58:37,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:58:37,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:58:37,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:58:37,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:58:37,239 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:58:37,239 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:58:37,240 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:58:37,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:58:37,278 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:58:37,281 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:58:37,282 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:58:37,284 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:58:37,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-02-04 18:58:37,446 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:58:37,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:58:37,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:58:37,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:58:37,453 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:58:37,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328714e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37, skipping insertion in model container [2018-02-04 18:58:37,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,471 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:58:37,507 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:58:37,588 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:58:37,602 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:58:37,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37 WrapperNode [2018-02-04 18:58:37,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:58:37,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:58:37,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:58:37,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:58:37,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (1/1) ... [2018-02-04 18:58:37,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:58:37,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:58:37,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:58:37,635 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:58:37,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (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 18:58:37,670 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:58:37,671 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:58:37,671 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 18:58:37,671 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-02-04 18:58:37,671 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 18:58:37,671 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 18:58:37,671 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:58:37,671 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:58:37,671 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:58:37,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:58:37,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:58:37,671 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:58:37,671 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:58:37,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:58:37,888 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:58:37,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:58:37 BoogieIcfgContainer [2018-02-04 18:58:37,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:58:37,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:58:37,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:58:37,891 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:58:37,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:58:37" (1/3) ... [2018-02-04 18:58:37,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75851c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:58:37, skipping insertion in model container [2018-02-04 18:58:37,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:58:37" (2/3) ... [2018-02-04 18:58:37,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75851c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:58:37, skipping insertion in model container [2018-02-04 18:58:37,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:58:37" (3/3) ... [2018-02-04 18:58:37,893 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-02-04 18:58:37,899 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:58:37,905 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 18:58:37,928 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:58:37,928 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:58:37,929 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:58:37,929 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:58:37,929 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:58:37,929 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:58:37,929 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:58:37,929 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:58:37,930 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:58:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-02-04 18:58:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:58:37,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:37,947 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 18:58:37,947 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:37,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-02-04 18:58:37,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:37,951 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:37,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:37,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:37,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:38,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:38,092 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 18:58:38,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:38,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:58:38,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:58:38,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:58:38,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:58:38,159 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-02-04 18:58:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:38,321 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-04 18:58:38,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:58:38,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 18:58:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:38,329 INFO L225 Difference]: With dead ends: 122 [2018-02-04 18:58:38,329 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 18:58:38,330 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 18:58:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 18:58:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-02-04 18:58:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 18:58:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-04 18:58:38,358 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-02-04 18:58:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:38,358 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-04 18:58:38,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:58:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-04 18:58:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 18:58:38,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:38,360 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 18:58:38,360 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-02-04 18:58:38,360 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:38,361 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:38,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,362 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:38,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:38,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:38,422 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 18:58:38,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:38,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:58:38,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:58:38,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:58:38,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:58:38,424 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-02-04 18:58:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:38,443 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-02-04 18:58:38,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:58:38,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 18:58:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:38,444 INFO L225 Difference]: With dead ends: 75 [2018-02-04 18:58:38,444 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 18:58:38,445 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 18:58:38,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 18:58:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-02-04 18:58:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 18:58:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-04 18:58:38,450 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-02-04 18:58:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:38,450 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-04 18:58:38,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:58:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-04 18:58:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:58:38,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:38,451 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 18:58:38,451 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-02-04 18:58:38,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:38,451 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:38,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:38,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:38,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:38,485 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 18:58:38,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:38,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:58:38,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:58:38,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:58:38,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:58:38,486 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-02-04 18:58:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:38,529 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-04 18:58:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:58:38,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 18:58:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:38,530 INFO L225 Difference]: With dead ends: 71 [2018-02-04 18:58:38,530 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 18:58:38,530 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 18:58:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 18:58:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 18:58:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 18:58:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-04 18:58:38,535 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-04 18:58:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:38,536 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-04 18:58:38,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:58:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-04 18:58:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:58:38,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:38,537 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 18:58:38,537 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-02-04 18:58:38,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:38,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:38,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:38,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:38,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:38,581 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 18:58:38,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:38,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:58:38,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:58:38,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:58:38,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:58:38,583 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-02-04 18:58:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:38,651 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-02-04 18:58:38,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:58:38,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 18:58:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:38,652 INFO L225 Difference]: With dead ends: 70 [2018-02-04 18:58:38,652 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 18:58:38,652 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 18:58:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 18:58:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 18:58:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 18:58:38,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 18:58:38,656 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-02-04 18:58:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:38,656 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 18:58:38,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:58:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 18:58:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 18:58:38,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:38,657 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 18:58:38,657 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:38,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-02-04 18:58:38,658 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:38,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:38,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,659 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:38,659 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:38,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:58:38,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:38,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:58:38,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:58:38,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:58:38,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:58:38,857 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-02-04 18:58:39,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:39,050 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-04 18:58:39,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:58:39,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 18:58:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:39,051 INFO L225 Difference]: With dead ends: 74 [2018-02-04 18:58:39,051 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 18:58:39,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:58:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 18:58:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-02-04 18:58:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 18:58:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-02-04 18:58:39,055 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-02-04 18:58:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:39,055 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-02-04 18:58:39,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:58:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-02-04 18:58:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 18:58:39,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:39,055 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] [2018-02-04 18:58:39,055 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:39,056 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-02-04 18:58:39,056 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:39,056 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:39,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:39,057 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:39,057 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:39,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:58:39,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:39,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:39,261 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:39,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:39,339 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 20 treesize of output 19 [2018-02-04 18:58:39,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:39,353 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 17 treesize of output 16 [2018-02-04 18:58:39,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:39,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:58:39,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 18:58:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:58:39,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:39,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-02-04 18:58:39,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 18:58:39,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 18:58:39,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 18:58:39,489 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 20 states. [2018-02-04 18:58:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:39,843 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-04 18:58:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:58:39,844 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-02-04 18:58:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:39,844 INFO L225 Difference]: With dead ends: 79 [2018-02-04 18:58:39,844 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 18:58:39,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-02-04 18:58:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 18:58:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-04 18:58:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 18:58:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 18:58:39,850 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-02-04 18:58:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:39,850 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 18:58:39,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 18:58:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 18:58:39,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 18:58:39,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:39,851 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 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 18:58:39,851 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-02-04 18:58:39,851 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:39,852 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:39,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:39,853 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:39,853 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:39,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 18:58:39,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:39,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:58:39,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:58:39,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:58:39,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:58:39,908 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-02-04 18:58:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:39,994 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-02-04 18:58:39,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:58:39,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 18:58:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:39,996 INFO L225 Difference]: With dead ends: 103 [2018-02-04 18:58:39,996 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 18:58:39,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:58:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 18:58:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-02-04 18:58:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 18:58:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-02-04 18:58:40,003 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-02-04 18:58:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:40,003 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-02-04 18:58:40,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:58:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-02-04 18:58:40,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 18:58:40,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:40,004 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 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 18:58:40,004 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:40,005 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-02-04 18:58:40,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:40,005 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:40,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,006 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:40,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:40,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:58:40,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:40,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:40,061 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:40,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 18:58:40,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:58:40,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-02-04 18:58:40,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:58:40,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:58:40,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:58:40,092 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 9 states. [2018-02-04 18:58:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:40,186 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-04 18:58:40,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:58:40,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-04 18:58:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:40,187 INFO L225 Difference]: With dead ends: 107 [2018-02-04 18:58:40,187 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 18:58:40,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:58:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 18:58:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-02-04 18:58:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 18:58:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-02-04 18:58:40,190 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 38 [2018-02-04 18:58:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:40,191 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-02-04 18:58:40,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:58:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-02-04 18:58:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 18:58:40,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:40,192 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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 18:58:40,192 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash 157473967, now seen corresponding path program 1 times [2018-02-04 18:58:40,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:40,192 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:40,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:40,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:40,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-04 18:58:40,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:40,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:58:40,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 18:58:40,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 18:58:40,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 18:58:40,222 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2018-02-04 18:58:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:40,230 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-02-04 18:58:40,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:58:40,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-02-04 18:58:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:40,231 INFO L225 Difference]: With dead ends: 115 [2018-02-04 18:58:40,231 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 18:58:40,231 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 18:58:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 18:58:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-04 18:58:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 18:58:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-02-04 18:58:40,234 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 46 [2018-02-04 18:58:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:40,234 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-02-04 18:58:40,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 18:58:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-02-04 18:58:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 18:58:40,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:40,235 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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 18:58:40,235 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:40,235 INFO L82 PathProgramCache]: Analyzing trace with hash -108654543, now seen corresponding path program 1 times [2018-02-04 18:58:40,235 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:40,235 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:40,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,236 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:40,236 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:40,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:58:40,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:40,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:40,302 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:40,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:58:40,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:40,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 18:58:40,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 18:58:40,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 18:58:40,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:58:40,361 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 13 states. [2018-02-04 18:58:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:40,397 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-02-04 18:58:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 18:58:40,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 18:58:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:40,398 INFO L225 Difference]: With dead ends: 105 [2018-02-04 18:58:40,398 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 18:58:40,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:58:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 18:58:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-02-04 18:58:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 18:58:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-02-04 18:58:40,403 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 48 [2018-02-04 18:58:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:40,403 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-02-04 18:58:40,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 18:58:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-02-04 18:58:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 18:58:40,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:40,404 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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 18:58:40,404 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:40,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426246, now seen corresponding path program 2 times [2018-02-04 18:58:40,405 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:40,405 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:40,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,406 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:40,406 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:40,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:58:40,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:40,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:40,473 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:58:40,490 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:58:40,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:58:40,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:40,547 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:58:40,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:40,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 18:58:40,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 18:58:40,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 18:58:40,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:58:40,548 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 15 states. [2018-02-04 18:58:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:40,603 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-02-04 18:58:40,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 18:58:40,604 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 18:58:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:40,605 INFO L225 Difference]: With dead ends: 109 [2018-02-04 18:58:40,605 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 18:58:40,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 18:58:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 18:58:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-02-04 18:58:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 18:58:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-02-04 18:58:40,610 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 52 [2018-02-04 18:58:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:40,610 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-02-04 18:58:40,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 18:58:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-02-04 18:58:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 18:58:40,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:40,617 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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 18:58:40,617 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:40,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1567126723, now seen corresponding path program 3 times [2018-02-04 18:58:40,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:40,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:40,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,618 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:58:40,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:40,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:58:40,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:40,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:40,707 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:58:40,726 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 18:58:40,726 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:58:40,729 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:40,733 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 18:58:40,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:40,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:40,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:58:40,813 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 18:58:40,820 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 18:58:40,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:40,824 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 18:58:40,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:58:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 3 not checked. [2018-02-04 18:58:40,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:40,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-04 18:58:40,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 18:58:40,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 18:58:40,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=220, Unknown=1, NotChecked=30, Total=306 [2018-02-04 18:58:40,858 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 18 states. [2018-02-04 18:58:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:41,296 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2018-02-04 18:58:41,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:58:41,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-02-04 18:58:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:41,297 INFO L225 Difference]: With dead ends: 142 [2018-02-04 18:58:41,297 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 18:58:41,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=820, Unknown=2, NotChecked=60, Total=1056 [2018-02-04 18:58:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 18:58:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2018-02-04 18:58:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 18:58:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-02-04 18:58:41,300 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 56 [2018-02-04 18:58:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:41,300 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-02-04 18:58:41,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 18:58:41,300 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-02-04 18:58:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 18:58:41,301 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:41,301 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 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 18:58:41,301 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash -429538227, now seen corresponding path program 1 times [2018-02-04 18:58:41,301 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:41,301 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:41,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:41,302 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:58:41,302 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:41,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:58:41,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:41,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:41,390 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:41,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:58:41,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:41,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 18:58:41,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 18:58:41,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 18:58:41,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:58:41,488 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 19 states. [2018-02-04 18:58:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:41,537 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-02-04 18:58:41,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:58:41,538 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 18:58:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:41,538 INFO L225 Difference]: With dead ends: 125 [2018-02-04 18:58:41,538 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 18:58:41,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 18:58:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 18:58:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-04 18:58:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 18:58:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-02-04 18:58:41,542 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 60 [2018-02-04 18:58:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:41,543 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-02-04 18:58:41,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 18:58:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-02-04 18:58:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 18:58:41,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:41,544 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 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 18:58:41,544 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:41,544 INFO L82 PathProgramCache]: Analyzing trace with hash 162408278, now seen corresponding path program 2 times [2018-02-04 18:58:41,544 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:41,544 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:41,545 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:41,545 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:41,545 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:41,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:58:41,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:41,632 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:41,633 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 18:58:41,645 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 18:58:41,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:58:41,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:58:41,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:41,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 18:58:41,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:58:41,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:58:41,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:58:41,725 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 21 states. [2018-02-04 18:58:41,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:41,770 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-02-04 18:58:41,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 18:58:41,771 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 18:58:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:41,771 INFO L225 Difference]: With dead ends: 129 [2018-02-04 18:58:41,771 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 18:58:41,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 18:58:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 18:58:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-02-04 18:58:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 18:58:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2018-02-04 18:58:41,774 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 64 [2018-02-04 18:58:41,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:41,774 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2018-02-04 18:58:41,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:58:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2018-02-04 18:58:41,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 18:58:41,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:41,775 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 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 18:58:41,775 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:41,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1131684385, now seen corresponding path program 3 times [2018-02-04 18:58:41,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:41,775 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:41,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:41,776 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:58:41,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:41,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 18:58:41,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:41,877 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:41,878 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 18:58:41,892 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 18:58:41,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 18:58:41,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:41,915 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 18:58:41,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:41,931 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 18:58:41,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:41,942 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 18:58:41,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:41,944 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 18:58:41,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:41,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:58:41,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 18:58:42,070 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_4 Int) (v_prenex_3 Int)) (let ((.cse1 (mod v_prenex_3 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_4) 0) (= |c_#length| (store |c_old(#length)| v_prenex_4 (+ .cse1 (- 4294967296)))) (< 2147483647 .cse1))))) is different from true [2018-02-04 18:58:42,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:42,091 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 35 treesize of output 38 [2018-02-04 18:58:42,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:42,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:42,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:42,114 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 34 treesize of output 35 [2018-02-04 18:58:42,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:42,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:42,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:42,136 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 18:58:42,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:42,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:42,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:42,158 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 18:58:42,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:42,175 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 18:58:42,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 18:58:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 162 trivial. 3 not checked. [2018-02-04 18:58:42,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:42,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-02-04 18:58:42,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 18:58:42,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 18:58:42,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=417, Unknown=1, NotChecked=42, Total=552 [2018-02-04 18:58:42,263 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 24 states. [2018-02-04 18:58:42,397 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_ldv_malloc_#in~size| 4294967296))) (let ((.cse5 (<= .cse2 2147483647)) (.cse0 (< 2147483647 .cse2))) (and (let ((.cse3 (select |c_#length| |c_ldv_malloc_#res.base|)) (.cse1 (= 1 (select |c_#valid| |c_ldv_malloc_#res.base|))) (.cse4 (= |c_ldv_malloc_#res.offset| 0))) (or (and .cse0 .cse1 (= .cse2 (+ .cse3 4294967296)) .cse4) (and (= .cse2 .cse3) .cse1 .cse4 .cse5))) (let ((.cse8 (select |c_#length| |c_ldv_malloc_#t~malloc1.base|)) (.cse6 (= |c_ldv_malloc_#t~malloc1.offset| 0)) (.cse7 (= 1 (select |c_#valid| |c_ldv_malloc_#t~malloc1.base|)))) (or (and .cse6 .cse7 .cse5 (= .cse2 .cse8)) (and (= (+ .cse8 4294967296) .cse2) .cse0 .cse6 .cse7))) (= |c_ldv_malloc_#in~size| c_ldv_malloc_~size) (or (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)))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse10 (mod v_prenex_3 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_4) 0) (= |c_#length| (store |c_old(#length)| v_prenex_4 (+ .cse10 (- 4294967296)))) (< 2147483647 .cse10)))))))) is different from true [2018-02-04 18:58:42,400 WARN L1033 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#length| |c_ldv_malloc_#res.base|)) (.cse1 (= 1 (select |c_#valid| |c_ldv_malloc_#res.base|))) (.cse3 (= |c_ldv_malloc_#res.offset| 0)) (.cse0 (mod |c_ldv_malloc_#in~size| 4294967296))) (or (and (< 2147483647 .cse0) .cse1 (= .cse0 (+ .cse2 4294967296)) .cse3) (and (= .cse0 .cse2) .cse1 .cse3 (<= .cse0 2147483647)))) (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse4 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse4) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse4 2147483647)))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse5 (mod v_prenex_3 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_4) 0) (= |c_#length| (store |c_old(#length)| v_prenex_4 (+ .cse5 (- 4294967296)))) (< 2147483647 .cse5)))))) is different from true [2018-02-04 18:58:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:43,924 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2018-02-04 18:58:43,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 18:58:43,924 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 68 [2018-02-04 18:58:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:43,925 INFO L225 Difference]: With dead ends: 151 [2018-02-04 18:58:43,925 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 18:58:43,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=1368, Unknown=3, NotChecked=240, Total=1892 [2018-02-04 18:58:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 18:58:43,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2018-02-04 18:58:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-04 18:58:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 159 transitions. [2018-02-04 18:58:43,930 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 159 transitions. Word has length 68 [2018-02-04 18:58:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:43,930 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 159 transitions. [2018-02-04 18:58:43,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 18:58:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2018-02-04 18:58:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 18:58:43,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:43,931 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:58:43,931 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:43,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2037934795, now seen corresponding path program 1 times [2018-02-04 18:58:43,931 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:43,931 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:43,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:43,932 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 18:58:43,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:43,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 18:58:43,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:43,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 18:58:43,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 18:58:43,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 18:58:43,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:58:43,984 INFO L87 Difference]: Start difference. First operand 141 states and 159 transitions. Second operand 9 states. [2018-02-04 18:58:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:44,088 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2018-02-04 18:58:44,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 18:58:44,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-02-04 18:58:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:44,089 INFO L225 Difference]: With dead ends: 157 [2018-02-04 18:58:44,089 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 18:58:44,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 18:58:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 18:58:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2018-02-04 18:58:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 18:58:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2018-02-04 18:58:44,093 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 74 [2018-02-04 18:58:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:44,093 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2018-02-04 18:58:44,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 18:58:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2018-02-04 18:58:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 18:58:44,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:44,094 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:58:44,094 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2037934796, now seen corresponding path program 1 times [2018-02-04 18:58:44,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:44,094 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:44,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:44,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:44,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:44,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 18:58:44,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:58:44,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:58:44,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 18:58:44,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 18:58:44,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 18:58:44,131 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand 7 states. [2018-02-04 18:58:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:44,205 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2018-02-04 18:58:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:58:44,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-02-04 18:58:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:44,206 INFO L225 Difference]: With dead ends: 179 [2018-02-04 18:58:44,206 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 18:58:44,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-04 18:58:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 18:58:44,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2018-02-04 18:58:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 18:58:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2018-02-04 18:58:44,212 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 74 [2018-02-04 18:58:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:44,213 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2018-02-04 18:58:44,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 18:58:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2018-02-04 18:58:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 18:58:44,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:44,214 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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] [2018-02-04 18:58:44,214 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1862067708, now seen corresponding path program 1 times [2018-02-04 18:58:44,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:44,214 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:44,216 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:44,216 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:44,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:44,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 18:58:44,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:44,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:44,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:44,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 18:58:44,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:44,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 16 [2018-02-04 18:58:44,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 18:58:44,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 18:58:44,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-04 18:58:44,411 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand 16 states. [2018-02-04 18:58:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:44,738 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2018-02-04 18:58:44,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 18:58:44,739 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-02-04 18:58:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:44,739 INFO L225 Difference]: With dead ends: 196 [2018-02-04 18:58:44,739 INFO L226 Difference]: Without dead ends: 196 [2018-02-04 18:58:44,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 18:58:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-04 18:58:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 152. [2018-02-04 18:58:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 18:58:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-02-04 18:58:44,742 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 79 [2018-02-04 18:58:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:44,742 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-02-04 18:58:44,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 18:58:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-02-04 18:58:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 18:58:44,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:44,743 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:58:44,743 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 449519657, now seen corresponding path program 1 times [2018-02-04 18:58:44,743 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:44,743 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:44,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:44,744 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:44,744 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:44,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 18:58:44,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:44,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:44,903 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:44,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:44,951 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 17 treesize of output 16 [2018-02-04 18:58:44,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:44,969 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 20 treesize of output 19 [2018-02-04 18:58:44,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:44,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:58:44,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 18:58:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 18:58:45,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 18:58:45,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 18:58:45,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 18:58:45,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 18:58:45,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 18:58:45,164 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 23 states. [2018-02-04 18:58:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:58:45,657 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2018-02-04 18:58:45,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 18:58:45,657 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-02-04 18:58:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:58:45,658 INFO L225 Difference]: With dead ends: 174 [2018-02-04 18:58:45,658 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 18:58:45,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 18:58:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 18:58:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2018-02-04 18:58:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 18:58:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-02-04 18:58:45,661 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 81 [2018-02-04 18:58:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:58:45,662 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-02-04 18:58:45,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 18:58:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-02-04 18:58:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 18:58:45,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:58:45,662 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:58:45,662 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:58:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1050207497, now seen corresponding path program 1 times [2018-02-04 18:58:45,663 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:58:45,663 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:58:45,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:45,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:45,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:58:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:45,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:58:45,688 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:58:45,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:58:45,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:58:45,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:58:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:58:45,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:58:45,747 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 20 treesize of output 19 [2018-02-04 18:58:45,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,758 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 17 treesize of output 16 [2018-02-04 18:58:45,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:58:45,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 18:58:45,872 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 18:58:45,874 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 18:58:45,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-02-04 18:58:45,927 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 23 treesize of output 18 [2018-02-04 18:58:45,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:45,930 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 18 treesize of output 27 [2018-02-04 18:58:45,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:58:45,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 18:58:45,976 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 34 treesize of output 27 [2018-02-04 18:58:45,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:45,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 18:58:45,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:45,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:58:45,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 18:58:46,286 WARN L143 SmtUtils]: Spent 270ms on a formula simplification that was a NOOP. DAG size: 33 [2018-02-04 18:58:50,044 WARN L143 SmtUtils]: Spent 1997ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 18:58:50,063 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 45 treesize of output 36 [2018-02-04 18:58:50,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:50,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:58:50,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:50,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:50,100 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 1 xjuncts. [2018-02-04 18:58:50,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:58:51,664 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 45 treesize of output 36 [2018-02-04 18:58:51,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:51,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:58:51,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:51,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:51,685 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 1 xjuncts. [2018-02-04 18:58:51,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:58:53,337 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 45 treesize of output 36 [2018-02-04 18:58:53,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:53,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:58:53,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:53,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:53,358 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 1 xjuncts. [2018-02-04 18:58:53,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:58:55,084 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 45 treesize of output 36 [2018-02-04 18:58:55,088 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:55,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:58:55,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:55,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:55,105 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 1 xjuncts. [2018-02-04 18:58:55,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:58:56,683 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 45 treesize of output 36 [2018-02-04 18:58:56,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:56,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:58:56,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:56,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:56,706 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 1 xjuncts. [2018-02-04 18:58:56,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:58:58,767 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 45 treesize of output 36 [2018-02-04 18:58:58,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:58:58,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:58:58,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:58:58,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:58:58,793 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 1 xjuncts. [2018-02-04 18:58:58,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:59:00,521 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 20 treesize of output 12 [2018-02-04 18:59:00,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:00,536 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 45 treesize of output 36 [2018-02-04 18:59:00,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:00,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:59:00,542 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:00,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:00,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:59:00,557 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-02-04 18:59:01,158 WARN L146 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 41 DAG size of output 32 [2018-02-04 18:59:01,365 WARN L143 SmtUtils]: Spent 189ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 18:59:01,585 WARN L143 SmtUtils]: Spent 199ms on a formula simplification that was a NOOP. DAG size: 30 [2018-02-04 18:59:01,645 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 28 treesize of output 22 [2018-02-04 18:59:01,646 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:01,647 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:01,647 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:59:01,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-02-04 18:59:01,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:01,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:01,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:59:01,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:12 [2018-02-04 18:59:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-02-04 18:59:01,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:59:01,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:59:01,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:59:01,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:59:01,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=358, Unknown=2, NotChecked=0, Total=420 [2018-02-04 18:59:01,697 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 21 states. [2018-02-04 18:59:03,086 WARN L143 SmtUtils]: Spent 515ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 18:59:03,577 WARN L146 SmtUtils]: Spent 447ms on a formula simplification. DAG size of input: 56 DAG size of output 47 [2018-02-04 18:59:03,826 WARN L143 SmtUtils]: Spent 208ms on a formula simplification that was a NOOP. DAG size: 43 [2018-02-04 18:59:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:59:04,133 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2018-02-04 18:59:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 18:59:04,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-04 18:59:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:59:04,134 INFO L225 Difference]: With dead ends: 197 [2018-02-04 18:59:04,134 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 18:59:04,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=155, Invalid=1033, Unknown=2, NotChecked=0, Total=1190 [2018-02-04 18:59:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 18:59:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2018-02-04 18:59:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 18:59:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2018-02-04 18:59:04,140 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 82 [2018-02-04 18:59:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:59:04,140 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2018-02-04 18:59:04,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:59:04,140 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2018-02-04 18:59:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 18:59:04,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:59:04,141 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:59:04,141 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:59:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1050207496, now seen corresponding path program 1 times [2018-02-04 18:59:04,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:59:04,142 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:59:04,143 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:59:04,143 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:59:04,143 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:59:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:59:04,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:59:04,169 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:59:04,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:59:04,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:59:04,171 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:59:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:59:04,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:59:04,224 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 20 treesize of output 19 [2018-02-04 18:59:04,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,238 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 17 treesize of output 16 [2018-02-04 18:59:04,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:59:04,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 18:59:04,337 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 18:59:04,339 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 18:59:04,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-02-04 18:59:04,394 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 23 treesize of output 18 [2018-02-04 18:59:04,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:04,397 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 18 treesize of output 27 [2018-02-04 18:59:04,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:59:04,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 18:59:04,449 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 34 treesize of output 27 [2018-02-04 18:59:04,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:04,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 18:59:04,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:04,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:59:04,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 18:59:06,483 WARN L143 SmtUtils]: Spent 1985ms on a formula simplification that was a NOOP. DAG size: 33 [2018-02-04 18:59:10,556 WARN L143 SmtUtils]: Spent 2036ms on a formula simplification that was a NOOP. DAG size: 38 [2018-02-04 18:59:10,561 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 45 treesize of output 36 [2018-02-04 18:59:10,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:10,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:59:10,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:10,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:10,584 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 1 xjuncts. [2018-02-04 18:59:10,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:59:12,530 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 45 treesize of output 36 [2018-02-04 18:59:12,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:12,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:59:12,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:12,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:12,556 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 1 xjuncts. [2018-02-04 18:59:12,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:59:14,502 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 45 treesize of output 36 [2018-02-04 18:59:14,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:14,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:59:14,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:14,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:14,529 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 1 xjuncts. [2018-02-04 18:59:14,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:59:16,352 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 45 treesize of output 36 [2018-02-04 18:59:16,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:16,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:59:16,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:16,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:16,383 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 1 xjuncts. [2018-02-04 18:59:16,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:59:18,384 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 45 treesize of output 36 [2018-02-04 18:59:18,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:18,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:59:18,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:18,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:18,414 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 1 xjuncts. [2018-02-04 18:59:18,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:59:20,288 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 45 treesize of output 36 [2018-02-04 18:59:20,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:20,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:59:20,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:20,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:20,311 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 1 xjuncts. [2018-02-04 18:59:20,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 18:59:22,124 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 20 treesize of output 12 [2018-02-04 18:59:22,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:22,147 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 45 treesize of output 36 [2018-02-04 18:59:22,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:22,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 18:59:22,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:22,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:22,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:59:22,168 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-02-04 18:59:24,644 WARN L146 SmtUtils]: Spent 2288ms on a formula simplification. DAG size of input: 41 DAG size of output 32 [2018-02-04 18:59:24,836 WARN L143 SmtUtils]: Spent 174ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-04 18:59:24,900 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 28 treesize of output 22 [2018-02-04 18:59:24,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:24,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:24,903 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:59:24,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 31 [2018-02-04 18:59:24,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:24,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:59:24,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:59:24,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:12 [2018-02-04 18:59:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 28 proven. 91 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-02-04 18:59:24,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:59:24,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 18:59:24,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 18:59:24,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 18:59:24,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=358, Unknown=2, NotChecked=0, Total=420 [2018-02-04 18:59:24,948 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand 21 states. [2018-02-04 18:59:27,945 WARN L143 SmtUtils]: Spent 2192ms on a formula simplification that was a NOOP. DAG size: 50 [2018-02-04 18:59:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:59:28,393 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2018-02-04 18:59:28,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 18:59:28,393 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-04 18:59:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:59:28,394 INFO L225 Difference]: With dead ends: 196 [2018-02-04 18:59:28,394 INFO L226 Difference]: Without dead ends: 196 [2018-02-04 18:59:28,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=168, Invalid=1162, Unknown=2, NotChecked=0, Total=1332 [2018-02-04 18:59:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-04 18:59:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 181. [2018-02-04 18:59:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 18:59:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2018-02-04 18:59:28,399 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 82 [2018-02-04 18:59:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:59:28,399 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2018-02-04 18:59:28,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 18:59:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2018-02-04 18:59:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 18:59:28,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:59:28,400 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:59:28,400 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:59:28,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1081535718, now seen corresponding path program 1 times [2018-02-04 18:59:28,400 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:59:28,400 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:59:28,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:59:28,401 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:59:28,401 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:59:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:59:28,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:59:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 18:59:28,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:59:28,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 18:59:28,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:59:28,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:59:28,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:59:28,432 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand 6 states. [2018-02-04 18:59:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:59:28,451 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2018-02-04 18:59:28,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 18:59:28,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-04 18:59:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:59:28,452 INFO L225 Difference]: With dead ends: 170 [2018-02-04 18:59:28,452 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 18:59:28,452 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 18:59:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 18:59:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2018-02-04 18:59:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-04 18:59:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2018-02-04 18:59:28,455 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 83 [2018-02-04 18:59:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:59:28,455 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2018-02-04 18:59:28,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:59:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2018-02-04 18:59:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 18:59:28,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:59:28,456 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-04 18:59:28,456 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 18:59:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -966536980, now seen corresponding path program 1 times [2018-02-04 18:59:28,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:59:28,456 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:59:28,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:59:28,457 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:59:28,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:59:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:59:28,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:59:28,497 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:59:28,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:59:28,497 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:59:28,498 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:59:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:59:28,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:59:28,522 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 18:59:28,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:28,535 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 18:59:28,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:28,548 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 18:59:28,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:28,549 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 18:59:28,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:28,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:59:28,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 18:59:28,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:28,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:28,704 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 18:59:28,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:28,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:28,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:28,733 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 18:59:28,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:28,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:28,760 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 18:59:28,760 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:28,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:28,785 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:28,785 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 18:59:28,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:28,818 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 18:59:28,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:75 [2018-02-04 18:59:28,991 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_18 Int) (v_prenex_17 Int)) (let ((.cse1 (mod v_prenex_17 4294967296))) (and (< 2147483647 .cse1) (= |c_#length| (store |c_old(#length)| v_prenex_18 (+ .cse1 (- 4294967296)))) (<= (select |c_old(#valid)| v_prenex_18) 0))))) is different from true [2018-02-04 18:59:29,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,005 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 18:59:29,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:29,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,111 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 61 treesize of output 65 [2018-02-04 18:59:29,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:29,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,188 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,189 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 18:59:29,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:29,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,257 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 18:59:29,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:29,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,327 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 18:59:29,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:29,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,390 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 54 treesize of output 73 [2018-02-04 18:59:29,391 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:29,452 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,453 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,453 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 18:59:29,453 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:29,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:59:29,516 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 18:59:29,517 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 18:59:29,563 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 18:59:29,563 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 18:59:47,149 WARN L146 SmtUtils]: Spent 15545ms on a formula simplification. DAG size of input: 98 DAG size of output 78 [2018-02-04 18:59:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 203 trivial. 6 not checked. [2018-02-04 18:59:47,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:59:47,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 18:59:47,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 18:59:47,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 18:59:47,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=207, Unknown=3, NotChecked=28, Total=272 [2018-02-04 18:59:47,172 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand 17 states. [2018-02-04 18:59:47,600 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 82 DAG size of output 64 [2018-02-04 19:00:33,300 WARN L146 SmtUtils]: Spent 6237ms on a formula simplification. DAG size of input: 103 DAG size of output 101 [2018-02-04 19:00:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:33,373 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2018-02-04 19:00:33,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:00:33,373 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-02-04 19:00:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:33,374 INFO L225 Difference]: With dead ends: 186 [2018-02-04 19:00:33,374 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 19:00:33,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=103, Invalid=708, Unknown=5, NotChecked=54, Total=870 [2018-02-04 19:00:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 19:00:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2018-02-04 19:00:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 19:00:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 181 transitions. [2018-02-04 19:00:33,378 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 181 transitions. Word has length 85 [2018-02-04 19:00:33,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:33,379 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 181 transitions. [2018-02-04 19:00:33,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:00:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 181 transitions. [2018-02-04 19:00:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 19:00:33,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:33,380 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:00:33,380 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:33,380 INFO L82 PathProgramCache]: Analyzing trace with hash 376505297, now seen corresponding path program 1 times [2018-02-04 19:00:33,380 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:33,380 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:33,381 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:33,381 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:33,381 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:33,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:00:33,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:33,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:33,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:33,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 19:00:33,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:33,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2018-02-04 19:00:33,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:00:33,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:00:33,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:00:33,613 INFO L87 Difference]: Start difference. First operand 162 states and 181 transitions. Second operand 18 states. [2018-02-04 19:00:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:34,045 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2018-02-04 19:00:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:00:34,045 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2018-02-04 19:00:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:34,045 INFO L225 Difference]: With dead ends: 182 [2018-02-04 19:00:34,046 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 19:00:34,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2018-02-04 19:00:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 19:00:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 160. [2018-02-04 19:00:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 19:00:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-02-04 19:00:34,049 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 86 [2018-02-04 19:00:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:34,049 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-02-04 19:00:34,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:00:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-02-04 19:00:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 19:00:34,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:34,050 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:34,050 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2078130140, now seen corresponding path program 1 times [2018-02-04 19:00:34,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:34,050 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:34,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:34,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:34,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:34,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 19:00:34,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:00:34,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:00:34,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:00:34,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:00:34,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:00:34,101 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 5 states. [2018-02-04 19:00:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:34,119 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2018-02-04 19:00:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:00:34,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-02-04 19:00:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:34,120 INFO L225 Difference]: With dead ends: 169 [2018-02-04 19:00:34,120 INFO L226 Difference]: Without dead ends: 165 [2018-02-04 19:00:34,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:00:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-04 19:00:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 150. [2018-02-04 19:00:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 19:00:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2018-02-04 19:00:34,124 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 86 [2018-02-04 19:00:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:34,124 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2018-02-04 19:00:34,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:00:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2018-02-04 19:00:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:00:34,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:34,125 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1] [2018-02-04 19:00:34,125 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:34,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1213237701, now seen corresponding path program 1 times [2018-02-04 19:00:34,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:34,126 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:34,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:34,126 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:34,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:34,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-04 19:00:34,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:34,394 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:34,395 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:34,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:34,520 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:00:34,521 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:00:34,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:34,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:34,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:34,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 19:00:34,588 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:00:34,589 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:00:34,590 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:00:34,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:34,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:34,596 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:00:34,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 19:00:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:00:34,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:34,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 25 [2018-02-04 19:00:34,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 19:00:34,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 19:00:34,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2018-02-04 19:00:34,620 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 26 states. [2018-02-04 19:00:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:35,043 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2018-02-04 19:00:35,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:00:35,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-02-04 19:00:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:35,044 INFO L225 Difference]: With dead ends: 198 [2018-02-04 19:00:35,044 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 19:00:35,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1440, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 19:00:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 19:00:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 170. [2018-02-04 19:00:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 19:00:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 188 transitions. [2018-02-04 19:00:35,048 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 188 transitions. Word has length 87 [2018-02-04 19:00:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:35,048 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 188 transitions. [2018-02-04 19:00:35,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 19:00:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 188 transitions. [2018-02-04 19:00:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:00:35,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:35,049 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1] [2018-02-04 19:00:35,049 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1213237700, now seen corresponding path program 1 times [2018-02-04 19:00:35,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:35,050 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:35,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:35,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:35,051 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:35,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:00:35,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:35,344 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:35,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:35,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:35,465 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:00:35,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:35,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:35,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:00:35,511 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:00:35,513 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:00:35,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:35,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:35,521 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:00:35,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-02-04 19:00:35,548 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:00:35,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:35,549 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:00:35,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-02-04 19:00:35,584 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:00:35,586 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:00:35,586 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:00:35,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:35,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:35,591 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:00:35,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2018-02-04 19:00:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-04 19:00:35,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:35,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2018-02-04 19:00:35,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 19:00:35,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 19:00:35,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:00:35,606 INFO L87 Difference]: Start difference. First operand 170 states and 188 transitions. Second operand 27 states. [2018-02-04 19:00:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:35,980 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2018-02-04 19:00:35,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:00:35,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 87 [2018-02-04 19:00:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:35,980 INFO L225 Difference]: With dead ends: 180 [2018-02-04 19:00:35,980 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 19:00:35,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=1384, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 19:00:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 19:00:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2018-02-04 19:00:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-04 19:00:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 189 transitions. [2018-02-04 19:00:35,984 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 189 transitions. Word has length 87 [2018-02-04 19:00:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:35,984 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 189 transitions. [2018-02-04 19:00:35,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 19:00:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 189 transitions. [2018-02-04 19:00:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:00:35,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:35,985 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:35,985 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -155427266, now seen corresponding path program 1 times [2018-02-04 19:00:35,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:35,985 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:35,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:35,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:35,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:36,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:36,012 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:36,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:36,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:36,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:36,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:36,068 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 20 treesize of output 19 [2018-02-04 19:00:36,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,082 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 17 treesize of output 16 [2018-02-04 19:00:36,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:00:36,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:00:36,186 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:00:36,188 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:00:36,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2018-02-04 19:00:36,240 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 23 treesize of output 18 [2018-02-04 19:00:36,242 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,243 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 18 treesize of output 27 [2018-02-04 19:00:36,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:36,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-04 19:00:36,278 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 34 treesize of output 27 [2018-02-04 19:00:36,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 19:00:36,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:36,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-04 19:00:36,369 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 45 treesize of output 36 [2018-02-04 19:00:36,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:00:36,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,390 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 1 xjuncts. [2018-02-04 19:00:36,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:00:36,428 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 45 treesize of output 36 [2018-02-04 19:00:36,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:00:36,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,458 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 1 xjuncts. [2018-02-04 19:00:36,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:00:36,497 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 45 treesize of output 36 [2018-02-04 19:00:36,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:00:36,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,518 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 1 xjuncts. [2018-02-04 19:00:36,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:00:36,585 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 45 treesize of output 36 [2018-02-04 19:00:36,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:00:36,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,608 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 1 xjuncts. [2018-02-04 19:00:36,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:00:36,661 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 45 treesize of output 36 [2018-02-04 19:00:36,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:00:36,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,690 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 1 xjuncts. [2018-02-04 19:00:36,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:00:36,727 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 45 treesize of output 36 [2018-02-04 19:00:36,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:00:36,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,765 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 1 xjuncts. [2018-02-04 19:00:36,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-02-04 19:00:36,803 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 20 treesize of output 12 [2018-02-04 19:00:36,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,818 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 45 treesize of output 36 [2018-02-04 19:00:36,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 52 [2018-02-04 19:00:36,825 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:36,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:36,841 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-02-04 19:00:36,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 28 treesize of output 22 [2018-02-04 19:00:36,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:36,995 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:00:36,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-02-04 19:00:36,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:37,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:37,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:37,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:17 [2018-02-04 19:00:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 28 proven. 94 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-02-04 19:00:37,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:37,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:00:37,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:00:37,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:00:37,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:00:37,099 INFO L87 Difference]: Start difference. First operand 171 states and 189 transitions. Second operand 22 states. [2018-02-04 19:00:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:37,950 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2018-02-04 19:00:37,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:00:37,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-02-04 19:00:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:37,953 INFO L225 Difference]: With dead ends: 187 [2018-02-04 19:00:37,953 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 19:00:37,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=1437, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 19:00:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 19:00:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 176. [2018-02-04 19:00:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 19:00:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2018-02-04 19:00:37,958 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 87 [2018-02-04 19:00:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:37,958 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2018-02-04 19:00:37,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:00:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2018-02-04 19:00:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:00:37,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:37,959 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:37,959 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash -155427265, now seen corresponding path program 1 times [2018-02-04 19:00:37,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:37,960 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:37,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:37,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:37,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:37,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-04 19:00:38,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:38,153 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:38,154 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:38,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:38,206 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 20 treesize of output 19 [2018-02-04 19:00:38,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:38,220 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 17 treesize of output 16 [2018-02-04 19:00:38,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:38,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:00:38,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 19:00:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 19:00:38,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:38,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-02-04 19:00:38,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 19:00:38,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 19:00:38,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-02-04 19:00:38,441 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand 25 states. [2018-02-04 19:00:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:38,995 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2018-02-04 19:00:38,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:00:38,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-02-04 19:00:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:38,996 INFO L225 Difference]: With dead ends: 194 [2018-02-04 19:00:38,996 INFO L226 Difference]: Without dead ends: 194 [2018-02-04 19:00:38,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=1393, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 19:00:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-04 19:00:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2018-02-04 19:00:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 19:00:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2018-02-04 19:00:39,000 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 87 [2018-02-04 19:00:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:39,001 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2018-02-04 19:00:39,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 19:00:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2018-02-04 19:00:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 19:00:39,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:39,002 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:39,002 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash -523277901, now seen corresponding path program 1 times [2018-02-04 19:00:39,002 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:39,002 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:39,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:39,003 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:39,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:39,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:39,030 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:39,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:39,031 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:39,031 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:39,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:39,100 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:00:39,101 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:00:39,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 19:00:39,135 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 25 treesize of output 20 [2018-02-04 19:00:39,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,137 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 20 treesize of output 31 [2018-02-04 19:00:39,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:39,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 19:00:39,172 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 36 treesize of output 29 [2018-02-04 19:00:39,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2018-02-04 19:00:39,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:39,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2018-02-04 19:00:39,251 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 47 treesize of output 38 [2018-02-04 19:00:39,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:39,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,279 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 1 xjuncts. [2018-02-04 19:00:39,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:39,345 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 47 treesize of output 38 [2018-02-04 19:00:39,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:39,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,374 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 1 xjuncts. [2018-02-04 19:00:39,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:39,403 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 47 treesize of output 38 [2018-02-04 19:00:39,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:39,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,431 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 1 xjuncts. [2018-02-04 19:00:39,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:39,462 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 47 treesize of output 38 [2018-02-04 19:00:39,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:39,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,490 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 1 xjuncts. [2018-02-04 19:00:39,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:39,519 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 47 treesize of output 38 [2018-02-04 19:00:39,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:39,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,546 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 1 xjuncts. [2018-02-04 19:00:39,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:39,576 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 47 treesize of output 38 [2018-02-04 19:00:39,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:39,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,607 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 1 xjuncts. [2018-02-04 19:00:39,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:39,782 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 32 treesize of output 26 [2018-02-04 19:00:39,785 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:00:39,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:39,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-02-04 19:00:39,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:39,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:3 [2018-02-04 19:00:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 33 proven. 101 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-02-04 19:00:39,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:39,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:00:39,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:00:39,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:00:39,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:00:39,835 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand 22 states. [2018-02-04 19:00:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:40,741 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2018-02-04 19:00:40,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:00:40,741 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-02-04 19:00:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:40,742 INFO L225 Difference]: With dead ends: 189 [2018-02-04 19:00:40,742 INFO L226 Difference]: Without dead ends: 189 [2018-02-04 19:00:40,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=1304, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 19:00:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-04 19:00:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2018-02-04 19:00:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 19:00:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 196 transitions. [2018-02-04 19:00:40,747 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 196 transitions. Word has length 88 [2018-02-04 19:00:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:40,747 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 196 transitions. [2018-02-04 19:00:40,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:00:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 196 transitions. [2018-02-04 19:00:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 19:00:40,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:40,748 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:40,748 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash -523277902, now seen corresponding path program 1 times [2018-02-04 19:00:40,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:40,748 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:40,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:40,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:40,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:40,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:40,771 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:40,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:40,771 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:40,772 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:40,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:40,847 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:00:40,849 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:00:40,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:40,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:40,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:40,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 19:00:40,888 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 25 treesize of output 20 [2018-02-04 19:00:40,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:40,891 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 20 treesize of output 31 [2018-02-04 19:00:40,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:40,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:40,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:40,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 19:00:40,932 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 36 treesize of output 29 [2018-02-04 19:00:40,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:40,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2018-02-04 19:00:40,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:40,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:40,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:40,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2018-02-04 19:00:41,026 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 47 treesize of output 38 [2018-02-04 19:00:41,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:41,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:41,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,056 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 1 xjuncts. [2018-02-04 19:00:41,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:41,130 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 47 treesize of output 38 [2018-02-04 19:00:41,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:41,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:41,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,160 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 1 xjuncts. [2018-02-04 19:00:41,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:41,193 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 47 treesize of output 38 [2018-02-04 19:00:41,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:41,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:41,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,223 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 1 xjuncts. [2018-02-04 19:00:41,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:41,253 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 47 treesize of output 38 [2018-02-04 19:00:41,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:41,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:41,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,283 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 1 xjuncts. [2018-02-04 19:00:41,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:41,313 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 47 treesize of output 38 [2018-02-04 19:00:41,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:41,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:41,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,344 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 1 xjuncts. [2018-02-04 19:00:41,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:41,376 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 47 treesize of output 38 [2018-02-04 19:00:41,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:41,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:41,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,406 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 1 xjuncts. [2018-02-04 19:00:41,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-02-04 19:00:41,591 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 32 treesize of output 26 [2018-02-04 19:00:41,594 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:41,595 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:41,595 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:00:41,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-04 19:00:41,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:41,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:51, output treesize:3 [2018-02-04 19:00:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 33 proven. 101 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-02-04 19:00:41,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:41,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:00:41,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:00:41,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:00:41,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:00:41,669 INFO L87 Difference]: Start difference. First operand 177 states and 196 transitions. Second operand 22 states. [2018-02-04 19:00:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:42,381 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2018-02-04 19:00:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 19:00:42,381 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-02-04 19:00:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:42,382 INFO L225 Difference]: With dead ends: 188 [2018-02-04 19:00:42,382 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 19:00:42,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=1517, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 19:00:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 19:00:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 177. [2018-02-04 19:00:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-04 19:00:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 195 transitions. [2018-02-04 19:00:42,386 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 195 transitions. Word has length 88 [2018-02-04 19:00:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:42,386 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 195 transitions. [2018-02-04 19:00:42,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:00:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 195 transitions. [2018-02-04 19:00:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-04 19:00:42,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:42,387 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:42,387 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash 958207932, now seen corresponding path program 1 times [2018-02-04 19:00:42,387 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:42,387 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:42,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:42,388 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:42,388 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:42,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 19:00:42,442 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:42,442 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:42,443 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:42,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 19:00:42,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:42,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 19:00:42,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:00:42,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:00:42,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:00:42,483 INFO L87 Difference]: Start difference. First operand 177 states and 195 transitions. Second operand 8 states. [2018-02-04 19:00:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:42,516 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2018-02-04 19:00:42,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:00:42,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2018-02-04 19:00:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:42,517 INFO L225 Difference]: With dead ends: 201 [2018-02-04 19:00:42,517 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 19:00:42,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:00:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 19:00:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 183. [2018-02-04 19:00:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 19:00:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2018-02-04 19:00:42,521 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 89 [2018-02-04 19:00:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:42,521 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2018-02-04 19:00:42,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:00:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2018-02-04 19:00:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 19:00:42,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:42,522 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-04 19:00:42,522 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:42,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2131021318, now seen corresponding path program 1 times [2018-02-04 19:00:42,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:42,522 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:42,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:42,523 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:42,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:42,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 19:00:42,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:42,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:42,568 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:42,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 19:00:42,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:42,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 19:00:42,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:00:42,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:00:42,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:00:42,594 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand 7 states. [2018-02-04 19:00:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:42,638 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2018-02-04 19:00:42,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:00:42,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-02-04 19:00:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:42,639 INFO L225 Difference]: With dead ends: 185 [2018-02-04 19:00:42,639 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 19:00:42,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:00:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 19:00:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2018-02-04 19:00:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 19:00:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 199 transitions. [2018-02-04 19:00:42,643 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 199 transitions. Word has length 92 [2018-02-04 19:00:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:42,644 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 199 transitions. [2018-02-04 19:00:42,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:00:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2018-02-04 19:00:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 19:00:42,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:42,644 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1] [2018-02-04 19:00:42,644 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:42,645 INFO L82 PathProgramCache]: Analyzing trace with hash 372457076, now seen corresponding path program 1 times [2018-02-04 19:00:42,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:42,645 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:42,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:42,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:42,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:42,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-04 19:00:42,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:42,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:42,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:42,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-04 19:00:42,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:42,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-02-04 19:00:42,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:00:42,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:00:42,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:00:42,753 INFO L87 Difference]: Start difference. First operand 181 states and 199 transitions. Second operand 10 states. [2018-02-04 19:00:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:42,811 INFO L93 Difference]: Finished difference Result 211 states and 233 transitions. [2018-02-04 19:00:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:00:42,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-02-04 19:00:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:42,812 INFO L225 Difference]: With dead ends: 211 [2018-02-04 19:00:42,812 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 19:00:42,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:00:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 19:00:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2018-02-04 19:00:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 19:00:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 202 transitions. [2018-02-04 19:00:42,816 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 202 transitions. Word has length 93 [2018-02-04 19:00:42,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:42,817 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 202 transitions. [2018-02-04 19:00:42,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:00:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 202 transitions. [2018-02-04 19:00:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 19:00:42,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:42,817 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:42,818 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 665082788, now seen corresponding path program 1 times [2018-02-04 19:00:42,818 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:42,818 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:42,819 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:42,819 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:42,819 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:42,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-04 19:00:42,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:42,904 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:42,904 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:42,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 19:00:42,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:42,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2018-02-04 19:00:42,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:00:42,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:00:42,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:00:42,949 INFO L87 Difference]: Start difference. First operand 184 states and 202 transitions. Second operand 11 states. [2018-02-04 19:00:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:43,133 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2018-02-04 19:00:43,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:00:43,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-04 19:00:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:43,134 INFO L225 Difference]: With dead ends: 188 [2018-02-04 19:00:43,134 INFO L226 Difference]: Without dead ends: 188 [2018-02-04 19:00:43,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:00:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-04 19:00:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2018-02-04 19:00:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 19:00:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2018-02-04 19:00:43,137 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 94 [2018-02-04 19:00:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:43,137 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2018-02-04 19:00:43,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:00:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2018-02-04 19:00:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 19:00:43,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:43,137 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:43,137 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:43,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1475333164, now seen corresponding path program 2 times [2018-02-04 19:00:43,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:43,138 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:43,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:43,138 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:43,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:43,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:43,160 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:43,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:43,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:43,161 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:00:43,187 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:00:43,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:00:43,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:43,201 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:00:43,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 19:00:43,212 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:00:43,213 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:00:43,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 19:00:43,241 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 25 treesize of output 20 [2018-02-04 19:00:43,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,244 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 20 treesize of output 31 [2018-02-04 19:00:43,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:43,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-02-04 19:00:43,275 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 36 treesize of output 29 [2018-02-04 19:00:43,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2018-02-04 19:00:43,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:43,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-02-04 19:00:43,343 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 47 treesize of output 38 [2018-02-04 19:00:43,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:43,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,366 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 1 xjuncts. [2018-02-04 19:00:43,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-04 19:00:43,410 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 47 treesize of output 38 [2018-02-04 19:00:43,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:43,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,431 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 1 xjuncts. [2018-02-04 19:00:43,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-04 19:00:43,449 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 47 treesize of output 38 [2018-02-04 19:00:43,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:43,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,471 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 1 xjuncts. [2018-02-04 19:00:43,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-04 19:00:43,493 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 47 treesize of output 38 [2018-02-04 19:00:43,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:43,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,515 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 1 xjuncts. [2018-02-04 19:00:43,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-04 19:00:43,532 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 47 treesize of output 38 [2018-02-04 19:00:43,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:43,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,550 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 1 xjuncts. [2018-02-04 19:00:43,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-04 19:00:43,579 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 47 treesize of output 38 [2018-02-04 19:00:43,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-04 19:00:43,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,607 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 1 xjuncts. [2018-02-04 19:00:43,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-04 19:00:43,686 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 30 treesize of output 24 [2018-02-04 19:00:43,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:43,688 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-02-04 19:00:43,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:43,692 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:00:43,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:9 [2018-02-04 19:00:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 33 proven. 107 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-02-04 19:00:43,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:43,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 19:00:43,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:00:43,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:00:43,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:00:43,731 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand 18 states. [2018-02-04 19:00:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:44,239 INFO L93 Difference]: Finished difference Result 192 states and 209 transitions. [2018-02-04 19:00:44,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:00:44,240 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-02-04 19:00:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:44,240 INFO L225 Difference]: With dead ends: 192 [2018-02-04 19:00:44,240 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 19:00:44,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 19:00:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 19:00:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 186. [2018-02-04 19:00:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 19:00:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-02-04 19:00:44,242 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 93 [2018-02-04 19:00:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:44,243 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-02-04 19:00:44,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:00:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-02-04 19:00:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 19:00:44,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:44,243 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:44,243 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:44,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1509312221, now seen corresponding path program 2 times [2018-02-04 19:00:44,243 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:44,243 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:44,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:44,244 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:00:44,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:44,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:44,259 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:44,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:44,260 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:44,260 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:00:44,277 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:00:44,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:00:44,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:44,296 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:00:44,298 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:00:44,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 19:00:44,318 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 25 treesize of output 20 [2018-02-04 19:00:44,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,320 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 20 treesize of output 31 [2018-02-04 19:00:44,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 19:00:44,371 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 34 treesize of output 27 [2018-02-04 19:00:44,374 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,376 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,376 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 27 treesize of output 58 [2018-02-04 19:00:44,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-02-04 19:00:44,417 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 43 treesize of output 34 [2018-02-04 19:00:44,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-02-04 19:00:44,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-02-04 19:00:44,470 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 52 treesize of output 41 [2018-02-04 19:00:44,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 136 [2018-02-04 19:00:44,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-02-04 19:00:44,564 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 61 treesize of output 48 [2018-02-04 19:00:44,566 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,571 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,574 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 187 [2018-02-04 19:00:44,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-02-04 19:00:44,661 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 70 treesize of output 55 [2018-02-04 19:00:44,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,663 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,672 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 246 [2018-02-04 19:00:44,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-02-04 19:00:44,810 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 79 treesize of output 62 [2018-02-04 19:00:44,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,817 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,829 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:44,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 313 [2018-02-04 19:00:44,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:44,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-02-04 19:00:45,051 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 82 treesize of output 64 [2018-02-04 19:00:45,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:45,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 228 [2018-02-04 19:00:45,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:45,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:45,083 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:00:45,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:3 [2018-02-04 19:00:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:00:45,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:45,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 19:00:45,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 19:00:45,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 19:00:45,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-02-04 19:00:45,123 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 29 states. [2018-02-04 19:00:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:45,888 INFO L93 Difference]: Finished difference Result 212 states and 231 transitions. [2018-02-04 19:00:45,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 19:00:45,888 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 94 [2018-02-04 19:00:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:45,889 INFO L225 Difference]: With dead ends: 212 [2018-02-04 19:00:45,889 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 19:00:45,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 19:00:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 19:00:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 187. [2018-02-04 19:00:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-04 19:00:45,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 205 transitions. [2018-02-04 19:00:45,891 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 205 transitions. Word has length 94 [2018-02-04 19:00:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:45,892 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 205 transitions. [2018-02-04 19:00:45,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 19:00:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 205 transitions. [2018-02-04 19:00:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 19:00:45,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:45,893 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:45,893 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1509312220, now seen corresponding path program 2 times [2018-02-04 19:00:45,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:45,893 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:45,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:45,894 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:00:45,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:45,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:45,929 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:45,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:45,929 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:45,930 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:00:45,959 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:00:45,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:00:45,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:45,985 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:00:45,986 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:00:45,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:45,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:45,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:45,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-02-04 19:00:46,013 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 25 treesize of output 20 [2018-02-04 19:00:46,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,016 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 20 treesize of output 31 [2018-02-04 19:00:46,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-04 19:00:46,053 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 34 treesize of output 27 [2018-02-04 19:00:46,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,058 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 27 treesize of output 58 [2018-02-04 19:00:46,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-02-04 19:00:46,114 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 43 treesize of output 34 [2018-02-04 19:00:46,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,119 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-02-04 19:00:46,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-02-04 19:00:46,187 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 52 treesize of output 41 [2018-02-04 19:00:46,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,191 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 136 [2018-02-04 19:00:46,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-02-04 19:00:46,256 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 61 treesize of output 48 [2018-02-04 19:00:46,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 187 [2018-02-04 19:00:46,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-02-04 19:00:46,344 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 70 treesize of output 55 [2018-02-04 19:00:46,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,349 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,355 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 246 [2018-02-04 19:00:46,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-02-04 19:00:46,435 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 79 treesize of output 62 [2018-02-04 19:00:46,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,449 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,450 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,451 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 313 [2018-02-04 19:00:46,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2018-02-04 19:00:46,714 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 82 treesize of output 64 [2018-02-04 19:00:46,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,719 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,721 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,729 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:46,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 228 [2018-02-04 19:00:46,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:46,754 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:00:46,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:3 [2018-02-04 19:00:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:00:46,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:46,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 19:00:46,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 19:00:46,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 19:00:46,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-02-04 19:00:46,795 INFO L87 Difference]: Start difference. First operand 187 states and 205 transitions. Second operand 29 states. [2018-02-04 19:00:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:47,760 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2018-02-04 19:00:47,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 19:00:47,760 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 94 [2018-02-04 19:00:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:47,760 INFO L225 Difference]: With dead ends: 211 [2018-02-04 19:00:47,760 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 19:00:47,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=1476, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 19:00:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 19:00:47,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 187. [2018-02-04 19:00:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-04 19:00:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2018-02-04 19:00:47,764 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 94 [2018-02-04 19:00:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:47,764 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2018-02-04 19:00:47,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 19:00:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2018-02-04 19:00:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 19:00:47,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:47,765 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:47,765 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash -456007726, now seen corresponding path program 2 times [2018-02-04 19:00:47,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:47,766 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:47,766 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:47,766 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:00:47,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:47,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 19:00:47,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:47,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:47,840 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:00:47,853 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:00:47,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:00:47,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-04 19:00:47,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:47,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-02-04 19:00:47,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:00:47,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:00:47,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:00:47,890 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand 10 states. [2018-02-04 19:00:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:47,941 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-02-04 19:00:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:00:47,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-02-04 19:00:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:47,942 INFO L225 Difference]: With dead ends: 215 [2018-02-04 19:00:47,942 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 19:00:47,943 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:00:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 19:00:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2018-02-04 19:00:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 19:00:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-02-04 19:00:47,946 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 95 [2018-02-04 19:00:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:47,946 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-02-04 19:00:47,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:00:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-02-04 19:00:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-04 19:00:47,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:47,948 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-04 19:00:47,948 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash 83553896, now seen corresponding path program 2 times [2018-02-04 19:00:47,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:47,948 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:47,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:47,949 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:00:47,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:47,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:47,976 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:47,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:47,976 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:47,977 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:00:48,006 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:00:48,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:00:48,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:48,018 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:00:48,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,036 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:00:48,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,038 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:00:48,038 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,062 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:00:48,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:00:48,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:00:48,224 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,225 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:00:48,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,250 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:00:48,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,276 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 37 treesize of output 38 [2018-02-04 19:00:48,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,299 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 31 treesize of output 40 [2018-02-04 19:00:48,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,321 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:00:48,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:00:48,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 93 [2018-02-04 19:00:48,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:00:48,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,658 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,658 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 73 [2018-02-04 19:00:48,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:48,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 95 [2018-02-04 19:00:48,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:00:48,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:48,911 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 71 [2018-02-04 19:00:48,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:49,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,037 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 87 [2018-02-04 19:00:49,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 19:00:49,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,194 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 55 treesize of output 62 [2018-02-04 19:00:49,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:49,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,210 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 61 treesize of output 68 [2018-02-04 19:00:49,211 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:49,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,333 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 63 treesize of output 70 [2018-02-04 19:00:49,333 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:49,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,335 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 57 treesize of output 64 [2018-02-04 19:00:49,336 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:49,463 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 2 case distinctions, treesize of input 62 treesize of output 65 [2018-02-04 19:00:49,463 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 19:00:49,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 24 dim-0 vars, and 8 xjuncts. [2018-02-04 19:00:49,603 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 24 variables, input treesize:257, output treesize:413 [2018-02-04 19:00:49,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,826 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:00:49,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:49,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:49,902 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 63 [2018-02-04 19:00:49,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:49,970 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 56 treesize of output 55 [2018-02-04 19:00:49,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:50,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,041 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:00:50,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:50,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,111 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:00:50,111 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:50,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,180 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,182 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:00:50,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:50,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,244 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:00:50,244 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:50,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,299 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,300 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:50,300 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:00:50,300 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:50,354 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:00:50,354 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:253, output treesize:205 [2018-02-04 19:00:50,539 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 99 DAG size of output 79 [2018-02-04 19:00:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-02-04 19:00:50,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:50,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 19:00:50,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 19:00:50,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 19:00:50,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:00:50,571 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 19 states. [2018-02-04 19:00:52,296 WARN L146 SmtUtils]: Spent 344ms on a formula simplification. DAG size of input: 111 DAG size of output 111 [2018-02-04 19:00:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:52,374 INFO L93 Difference]: Finished difference Result 223 states and 240 transitions. [2018-02-04 19:00:52,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:00:52,375 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2018-02-04 19:00:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:52,375 INFO L225 Difference]: With dead ends: 223 [2018-02-04 19:00:52,375 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 19:00:52,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 19:00:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 19:00:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 197. [2018-02-04 19:00:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 19:00:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2018-02-04 19:00:52,378 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 98 [2018-02-04 19:00:52,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:52,378 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2018-02-04 19:00:52,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 19:00:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2018-02-04 19:00:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 19:00:52,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:52,378 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-04 19:00:52,379 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1393220425, now seen corresponding path program 2 times [2018-02-04 19:00:52,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:52,379 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:52,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:52,379 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:00:52,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:52,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-04 19:00:52,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:52,820 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:52,820 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:00:52,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:00:52,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:00:52,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:52,886 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:00:52,887 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:00:52,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:52,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:52,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:52,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 19:00:52,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2018-02-04 19:00:53,000 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 29 treesize of output 3 [2018-02-04 19:00:53,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:53,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:53,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:53,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:35, output treesize:3 [2018-02-04 19:00:53,010 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-02-04 19:00:53,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:53,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 25 [2018-02-04 19:00:53,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 19:00:53,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 19:00:53,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2018-02-04 19:00:53,011 INFO L87 Difference]: Start difference. First operand 197 states and 219 transitions. Second operand 26 states. [2018-02-04 19:00:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:53,538 INFO L93 Difference]: Finished difference Result 229 states and 251 transitions. [2018-02-04 19:00:53,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 19:00:53,538 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 100 [2018-02-04 19:00:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:53,539 INFO L225 Difference]: With dead ends: 229 [2018-02-04 19:00:53,539 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 19:00:53,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 98 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1810, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 19:00:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 19:00:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 206. [2018-02-04 19:00:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 19:00:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2018-02-04 19:00:53,547 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 100 [2018-02-04 19:00:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:53,548 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2018-02-04 19:00:53,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 19:00:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2018-02-04 19:00:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 19:00:53,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:53,548 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1] [2018-02-04 19:00:53,549 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1393220424, now seen corresponding path program 2 times [2018-02-04 19:00:53,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:53,549 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:53,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:53,550 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:00:53,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:53,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-04 19:00:53,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:53,939 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:53,939 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:00:53,958 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:00:53,958 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:00:53,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:53,976 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:00:53,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:53,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:53,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:00:54,006 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:00:54,008 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:00:54,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,013 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:00:54,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-02-04 19:00:54,050 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:00:54,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,051 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:00:54,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:18, output treesize:3 [2018-02-04 19:00:54,071 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:00:54,083 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 21 treesize of output 5 [2018-02-04 19:00:54,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,102 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:00:54,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-02-04 19:00:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-02-04 19:00:54,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:54,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 26 [2018-02-04 19:00:54,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 19:00:54,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 19:00:54,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:00:54,124 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand 27 states. [2018-02-04 19:00:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:54,561 INFO L93 Difference]: Finished difference Result 215 states and 232 transitions. [2018-02-04 19:00:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 19:00:54,561 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-02-04 19:00:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:54,562 INFO L225 Difference]: With dead ends: 215 [2018-02-04 19:00:54,562 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 19:00:54,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 101 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=2011, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 19:00:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 19:00:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2018-02-04 19:00:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-04 19:00:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-02-04 19:00:54,565 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 100 [2018-02-04 19:00:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:54,565 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-02-04 19:00:54,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 19:00:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-02-04 19:00:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 19:00:54,566 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:54,566 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:54,566 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1824682022, now seen corresponding path program 1 times [2018-02-04 19:00:54,566 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:54,566 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:54,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:54,567 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:00:54,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:54,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:54,592 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:54,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:54,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:54,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:54,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:54,609 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:00:54,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:00:54,744 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:00:54,746 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:00:54,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,756 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:00:54,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:56 [2018-02-04 19:00:54,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 3 [2018-02-04 19:00:54,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:54,802 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:00:54,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:26 [2018-02-04 19:00:54,907 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 51 treesize of output 43 [2018-02-04 19:00:54,916 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 43 treesize of output 32 [2018-02-04 19:00:54,917 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:00:54,930 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:00:54,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-04 19:00:54,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:58 [2018-02-04 19:00:55,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:55,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:55,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:55,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 30 [2018-02-04 19:00:55,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:55,134 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:00:55,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:15 [2018-02-04 19:00:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-04 19:00:55,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:55,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:00:55,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:00:55,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:00:55,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:00:55,209 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 22 states. [2018-02-04 19:00:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:55,904 INFO L93 Difference]: Finished difference Result 223 states and 241 transitions. [2018-02-04 19:00:55,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:00:55,904 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-04 19:00:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:55,905 INFO L225 Difference]: With dead ends: 223 [2018-02-04 19:00:55,905 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 19:00:55,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2018-02-04 19:00:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 19:00:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 215. [2018-02-04 19:00:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 19:00:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 238 transitions. [2018-02-04 19:00:55,907 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 238 transitions. Word has length 100 [2018-02-04 19:00:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:55,908 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 238 transitions. [2018-02-04 19:00:55,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:00:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 238 transitions. [2018-02-04 19:00:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-04 19:00:55,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:55,909 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:55,909 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1824682021, now seen corresponding path program 1 times [2018-02-04 19:00:55,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:55,909 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:55,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:55,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:55,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:55,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-04 19:00:56,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:56,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:56,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:56,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-04 19:00:56,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:00:56,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2018-02-04 19:00:56,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 19:00:56,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 19:00:56,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2018-02-04 19:00:56,380 INFO L87 Difference]: Start difference. First operand 215 states and 238 transitions. Second operand 25 states. [2018-02-04 19:00:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:56,772 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-04 19:00:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 19:00:56,772 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-04 19:00:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:56,773 INFO L225 Difference]: With dead ends: 229 [2018-02-04 19:00:56,773 INFO L226 Difference]: Without dead ends: 229 [2018-02-04 19:00:56,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 19:00:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-04 19:00:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 215. [2018-02-04 19:00:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 19:00:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2018-02-04 19:00:56,776 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 100 [2018-02-04 19:00:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:56,776 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2018-02-04 19:00:56,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 19:00:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2018-02-04 19:00:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 19:00:56,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:56,776 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:56,776 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1565982954, now seen corresponding path program 3 times [2018-02-04 19:00:56,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:56,777 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:56,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:56,777 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:00:56,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:00:56,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:00:56,793 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:00:56,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:00:56,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:00:56,794 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:00:56,813 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-02-04 19:00:56,813 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:00:56,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:00:56,860 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 13 treesize of output 10 [2018-02-04 19:00:56,862 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 10 treesize of output 9 [2018-02-04 19:00:56,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:56,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:56,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:56,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-02-04 19:00:56,881 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 25 treesize of output 20 [2018-02-04 19:00:56,883 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 20 treesize of output 21 [2018-02-04 19:00:56,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:56,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:56,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:56,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 19:00:56,957 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 36 treesize of output 29 [2018-02-04 19:00:56,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 32 [2018-02-04 19:00:56,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:56,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:56,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:56,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-02-04 19:00:57,023 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 36 treesize of output 29 [2018-02-04 19:00:57,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 32 [2018-02-04 19:00:57,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:57,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-02-04 19:00:57,064 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 36 treesize of output 29 [2018-02-04 19:00:57,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 32 [2018-02-04 19:00:57,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:57,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-02-04 19:00:57,104 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 36 treesize of output 29 [2018-02-04 19:00:57,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 32 [2018-02-04 19:00:57,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:57,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-02-04 19:00:57,145 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 36 treesize of output 29 [2018-02-04 19:00:57,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 32 [2018-02-04 19:00:57,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:57,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-02-04 19:00:57,201 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 36 treesize of output 29 [2018-02-04 19:00:57,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 29 treesize of output 32 [2018-02-04 19:00:57,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:00:57,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-02-04 19:00:57,347 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 24 treesize of output 18 [2018-02-04 19:00:57,348 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:00:57,349 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 19:00:57,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:00:57,354 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:00:57,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:13 [2018-02-04 19:00:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 27 proven. 124 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-04 19:00:57,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:00:57,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 19:00:57,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 19:00:57,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 19:00:57,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:00:57,402 INFO L87 Difference]: Start difference. First operand 215 states and 236 transitions. Second operand 21 states. [2018-02-04 19:00:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:00:58,084 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2018-02-04 19:00:58,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 19:00:58,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-02-04 19:00:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:00:58,085 INFO L225 Difference]: With dead ends: 232 [2018-02-04 19:00:58,085 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 19:00:58,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=1305, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 19:00:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 19:00:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 220. [2018-02-04 19:00:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 19:00:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 242 transitions. [2018-02-04 19:00:58,088 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 242 transitions. Word has length 99 [2018-02-04 19:00:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:00:58,089 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 242 transitions. [2018-02-04 19:00:58,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 19:00:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 242 transitions. [2018-02-04 19:00:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 19:00:58,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:00:58,090 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:00:58,090 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-04 19:00:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash -730567785, now seen corresponding path program 1 times [2018-02-04 19:00:58,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:00:58,090 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:00:58,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:58,091 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:00:58,091 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:00:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:00:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:00:58,137 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:00:58,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:00:58 BoogieIcfgContainer [2018-02-04 19:00:58,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:00:58,179 INFO L168 Benchmark]: Toolchain (without parser) took 140733.02 ms. Allocated memory was 406.8 MB in the beginning and 990.9 MB in the end (delta: 584.1 MB). Free memory was 363.5 MB in the beginning and 482.2 MB in the end (delta: -118.6 MB). Peak memory consumption was 465.4 MB. Max. memory is 5.3 GB. [2018-02-04 19:00:58,180 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:00:58,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.56 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 350.3 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:00:58,181 INFO L168 Benchmark]: Boogie Preprocessor took 26.22 ms. Allocated memory is still 406.8 MB. Free memory was 350.3 MB in the beginning and 347.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:00:58,181 INFO L168 Benchmark]: RCFGBuilder took 253.71 ms. Allocated memory is still 406.8 MB. Free memory was 347.7 MB in the beginning and 325.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:00:58,181 INFO L168 Benchmark]: TraceAbstraction took 140289.48 ms. Allocated memory was 406.8 MB in the beginning and 990.9 MB in the end (delta: 584.1 MB). Free memory was 322.4 MB in the beginning and 482.2 MB in the end (delta: -159.7 MB). Peak memory consumption was 424.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:00:58,182 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 406.8 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.56 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 350.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.22 ms. Allocated memory is still 406.8 MB. Free memory was 350.3 MB in the beginning and 347.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 253.71 ms. Allocated memory is still 406.8 MB. Free memory was 347.7 MB in the beginning and 325.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 140289.48 ms. Allocated memory was 406.8 MB in the beginning and 990.9 MB in the end (delta: 584.1 MB). Free memory was 322.4 MB in the beginning and 482.2 MB in the end (delta: -159.7 MB). Peak memory consumption was 424.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1478] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] RET return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] [L1467] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={42:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND FALSE !(!array) [L1469] i=0 VAL [array={42:0}, i=0, len=10] [L1469] COND TRUE i=0 VAL [\old(len)=10, array={42:0}, array={42:0}, i=1, j=0, len=10, p={0:0}] [L1451] EXPR, FCALL array[j] VAL [\old(len)=10, array={42:0}, array={42:0}, array[j]={43:0}, i=1, j=0, len=10, p={0:0}] [L1451] FCALL free(array[j]) VAL [\old(len)=10, array={42:0}, array={42:0}, array[j]={43:0}, i=1, j=0, len=10, p={0:0}] [L1450] j-- VAL [\old(len)=10, array={42:0}, array={42:0}, i=1, j=-1, len=10, p={0:0}] [L1450] COND FALSE !(j>=0) VAL [\old(len)=10, array={42:0}, array={42:0}, i=1, j=-1, len=10, p={0:0}] [L1454] RET return - -3; VAL [\old(len)=10, \result=3, array={42:0}, array={42:0}, i=1, j=-1, len=10, p={0:0}] [L1472] alloc_unsafe_17(array, len) VAL [alloc_unsafe_17(array, len)=3, array={42:0}, i=10, len=10] [L1473] CALL free_17(array, len) VAL [\old(len)=10, array={42:0}] [L1458] int i; [L1459] i=0 VAL [\old(len)=10, array={42:0}, array={42:0}, i=0, len=10] [L1459] COND TRUE i