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_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:17:07,236 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:17:07,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:17:07,248 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:17:07,249 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:17:07,249 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:17:07,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:17:07,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:17:07,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:17:07,253 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:17:07,254 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:17:07,254 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:17:07,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:17:07,256 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:17:07,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:17:07,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:17:07,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:17:07,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:17:07,263 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:17:07,264 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:17:07,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:17:07,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:17:07,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:17:07,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:17:07,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:17:07,269 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:17:07,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:17:07,270 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:17:07,270 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:17:07,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:17:07,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:17:07,271 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:17:07,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:17:07,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:17:07,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:17:07,283 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:17:07,283 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:17:07,283 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:17:07,283 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:17:07,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:17:07,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:17:07,284 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:17:07,284 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:17:07,284 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:17:07,284 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:17:07,284 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:17:07,284 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:17:07,284 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:17:07,285 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:17:07,285 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:17:07,285 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:17:07,285 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:17:07,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:17:07,285 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:17:07,286 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:17:07,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:17:07,286 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:17:07,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:17:07,321 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:17:07,324 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:17:07,325 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:17:07,325 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:17:07,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 04:17:07,478 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:17:07,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:17:07,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:07,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:17:07,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:17:07,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17832045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07, skipping insertion in model container [2018-02-04 04:17:07,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,506 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:07,543 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:17:07,638 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:07,655 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:17:07,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07 WrapperNode [2018-02-04 04:17:07,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:17:07,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:17:07,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:17:07,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:17:07,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... [2018-02-04 04:17:07,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:17:07,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:17:07,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:17:07,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:17:07,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:17:07,734 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:17:07,734 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:17:07,734 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:17:07,734 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-04 04:17:07,734 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-04 04:17:07,734 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:17:07,734 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:17:07,734 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:17:07,735 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:17:07,941 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:17:07,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:07 BoogieIcfgContainer [2018-02-04 04:17:07,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:17:07,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:17:07,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:17:07,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:17:07,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:17:07" (1/3) ... [2018-02-04 04:17:07,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df1db2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:07, skipping insertion in model container [2018-02-04 04:17:07,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:17:07" (2/3) ... [2018-02-04 04:17:07,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df1db2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:17:07, skipping insertion in model container [2018-02-04 04:17:07,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:17:07" (3/3) ... [2018-02-04 04:17:07,946 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-04 04:17:07,952 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:17:07,957 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 04:17:07,983 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:17:07,983 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:17:07,983 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:17:07,983 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:17:07,983 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:17:07,984 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:17:07,984 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:17:07,984 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:17:07,985 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:17:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 04:17:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:17:08,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:08,007 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 04:17:08,007 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:08,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-02-04 04:17:08,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:08,013 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:08,063 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,064 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:08,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:08,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:08,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:08,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:08,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:08,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:08,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:08,272 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-02-04 04:17:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:08,308 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-04 04:17:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:08,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 04:17:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:08,316 INFO L225 Difference]: With dead ends: 82 [2018-02-04 04:17:08,316 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 04:17:08,318 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 04:17:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 04:17:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-04 04:17:08,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 04:17:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 04:17:08,355 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-02-04 04:17:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:08,355 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 04:17:08,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 04:17:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 04:17:08,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:08,357 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 04:17:08,357 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-02-04 04:17:08,358 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:08,358 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:08,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,359 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:08,359 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:08,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:08,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:08,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:17:08,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:17:08,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:17:08,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:17:08,404 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-02-04 04:17:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:08,493 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 04:17:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:17:08,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 04:17:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:08,495 INFO L225 Difference]: With dead ends: 112 [2018-02-04 04:17:08,495 INFO L226 Difference]: Without dead ends: 107 [2018-02-04 04:17:08,496 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 04:17:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-04 04:17:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-02-04 04:17:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 04:17:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 04:17:08,504 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-02-04 04:17:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:08,504 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 04:17:08,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:17:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 04:17:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:17:08,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:08,505 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 04:17:08,505 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-02-04 04:17:08,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:08,506 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:08,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:08,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:08,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:08,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:08,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:08,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:08,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:08,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:08,567 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-02-04 04:17:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:08,711 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-04 04:17:08,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:08,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 04:17:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:08,713 INFO L225 Difference]: With dead ends: 76 [2018-02-04 04:17:08,714 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 04:17:08,714 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 04:17:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 04:17:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-04 04:17:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 04:17:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 04:17:08,720 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-02-04 04:17:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:08,720 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 04:17:08,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 04:17:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:17:08,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:08,722 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 04:17:08,722 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:08,722 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-02-04 04:17:08,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:08,722 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:08,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:08,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:08,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:08,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:08,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 04:17:08,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:17:08,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:17:08,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:08,934 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-04 04:17:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:09,132 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-04 04:17:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:17:09,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 04:17:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:09,134 INFO L225 Difference]: With dead ends: 80 [2018-02-04 04:17:09,134 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 04:17:09,134 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 04:17:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 04:17:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-04 04:17:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 04:17:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-04 04:17:09,141 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-02-04 04:17:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:09,141 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-04 04:17:09,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:17:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-04 04:17:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 04:17:09,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:09,142 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 04:17:09,142 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-02-04 04:17:09,142 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:09,142 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:09,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,144 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:09,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:09,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:09,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:09,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:17:09,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:09,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:09,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:09,205 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-02-04 04:17:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:09,238 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-04 04:17:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:09,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 04:17:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:09,239 INFO L225 Difference]: With dead ends: 77 [2018-02-04 04:17:09,239 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 04:17:09,239 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 04:17:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 04:17:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 04:17:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 04:17:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 04:17:09,243 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-02-04 04:17:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:09,243 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 04:17:09,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 04:17:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:17:09,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:09,244 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 04:17:09,244 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-02-04 04:17:09,244 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:09,244 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:09,245 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,246 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:09,246 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:09,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:09,468 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 04:17:09,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:09,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:09,470 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:09,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:09,554 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 04:17:09,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:09,570 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 04:17:09,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:09,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:09,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:09,863 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 04:17:09,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:09,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 04:17:09,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:17:09,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:17:09,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:17:09,865 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 19 states. [2018-02-04 04:17:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:10,310 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-04 04:17:10,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:17:10,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-02-04 04:17:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:10,311 INFO L225 Difference]: With dead ends: 82 [2018-02-04 04:17:10,311 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 04:17:10,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-02-04 04:17:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 04:17:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-02-04 04:17:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:17:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 04:17:10,315 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-02-04 04:17:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:10,315 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 04:17:10,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:17:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 04:17:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:17:10,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:10,315 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:10,316 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:10,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-02-04 04:17:10,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:10,316 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:10,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:10,317 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:10,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:10,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:10,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:10,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:10,485 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:10,501 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:17:10,502 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:10,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:10,540 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 04:17:10,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:10,550 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 04:17:10,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:10,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:10,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:17:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:10,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:10,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-02-04 04:17:10,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:17:10,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:17:10,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:17:10,716 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 23 states. [2018-02-04 04:17:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:10,967 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-02-04 04:17:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:17:10,968 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-02-04 04:17:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:10,968 INFO L225 Difference]: With dead ends: 81 [2018-02-04 04:17:10,968 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 04:17:10,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-02-04 04:17:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 04:17:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 04:17:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 04:17:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-04 04:17:10,972 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 27 [2018-02-04 04:17:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:10,972 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-04 04:17:10,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:17:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-04 04:17:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 04:17:10,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:10,973 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 04:17:10,973 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:10,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1811355495, now seen corresponding path program 1 times [2018-02-04 04:17:10,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:10,973 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:10,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:10,974 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:10,974 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:10,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 04:17:11,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:11,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:11,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:17:11,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:17:11,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:17:11,018 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2018-02-04 04:17:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,028 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-02-04 04:17:11,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:17:11,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 04:17:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,029 INFO L225 Difference]: With dead ends: 83 [2018-02-04 04:17:11,029 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 04:17:11,030 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 04:17:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 04:17:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-04 04:17:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 04:17:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-02-04 04:17:11,034 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 38 [2018-02-04 04:17:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,034 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-02-04 04:17:11,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:17:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-02-04 04:17:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 04:17:11,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,035 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:11,036 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542589, now seen corresponding path program 1 times [2018-02-04 04:17:11,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,036 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:17:11,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:17:11,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:17:11,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:17:11,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:17:11,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:17:11,080 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-02-04 04:17:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,171 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-02-04 04:17:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:17:11,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 04:17:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,172 INFO L225 Difference]: With dead ends: 123 [2018-02-04 04:17:11,172 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 04:17:11,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 04:17:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2018-02-04 04:17:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 04:17:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-02-04 04:17:11,177 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 39 [2018-02-04 04:17:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,178 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-02-04 04:17:11,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:17:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-02-04 04:17:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 04:17:11,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,179 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:17:11,179 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 1 times [2018-02-04 04:17:11,179 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,179 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,180 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:11,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:11,224 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:11,225 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:17:11,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:11,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-02-04 04:17:11,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:17:11,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:17:11,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:11,266 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 9 states. [2018-02-04 04:17:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,292 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-04 04:17:11,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:17:11,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 04:17:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,297 INFO L225 Difference]: With dead ends: 112 [2018-02-04 04:17:11,297 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 04:17:11,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 04:17:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-04 04:17:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 04:17:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-02-04 04:17:11,302 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-02-04 04:17:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,302 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-02-04 04:17:11,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:17:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-02-04 04:17:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:17:11,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,304 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, 1, 1, 1, 1, 1] [2018-02-04 04:17:11,304 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 2 times [2018-02-04 04:17:11,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,304 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,348 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 04:17:11,349 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:11,349 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:11,350 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:11,359 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 04:17:11,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:11,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:11,380 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 04:17:11,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:17:11,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 04:17:11,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 04:17:11,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 04:17:11,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:17:11,381 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 9 states. [2018-02-04 04:17:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,475 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2018-02-04 04:17:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:17:11,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 04:17:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,476 INFO L225 Difference]: With dead ends: 141 [2018-02-04 04:17:11,476 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 04:17:11,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 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 04:17:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 04:17:11,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2018-02-04 04:17:11,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 04:17:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-04 04:17:11,499 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 43 [2018-02-04 04:17:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,500 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-04 04:17:11,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 04:17:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-04 04:17:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 04:17:11,501 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,501 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 04:17:11,501 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash 491258907, now seen corresponding path program 1 times [2018-02-04 04:17:11,502 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,502 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,503 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:11,503 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,570 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 04:17:11,570 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:11,570 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:11,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:11,620 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 04:17:11,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:11,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-04 04:17:11,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:17:11,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:17:11,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:17:11,621 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 13 states. [2018-02-04 04:17:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,674 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2018-02-04 04:17:11,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 04:17:11,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 04:17:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,675 INFO L225 Difference]: With dead ends: 119 [2018-02-04 04:17:11,675 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 04:17:11,676 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 04:17:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 04:17:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 04:17:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 04:17:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-02-04 04:17:11,679 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 48 [2018-02-04 04:17:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,679 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-02-04 04:17:11,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:17:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-02-04 04:17:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 04:17:11,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,680 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 04:17:11,680 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash 10320228, now seen corresponding path program 2 times [2018-02-04 04:17:11,680 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,681 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,682 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:11,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,725 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 04:17:11,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:11,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:11,726 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:11,739 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:17:11,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:11,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:11,780 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 04:17:11,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:11,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-04 04:17:11,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:17:11,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:17:11,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:17:11,781 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 15 states. [2018-02-04 04:17:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:11,809 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-02-04 04:17:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:17:11,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-04 04:17:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:11,810 INFO L225 Difference]: With dead ends: 123 [2018-02-04 04:17:11,811 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 04:17:11,811 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 04:17:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 04:17:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-02-04 04:17:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 04:17:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-02-04 04:17:11,814 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 52 [2018-02-04 04:17:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:11,814 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-02-04 04:17:11,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:17:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-02-04 04:17:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 04:17:11,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:11,815 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 04:17:11,815 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1506467283, now seen corresponding path program 3 times [2018-02-04 04:17:11,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:11,815 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:11,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,816 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:11,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:11,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:11,865 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 04:17:11,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:11,866 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:11,866 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:17:11,882 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 04:17:11,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:11,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:11,903 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 04:17:11,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:11,917 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 04:17:11,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:11,919 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 04:17:11,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:11,933 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 04:17:11,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:11,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:17:11,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 04:17:12,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:12,097 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:12,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-02-04 04:17:12,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:12,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:12,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:12,119 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 04:17:12,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:12,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:12,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:12,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-02-04 04:17:12,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:12,159 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 04:17:12,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:12,174 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 04:17:12,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 04:17:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 04:17:12,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:12,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2018-02-04 04:17:12,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:17:12,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:17:12,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=1, NotChecked=0, Total=420 [2018-02-04 04:17:12,253 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 21 states. [2018-02-04 04:17:33,884 WARN L143 SmtUtils]: Spent 14242ms on a formula simplification that was a NOOP. DAG size: 52 [2018-02-04 04:17:58,195 WARN L146 SmtUtils]: Spent 24257ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 04:17:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:58,537 INFO L93 Difference]: Finished difference Result 197 states and 216 transitions. [2018-02-04 04:17:58,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:17:58,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-02-04 04:17:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:58,538 INFO L225 Difference]: With dead ends: 197 [2018-02-04 04:17:58,538 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 04:17:58,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=227, Invalid=1252, Unknown=3, NotChecked=0, Total=1482 [2018-02-04 04:17:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 04:17:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-02-04 04:17:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-04 04:17:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2018-02-04 04:17:58,544 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 56 [2018-02-04 04:17:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:58,544 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2018-02-04 04:17:58,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:17:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2018-02-04 04:17:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 04:17:58,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:58,545 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 04:17:58,545 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash -221692299, now seen corresponding path program 1 times [2018-02-04 04:17:58,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:58,545 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:58,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:58,546 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:58,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:58,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:58,642 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 04:17:58,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:58,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:58,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:58,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:58,737 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 04:17:58,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:58,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-04 04:17:58,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 04:17:58,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 04:17:58,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:17:58,737 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand 19 states. [2018-02-04 04:17:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:58,791 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2018-02-04 04:17:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 04:17:58,796 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-04 04:17:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:58,797 INFO L225 Difference]: With dead ends: 146 [2018-02-04 04:17:58,797 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 04:17:58,798 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 04:17:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 04:17:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-04 04:17:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-04 04:17:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2018-02-04 04:17:58,803 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 60 [2018-02-04 04:17:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:58,803 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2018-02-04 04:17:58,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 04:17:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2018-02-04 04:17:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 04:17:58,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:58,804 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 04:17:58,804 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1676938814, now seen corresponding path program 2 times [2018-02-04 04:17:58,804 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:58,804 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:58,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:58,805 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:17:58,805 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:58,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:58,870 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 04:17:58,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:58,871 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:58,871 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 04:17:58,881 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 04:17:58,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:58,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:58,981 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 04:17:58,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:58,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 04:17:58,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 04:17:58,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 04:17:58,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:17:58,982 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand 21 states. [2018-02-04 04:17:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:17:59,057 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2018-02-04 04:17:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:17:59,063 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 04:17:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:17:59,064 INFO L225 Difference]: With dead ends: 150 [2018-02-04 04:17:59,064 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 04:17:59,064 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 04:17:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 04:17:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-02-04 04:17:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 04:17:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2018-02-04 04:17:59,068 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 64 [2018-02-04 04:17:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:17:59,069 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2018-02-04 04:17:59,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 04:17:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2018-02-04 04:17:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 04:17:59,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:17:59,069 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 04:17:59,070 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:17:59,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1607478905, now seen corresponding path program 3 times [2018-02-04 04:17:59,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:17:59,070 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:17:59,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:59,071 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:17:59,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:17:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:17:59,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:17:59,192 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 04:17:59,192 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:17:59,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:17:59,193 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 04:17:59,209 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-04 04:17:59,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 04:17:59,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:17:59,216 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 04:17:59,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:59,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:17:59,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 04:17:59,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:59,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 04:17:59,336 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 17 treesize of output 21 [2018-02-04 04:17:59,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:17:59,342 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 04:17:59,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 04:17:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-04 04:17:59,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:17:59,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2018-02-04 04:17:59,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:17:59,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:17:59,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:17:59,371 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 22 states. [2018-02-04 04:18:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:00,093 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2018-02-04 04:18:00,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:18:00,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-04 04:18:00,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:00,094 INFO L225 Difference]: With dead ends: 193 [2018-02-04 04:18:00,094 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 04:18:00,094 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1413, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:18:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 04:18:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146. [2018-02-04 04:18:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-04 04:18:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-02-04 04:18:00,098 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 68 [2018-02-04 04:18:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:00,099 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-02-04 04:18:00,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:18:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-02-04 04:18:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 04:18:00,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:00,100 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] [2018-02-04 04:18:00,100 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times [2018-02-04 04:18:00,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:00,100 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:00,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:00,101 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 04:18:00,101 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:00,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:00,171 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 04:18:00,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:00,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:18:00,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:18:00,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:18:00,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:18:00,172 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states. [2018-02-04 04:18:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:00,193 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-04 04:18:00,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:18:00,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-04 04:18:00,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:00,194 INFO L225 Difference]: With dead ends: 155 [2018-02-04 04:18:00,194 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 04:18:00,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:18:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 04:18:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-02-04 04:18:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 04:18:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-02-04 04:18:00,197 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73 [2018-02-04 04:18:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:00,197 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-02-04 04:18:00,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:18:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-02-04 04:18:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 04:18:00,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:00,198 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 04:18:00,198 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:00,198 INFO L82 PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times [2018-02-04 04:18:00,199 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:00,199 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:00,199 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:00,199 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:00,200 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:00,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:00,366 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 04:18:00,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:18:00,366 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:18:00,367 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:00,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:18:00,411 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 04:18:00,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:00,426 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 04:18:00,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:00,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 04:18:00,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-04 04:18:00,707 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 04:18:00,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:18:00,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-04 04:18:00,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 04:18:00,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 04:18:00,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 04:18:00,708 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 23 states. [2018-02-04 04:18:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:01,449 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2018-02-04 04:18:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:18:01,449 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-02-04 04:18:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:01,450 INFO L225 Difference]: With dead ends: 169 [2018-02-04 04:18:01,450 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 04:18:01,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 04:18:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 04:18:01,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2018-02-04 04:18:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-04 04:18:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-02-04 04:18:01,454 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 81 [2018-02-04 04:18:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:01,463 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-02-04 04:18:01,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 04:18:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-02-04 04:18:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-04 04:18:01,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:01,464 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 04:18:01,464 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:01,464 INFO L82 PathProgramCache]: Analyzing trace with hash -600320339, now seen corresponding path program 1 times [2018-02-04 04:18:01,465 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:01,465 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:01,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:01,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:01,466 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:01,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:01,509 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:18:01,513 INFO L168 Benchmark]: Toolchain (without parser) took 54034.47 ms. Allocated memory was 400.0 MB in the beginning and 754.5 MB in the end (delta: 354.4 MB). Free memory was 356.7 MB in the beginning and 619.7 MB in the end (delta: -263.0 MB). Peak memory consumption was 91.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:01,516 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 400.0 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:18:01,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.28 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:01,517 INFO L168 Benchmark]: Boogie Preprocessor took 27.71 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 340.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:01,517 INFO L168 Benchmark]: RCFGBuilder took 251.18 ms. Allocated memory is still 400.0 MB. Free memory was 340.9 MB in the beginning and 315.5 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:01,517 INFO L168 Benchmark]: TraceAbstraction took 53571.20 ms. Allocated memory was 400.0 MB in the beginning and 754.5 MB in the end (delta: 354.4 MB). Free memory was 315.5 MB in the beginning and 619.7 MB in the end (delta: -304.3 MB). Peak memory consumption was 50.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:01,518 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.17 ms. Allocated memory is still 400.0 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 181.28 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.71 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 340.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 251.18 ms. Allocated memory is still 400.0 MB. Free memory was 340.9 MB in the beginning and 315.5 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53571.20 ms. Allocated memory was 400.0 MB in the beginning and 754.5 MB in the end (delta: 354.4 MB). Free memory was 315.5 MB in the beginning and 619.7 MB in the end (delta: -304.3 MB). Peak memory consumption was 50.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-18-01-528.csv [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Exception during sending of exit command (exit): Broken pipe Received shutdown request...