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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:00:35,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:00:35,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:00:35,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:00:35,188 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:00:35,188 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:00:35,189 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:00:35,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:00:35,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:00:35,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:00:35,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:00:35,193 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:00:35,194 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:00:35,195 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:00:35,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:00:35,198 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:00:35,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:00:35,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:00:35,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:00:35,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:00:35,207 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:00:35,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:00:35,208 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:00:35,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:00:35,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:00:35,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:00:35,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:00:35,212 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:00:35,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:00:35,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:00:35,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:00:35,213 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 16:00:35,223 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:00:35,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:00:35,224 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:00:35,224 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:00:35,224 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:00:35,225 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:00:35,225 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:00:35,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:00:35,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:00:35,226 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:00:35,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:00:35,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:00:35,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:00:35,227 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:00:35,227 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:00:35,227 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:00:35,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:00:35,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:00:35,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:00:35,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:00:35,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:00:35,228 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:00:35,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:00:35,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:00:35,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:00:35,229 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:00:35,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:00:35,229 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:00:35,230 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:00:35,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:00:35,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:00:35,230 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:00:35,230 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:00:35,231 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:00:35,231 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:00:35,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:00:35,279 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:00:35,283 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:00:35,284 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:00:35,285 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:00:35,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-24 16:00:35,482 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:00:35,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:00:35,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:00:35,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:00:35,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:00:35,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142f1c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35, skipping insertion in model container [2018-01-24 16:00:35,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,523 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:00:35,576 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:00:35,686 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:00:35,703 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:00:35,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35 WrapperNode [2018-01-24 16:00:35,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:00:35,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:00:35,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:00:35,711 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:00:35,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,742 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (1/1) ... [2018-01-24 16:00:35,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:00:35,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:00:35,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:00:35,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:00:35,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (1/1) ... No working directory specified, using /storage/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-01-24 16:00:35,797 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:00:35,797 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:00:35,797 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 16:00:35,797 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 16:00:35,798 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 16:00:35,798 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 16:00:35,799 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:00:35,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:00:35,799 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:00:35,985 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:00:35,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:00:35 BoogieIcfgContainer [2018-01-24 16:00:35,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:00:35,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:00:35,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:00:35,988 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:00:35,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:00:35" (1/3) ... [2018-01-24 16:00:35,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f32ec5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:00:35, skipping insertion in model container [2018-01-24 16:00:35,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:00:35" (2/3) ... [2018-01-24 16:00:35,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f32ec5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:00:35, skipping insertion in model container [2018-01-24 16:00:35,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:00:35" (3/3) ... [2018-01-24 16:00:35,991 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-24 16:00:35,997 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:00:36,005 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 16:00:36,050 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:00:36,050 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:00:36,051 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:00:36,051 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:00:36,051 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:00:36,051 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:00:36,051 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:00:36,051 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:00:36,052 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:00:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 16:00:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 16:00:36,078 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:36,079 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:36,079 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:36,083 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-01-24 16:00:36,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:36,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:36,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:36,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:36,133 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:36,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:36,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:36,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:00:36,262 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:36,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:00:36,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:00:36,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:00:36,282 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 16:00:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:36,467 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-01-24 16:00:36,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:00:36,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 16:00:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:36,477 INFO L225 Difference]: With dead ends: 95 [2018-01-24 16:00:36,477 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 16:00:36,481 INFO L525 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-01-24 16:00:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 16:00:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-01-24 16:00:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 16:00:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-01-24 16:00:36,522 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-01-24 16:00:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:36,522 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-01-24 16:00:36,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:00:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-01-24 16:00:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:00:36,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:36,525 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:36,525 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:36,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-01-24 16:00:36,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:36,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:36,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:36,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:36,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:36,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:36,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:36,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:00:36,624 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:36,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:00:36,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:00:36,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:00:36,627 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-01-24 16:00:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:36,760 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-01-24 16:00:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:00:36,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 16:00:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:36,763 INFO L225 Difference]: With dead ends: 75 [2018-01-24 16:00:36,763 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 16:00:36,764 INFO L525 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-01-24 16:00:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 16:00:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-01-24 16:00:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 16:00:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 16:00:36,772 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-24 16:00:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:36,773 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 16:00:36,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:00:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 16:00:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:00:36,774 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:36,774 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:36,774 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-01-24 16:00:36,775 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:36,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:36,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:36,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:36,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:36,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:36,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:36,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:00:36,835 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:36,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:00:36,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:00:36,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:00:36,836 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-24 16:00:36,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:36,869 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 16:00:36,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:00:36,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 16:00:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:36,871 INFO L225 Difference]: With dead ends: 70 [2018-01-24 16:00:36,871 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 16:00:36,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-24 16:00:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 16:00:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-24 16:00:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 16:00:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-01-24 16:00:36,879 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-01-24 16:00:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:36,879 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-01-24 16:00:36,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:00:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-01-24 16:00:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:00:36,880 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:36,880 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:36,880 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-01-24 16:00:36,880 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:36,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:36,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:36,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:36,882 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:36,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:36,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:36,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:00:36,923 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:36,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:00:36,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:00:36,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:00:36,923 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-01-24 16:00:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:36,991 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-01-24 16:00:36,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:00:36,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 16:00:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:36,992 INFO L225 Difference]: With dead ends: 71 [2018-01-24 16:00:36,993 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 16:00:36,993 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-24 16:00:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 16:00:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-01-24 16:00:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 16:00:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-01-24 16:00:37,003 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-01-24 16:00:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:37,003 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-01-24 16:00:37,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:00:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-01-24 16:00:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:00:37,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:37,004 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:37,005 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:37,005 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-01-24 16:00:37,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:37,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:37,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:37,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:37,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:37,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:00:37,066 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:37,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:00:37,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:00:37,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:00:37,067 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-01-24 16:00:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:37,097 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-24 16:00:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:00:37,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 16:00:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:37,098 INFO L225 Difference]: With dead ends: 80 [2018-01-24 16:00:37,098 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 16:00:37,099 INFO L525 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-01-24 16:00:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 16:00:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 16:00:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 16:00:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-24 16:00:37,104 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-01-24 16:00:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:37,104 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-24 16:00:37,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:00:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-24 16:00:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:00:37,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:37,105 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:37,105 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:37,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-01-24 16:00:37,105 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:37,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:37,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,107 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:37,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:37,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:37,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:00:37,172 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:37,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:00:37,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:00:37,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:00:37,173 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-01-24 16:00:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:37,246 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-24 16:00:37,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:00:37,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 16:00:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:37,248 INFO L225 Difference]: With dead ends: 45 [2018-01-24 16:00:37,248 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 16:00:37,248 INFO L525 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-01-24 16:00:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 16:00:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 16:00:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 16:00:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 16:00:37,254 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-01-24 16:00:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:37,255 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 16:00:37,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:00:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 16:00:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:00:37,256 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:37,256 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:37,257 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-01-24 16:00:37,257 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:37,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:37,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,259 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:37,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:37,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:37,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:00:37,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:37,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:00:37,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:00:37,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:00:37,323 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 16:00:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:37,458 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 16:00:37,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:00:37,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 16:00:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:37,459 INFO L225 Difference]: With dead ends: 52 [2018-01-24 16:00:37,459 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:00:37,459 INFO L525 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-01-24 16:00:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:00:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-24 16:00:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 16:00:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-24 16:00:37,466 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-01-24 16:00:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:37,466 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-24 16:00:37,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:00:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-24 16:00:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:00:37,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:37,467 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:37,467 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-01-24 16:00:37,467 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:37,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:37,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,469 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:37,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:37,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:37,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:00:37,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:37,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:00:37,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:00:37,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:00:37,522 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-01-24 16:00:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:37,551 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-24 16:00:37,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:00:37,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 16:00:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:37,553 INFO L225 Difference]: With dead ends: 94 [2018-01-24 16:00:37,553 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 16:00:37,554 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:00:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 16:00:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-01-24 16:00:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:00:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-24 16:00:37,562 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-01-24 16:00:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:37,562 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-24 16:00:37,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:00:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-24 16:00:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:00:37,563 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:37,564 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:37,564 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-01-24 16:00:37,564 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:37,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:37,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:37,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 16:00:37,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:00:37,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:00:37,636 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:37,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:00:37,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:00:37,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:00:37,637 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-24 16:00:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:37,674 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-24 16:00:37,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:00:37,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 16:00:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:37,675 INFO L225 Difference]: With dead ends: 106 [2018-01-24 16:00:37,675 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 16:00:37,676 INFO L525 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-01-24 16:00:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 16:00:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-01-24 16:00:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:00:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 16:00:37,716 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-01-24 16:00:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:37,717 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 16:00:37,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:00:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 16:00:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:00:37,718 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:37,718 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:37,718 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-01-24 16:00:37,718 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:37,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:37,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:37,719 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:37,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:37,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:00:37,871 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:00:37,871 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 16:00:37,873 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [39], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-24 16:00:37,917 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:00:37,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:00:38,312 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 16:00:38,313 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 16:00:38,319 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 16:00:38,529 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-24 16:00:38,530 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 16:00:38,857 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 16:00:38,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:00:38,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-24 16:00:38,859 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:00:38,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 16:00:38,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 16:00:38,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:00:38,860 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 16 states. [2018-01-24 16:00:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:00:41,707 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2018-01-24 16:00:41,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:00:41,707 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-01-24 16:00:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:00:41,709 INFO L225 Difference]: With dead ends: 107 [2018-01-24 16:00:41,710 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 16:00:41,717 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-01-24 16:00:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 16:00:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2018-01-24 16:00:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 16:00:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-24 16:00:41,727 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2018-01-24 16:00:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:00:41,728 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-24 16:00:41,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 16:00:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-24 16:00:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:00:41,729 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:00:41,729 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:00:41,730 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 16:00:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-01-24 16:00:41,731 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:00:41,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:41,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:41,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:00:41,733 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:00:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:41,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:00:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:42,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:00:42,161 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:00:42,162 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 16:00:42,162 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [40], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-24 16:00:42,163 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:00:42,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:00:42,305 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:00:42,305 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 16:00:42,308 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:00:42,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:00:42,308 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:00:42,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:42,320 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:00:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:42,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:00:42,419 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-01-24 16:00:42,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:42,444 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-01-24 16:00:42,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:42,453 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-01-24 16:00:42,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:42,496 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-01-24 16:00:42,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:42,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:00:42,522 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 16:00:42,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:42,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:42,972 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 54 treesize of output 67 [2018-01-24 16:00:42,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:43,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:43,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:43,057 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 45 treesize of output 39 [2018-01-24 16:00:43,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:43,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:43,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:43,126 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 46 treesize of output 40 [2018-01-24 16:00:43,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:43,187 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 39 treesize of output 38 [2018-01-24 16:00:43,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:43,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 16:00:43,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 16:00:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:43,342 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:00:44,095 WARN L146 SmtUtils]: Spent 609ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-24 16:00:44,117 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 16:00:47,007 WARN L146 SmtUtils]: Spent 2758ms on a formula simplification. DAG size of input: 84 DAG size of output 58 [2018-01-24 16:00:47,013 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-24 16:00:47,022 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-24 16:00:47,062 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 100 [2018-01-24 16:00:49,514 WARN L143 SmtUtils]: Spent 1386ms on a formula simplification that was a NOOP. DAG size: 104 [2018-01-24 16:00:49,535 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 100 [2018-01-24 16:00:49,854 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 100 [2018-01-24 16:00:50,650 WARN L143 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 16:00:51,140 WARN L143 SmtUtils]: Spent 206ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 16:00:51,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 16:00:51,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:51,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-24 16:00:51,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 16:00:51,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:51,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:00:51,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 16:00:51,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:51,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:00:51,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 16:00:53,910 WARN L143 SmtUtils]: Spent 236ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-24 16:00:55,211 WARN L143 SmtUtils]: Spent 299ms on a formula simplification that was a NOOP. DAG size: 51 [2018-01-24 16:00:55,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 16:00:55,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:55,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 16:00:55,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:55,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 16:00:55,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 16:00:55,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:55,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:00:55,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:00:55,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 16:00:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:55,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:00:55,969 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:00:55,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:00:55,979 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:00:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:00:56,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:00:56,040 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-01-24 16:00:56,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:56,066 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-01-24 16:00:56,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:56,118 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-01-24 16:00:56,118 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:56,120 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-01-24 16:00:56,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:56,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:00:56,137 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 16:00:56,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:56,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:56,568 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 54 treesize of output 48 [2018-01-24 16:00:56,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:56,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:56,656 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 41 treesize of output 50 [2018-01-24 16:00:56,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:56,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:56,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:00:56,746 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 45 treesize of output 39 [2018-01-24 16:00:56,746 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:56,794 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 39 treesize of output 38 [2018-01-24 16:00:56,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:00:56,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 16:00:56,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 16:00:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:00:57,064 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:00:58,229 WARN L143 SmtUtils]: Spent 407ms on a formula simplification that was a NOOP. DAG size: 46 [2018-01-24 16:00:58,253 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2018-01-24 16:01:01,763 WARN L143 SmtUtils]: Spent 1944ms on a formula simplification that was a NOOP. DAG size: 117 [2018-01-24 16:01:01,777 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2018-01-24 16:01:01,835 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2018-01-24 16:01:01,897 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 6480 conjuctions. This might take some time... [2018-01-24 16:01:04,337 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 6480 conjuctions. [2018-01-24 16:01:06,024 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6480 Received shutdown request... [2018-01-24 16:01:34,688 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:01:34,688 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:01:34,692 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:01:34,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:01:34 BoogieIcfgContainer [2018-01-24 16:01:34,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:01:34,694 INFO L168 Benchmark]: Toolchain (without parser) took 59211.06 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 265.2 MB in the beginning and 336.8 MB in the end (delta: -71.6 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 16:01:34,694 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:01:34,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.71 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 251.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:01:34,695 INFO L168 Benchmark]: Boogie Preprocessor took 36.07 ms. Allocated memory is still 306.2 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:01:34,695 INFO L168 Benchmark]: RCFGBuilder took 238.56 ms. Allocated memory is still 306.2 MB. Free memory was 249.2 MB in the beginning and 232.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:01:34,695 INFO L168 Benchmark]: TraceAbstraction took 58706.52 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 232.7 MB in the beginning and 336.8 MB in the end (delta: -104.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 16:01:34,697 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.18 ms. Allocated memory is still 306.2 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.71 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 251.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.07 ms. Allocated memory is still 306.2 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 238.56 ms. Allocated memory is still 306.2 MB. Free memory was 249.2 MB in the beginning and 232.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58706.52 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 232.7 MB in the beginning and 336.8 MB in the end (delta: -104.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 133 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.356832 RENAME_VARIABLES(MILLISECONDS) : 0.163157 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.307758 PROJECTAWAY(MILLISECONDS) : 0.058449 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.150491 DISJOIN(MILLISECONDS) : 0.971420 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.200210 ADD_EQUALITY(MILLISECONDS) : 0.031314 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021184 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 77 #PROJECTAWAY : 73 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 145 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.408195 RENAME_VARIABLES(MILLISECONDS) : 0.084180 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.172508 PROJECTAWAY(MILLISECONDS) : 0.055832 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.054765 DISJOIN(MILLISECONDS) : 0.559935 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.103584 ADD_EQUALITY(MILLISECONDS) : 0.018309 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005719 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 78 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 58.6s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 445 SDtfs, 410 SDslu, 1201 SDs, 0 SdLazy, 319 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8761463844797178 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 5.296296296296297 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 131 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 11868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 8/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-01-34-708.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-01-34-708.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-01-34-708.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-01-34-708.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-01-34-708.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-01-34-708.csv Completed graceful shutdown