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_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:03:29,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:03:29,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:03:29,705 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:03:29,706 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:03:29,707 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:03:29,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:03:29,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:03:29,711 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:03:29,712 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:03:29,713 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:03:29,713 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:03:29,714 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:03:29,715 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:03:29,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:03:29,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:03:29,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:03:29,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:03:29,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:03:29,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:03:29,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:03:29,727 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:03:29,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:03:29,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:03:29,729 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:03:29,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:03:29,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:03:29,732 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:03:29,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:03:29,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:03:29,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:03:29,733 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_precise.epf [2018-01-25 00:03:29,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:03:29,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:03:29,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:03:29,743 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:03:29,744 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:03:29,744 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:03:29,744 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:03:29,744 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:03:29,745 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:03:29,745 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:03:29,745 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:03:29,745 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:03:29,745 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:03:29,746 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:03:29,746 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:03:29,746 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:03:29,746 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:03:29,746 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:03:29,746 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:03:29,747 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:03:29,747 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:03:29,747 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:03:29,747 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:03:29,747 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:03:29,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:03:29,748 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:03:29,748 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:03:29,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:03:29,748 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:03:29,748 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:03:29,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:03:29,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:03:29,749 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:03:29,749 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:03:29,750 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:03:29,750 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:03:29,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:03:29,797 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:03:29,800 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:03:29,802 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:03:29,802 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:03:29,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-25 00:03:29,983 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:03:29,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:03:29,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:03:29,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:03:29,995 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:03:29,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:03:29" (1/1) ... [2018-01-25 00:03:29,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:29, skipping insertion in model container [2018-01-25 00:03:29,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:03:29" (1/1) ... [2018-01-25 00:03:30,012 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:03:30,059 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:03:30,180 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:03:30,199 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:03:30,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30 WrapperNode [2018-01-25 00:03:30,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:03:30,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:03:30,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:03:30,209 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:03:30,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (1/1) ... [2018-01-25 00:03:30,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (1/1) ... [2018-01-25 00:03:30,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (1/1) ... [2018-01-25 00:03:30,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (1/1) ... [2018-01-25 00:03:30,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (1/1) ... [2018-01-25 00:03:30,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (1/1) ... [2018-01-25 00:03:30,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (1/1) ... [2018-01-25 00:03:30,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:03:30,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:03:30,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:03:30,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:03:30,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (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-25 00:03:30,293 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:03:30,293 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:03:30,293 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:03:30,293 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:03:30,293 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:03:30,293 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:03:30,294 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:03:30,295 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:03:30,295 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:03:30,475 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:03:30,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:03:30 BoogieIcfgContainer [2018-01-25 00:03:30,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:03:30,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:03:30,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:03:30,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:03:30,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:03:29" (1/3) ... [2018-01-25 00:03:30,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f552d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:03:30, skipping insertion in model container [2018-01-25 00:03:30,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:03:30" (2/3) ... [2018-01-25 00:03:30,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f552d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:03:30, skipping insertion in model container [2018-01-25 00:03:30,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:03:30" (3/3) ... [2018-01-25 00:03:30,483 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-25 00:03:30,489 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:03:30,495 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 00:03:30,539 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:03:30,540 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:03:30,540 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:03:30,540 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:03:30,540 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:03:30,540 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:03:30,540 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:03:30,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:03:30,541 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:03:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-25 00:03:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:03:30,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:30,573 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:03:30,573 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1647065445, now seen corresponding path program 1 times [2018-01-25 00:03:30,581 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:30,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:30,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:30,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:30,636 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:30,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:30,758 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-25 00:03:30,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:30,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:03:30,762 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:30,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:03:30,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:03:30,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:03:30,778 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-01-25 00:03:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:30,954 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-01-25 00:03:30,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:03:30,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 00:03:30,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:30,968 INFO L225 Difference]: With dead ends: 86 [2018-01-25 00:03:30,968 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 00:03:30,972 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-25 00:03:30,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 00:03:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-01-25 00:03:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 00:03:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-01-25 00:03:31,015 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-01-25 00:03:31,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:31,016 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-01-25 00:03:31,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:03:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-01-25 00:03:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:03:31,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:31,018 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-25 00:03:31,018 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1810172163, now seen corresponding path program 1 times [2018-01-25 00:03:31,018 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:31,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,021 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:31,021 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:31,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:31,126 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-25 00:03:31,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:31,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:03:31,126 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:31,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:03:31,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:03:31,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:03:31,129 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-01-25 00:03:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:31,208 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-01-25 00:03:31,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:03:31,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:03:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:31,210 INFO L225 Difference]: With dead ends: 80 [2018-01-25 00:03:31,210 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 00:03:31,211 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-25 00:03:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 00:03:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-01-25 00:03:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 00:03:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-25 00:03:31,222 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 19 [2018-01-25 00:03:31,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:31,222 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-25 00:03:31,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:03:31,223 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-25 00:03:31,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 00:03:31,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:31,224 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-25 00:03:31,224 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1893738511, now seen corresponding path program 1 times [2018-01-25 00:03:31,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:31,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:31,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:31,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:31,293 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-25 00:03:31,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:31,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:03:31,293 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:31,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:03:31,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:03:31,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:03:31,294 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-01-25 00:03:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:31,312 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-01-25 00:03:31,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:03:31,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 00:03:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:31,313 INFO L225 Difference]: With dead ends: 86 [2018-01-25 00:03:31,313 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 00:03:31,313 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-25 00:03:31,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 00:03:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 00:03:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 00:03:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-25 00:03:31,318 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-25 00:03:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:31,318 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-25 00:03:31,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:03:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-25 00:03:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 00:03:31,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:31,319 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-25 00:03:31,319 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:31,319 INFO L82 PathProgramCache]: Analyzing trace with hash 389514349, now seen corresponding path program 1 times [2018-01-25 00:03:31,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:31,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:31,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,321 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:31,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:31,390 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-25 00:03:31,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:31,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:03:31,390 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:31,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:03:31,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:03:31,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:03:31,391 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-01-25 00:03:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:31,497 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 00:03:31,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:03:31,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 00:03:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:31,499 INFO L225 Difference]: With dead ends: 50 [2018-01-25 00:03:31,499 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 00:03:31,500 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-25 00:03:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 00:03:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-25 00:03:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 00:03:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-25 00:03:31,507 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-01-25 00:03:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:31,507 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-25 00:03:31,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:03:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-25 00:03:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 00:03:31,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:31,508 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-25 00:03:31,508 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:31,508 INFO L82 PathProgramCache]: Analyzing trace with hash 389514350, now seen corresponding path program 1 times [2018-01-25 00:03:31,509 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:31,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:31,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:31,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:31,561 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-25 00:03:31,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:31,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 00:03:31,562 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:31,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:03:31,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:03:31,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:03:31,563 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-01-25 00:03:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:31,591 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-01-25 00:03:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:03:31,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 00:03:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:31,593 INFO L225 Difference]: With dead ends: 86 [2018-01-25 00:03:31,593 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 00:03:31,594 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-25 00:03:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 00:03:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-01-25 00:03:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 00:03:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-25 00:03:31,603 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-01-25 00:03:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:31,603 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-25 00:03:31,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:03:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-25 00:03:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:03:31,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:31,605 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-25 00:03:31,605 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1824781139, now seen corresponding path program 1 times [2018-01-25 00:03:31,605 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:31,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:31,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:31,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:31,663 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-25 00:03:31,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:03:31,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:03:31,664 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:31,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:03:31,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:03:31,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:03:31,665 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-01-25 00:03:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:31,690 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2018-01-25 00:03:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:03:31,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 00:03:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:31,691 INFO L225 Difference]: With dead ends: 98 [2018-01-25 00:03:31,691 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 00:03:31,692 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-25 00:03:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 00:03:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-01-25 00:03:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 00:03:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 00:03:31,701 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 26 [2018-01-25 00:03:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:31,701 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 00:03:31,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:03:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 00:03:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 00:03:31,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:31,703 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-25 00:03:31,703 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:31,703 INFO L82 PathProgramCache]: Analyzing trace with hash -85684427, now seen corresponding path program 1 times [2018-01-25 00:03:31,703 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:31,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:31,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:31,705 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:31,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:31,891 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-25 00:03:31,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:31,892 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:03:31,896 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 00:03:31,899 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [70], [72], [73], [74], [76], [77], [78], [79] [2018-01-25 00:03:31,952 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:03:31,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:03:33,443 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 00:03:33,445 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 00:03:33,479 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 00:03:34,318 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-25 00:03:34,318 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 00:03:34,640 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 00:03:34,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 00:03:34,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 21 [2018-01-25 00:03:34,641 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:03:34,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 00:03:34,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 00:03:34,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=159, Unknown=2, NotChecked=0, Total=210 [2018-01-25 00:03:34,643 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 15 states. [2018-01-25 00:03:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:03:42,897 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-01-25 00:03:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 00:03:42,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-25 00:03:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:03:42,916 INFO L225 Difference]: With dead ends: 108 [2018-01-25 00:03:42,916 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 00:03:42,917 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=293, Unknown=2, NotChecked=0, Total=380 [2018-01-25 00:03:42,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 00:03:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-01-25 00:03:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 00:03:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-01-25 00:03:42,927 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 28 [2018-01-25 00:03:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:03:42,927 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-01-25 00:03:42,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 00:03:42,928 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-01-25 00:03:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 00:03:42,929 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:03:42,929 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-25 00:03:42,929 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 00:03:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash -85684426, now seen corresponding path program 1 times [2018-01-25 00:03:42,930 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:03:42,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:42,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:42,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:03:42,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:03:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:42,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:03:43,311 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-25 00:03:43,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:43,312 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:03:43,312 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 00:03:43,312 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [41], [70], [72], [73], [74], [76], [77], [78], [79] [2018-01-25 00:03:43,313 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:03:43,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:03:44,102 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 00:03:44,103 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 00:03:44,114 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 00:03:44,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:44,114 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-25 00:03:44,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:44,121 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:03:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:44,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:03:44,247 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-25 00:03:44,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:44,274 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-25 00:03:44,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:44,276 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-25 00:03:44,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:44,293 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-25 00:03:44,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:44,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:03:44,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 00:03:44,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:44,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:44,579 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 52 treesize of output 46 [2018-01-25 00:03:44,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:44,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:44,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:44,621 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 47 treesize of output 60 [2018-01-25 00:03:44,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:44,701 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-25 00:03:44,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:44,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:44,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:44,740 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-25 00:03:44,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:44,781 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-25 00:03:44,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 00:03:44,934 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-25 00:03:44,934 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:03:45,748 WARN L146 SmtUtils]: Spent 699ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-25 00:03:45,766 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 00:03:48,069 WARN L146 SmtUtils]: Spent 2180ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-25 00:03:48,084 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:03:52,259 WARN L143 SmtUtils]: Spent 4070ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-25 00:03:52,267 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:03:52,281 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:03:52,430 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 34 treesize of output 28 [2018-01-25 00:03:52,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:52,443 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 28 treesize of output 31 [2018-01-25 00:03:52,462 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-25 00:03:52,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:52,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:03:52,482 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-25 00:03:52,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:52,495 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-25 00:03:52,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 00:03:52,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-01-25 00:03:52,974 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-25 00:03:52,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:52,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,010 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-25 00:03:53,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,035 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-25 00:03:53,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,058 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-25 00:03:53,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 00:03:53,147 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-25 00:03:53,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:03:53,168 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-25 00:03:53,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:03:53,172 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:03:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:03:53,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:03:53,217 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-25 00:03:53,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,232 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-25 00:03:53,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,234 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-25 00:03:53,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,248 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-25 00:03:53,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:03:53,268 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 00:03:53,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:53,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:53,367 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-25 00:03:53,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:53,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:53,425 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-25 00:03:53,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:53,470 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 45 treesize of output 48 [2018-01-25 00:03:53,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:53,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 00:03:53,519 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 44 treesize of output 38 [2018-01-25 00:03:53,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:03:53,557 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-25 00:03:53,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 00:03:53,621 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-25 00:03:53,621 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:03:53,703 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 00:03:56,197 WARN L146 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-25 00:03:56,209 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 00:04:00,586 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 73 DAG size of output 41 [2018-01-25 00:04:00,695 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-25 00:04:00,721 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-25 00:04:00,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:00,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:04:00,748 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-25 00:04:00,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:00,764 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-25 00:04:00,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:00,776 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-25 00:04:00,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 00:04:01,063 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-25 00:04:01,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:01,089 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-25 00:04:01,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:01,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-25 00:04:01,143 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-25 00:04:01,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 00:04:01,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 00:04:01,174 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-25 00:04:01,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 00:04:03,286 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ldv_malloc_#in~size| 4294967296))) (and (or (<= 4 .cse0) (forall ((v_entry_point_~len~7_BEFORE_CALL_15 Int)) (let ((.cse1 (* 4 v_entry_point_~len~7_BEFORE_CALL_15))) (let ((.cse2 (mod .cse1 4294967296))) (or (not (= |c_ldv_malloc_#in~size| .cse1)) (< 2147483647 .cse2) (< .cse2 4)))))) (or (forall ((v_prenex_41 Int)) (let ((.cse4 (* 4 v_prenex_41))) (let ((.cse3 (mod .cse4 4294967296))) (or (< .cse3 4) (< 2147483647 .cse3) (not (= |c_ldv_malloc_#in~size| .cse4)))))) (<= .cse0 2147483647)))) is different from true [2018-01-25 00:04:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-01-25 00:04:03,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 00:04:03,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 11] total 30 [2018-01-25 00:04:03,314 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 00:04:03,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 00:04:03,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 00:04:03,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=780, Unknown=5, NotChecked=56, Total=930 [2018-01-25 00:04:03,315 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 19 states. [2018-01-25 00:04:03,697 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-25 00:04:26,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 00:04:26,577 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:04:26,580 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:04:26,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:04:26 BoogieIcfgContainer [2018-01-25 00:04:26,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:04:26,581 INFO L168 Benchmark]: Toolchain (without parser) took 56597.42 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 773.3 MB). Free memory was 264.0 MB in the beginning and 477.7 MB in the end (delta: -213.6 MB). Peak memory consumption was 559.7 MB. Max. memory is 5.3 GB. [2018-01-25 00:04:26,582 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:04:26,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.02 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 251.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:04:26,582 INFO L168 Benchmark]: Boogie Preprocessor took 36.22 ms. Allocated memory is still 305.1 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:04:26,582 INFO L168 Benchmark]: RCFGBuilder took 231.02 ms. Allocated memory is still 305.1 MB. Free memory was 249.0 MB in the beginning and 232.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:04:26,583 INFO L168 Benchmark]: TraceAbstraction took 56102.89 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 773.3 MB). Free memory was 232.1 MB in the beginning and 477.7 MB in the end (delta: -245.6 MB). Peak memory consumption was 527.7 MB. Max. memory is 5.3 GB. [2018-01-25 00:04:26,584 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 305.1 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.02 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 251.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.22 ms. Allocated memory is still 305.1 MB. Free memory was 251.0 MB in the beginning and 249.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 231.02 ms. Allocated memory is still 305.1 MB. Free memory was 249.0 MB in the beginning and 232.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56102.89 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 773.3 MB). Free memory was 232.1 MB in the beginning and 477.7 MB in the end (delta: -245.6 MB). Peak memory consumption was 527.7 MB. 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 : 134 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 : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.221063 RENAME_VARIABLES(MILLISECONDS) : 0.106229 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.180272 PROJECTAWAY(MILLISECONDS) : 0.034148 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.112073 DISJOIN(MILLISECONDS) : 0.655875 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.221980 ADD_EQUALITY(MILLISECONDS) : 0.017994 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014405 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 76 #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 : 143 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 : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.212845 RENAME_VARIABLES(MILLISECONDS) : 0.047049 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.085287 PROJECTAWAY(MILLISECONDS) : 0.046734 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.032131 DISJOIN(MILLISECONDS) : 0.562475 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.059353 ADD_EQUALITY(MILLISECONDS) : 0.012883 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004281 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 77 #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: 1458]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 11 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 11 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 11 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 11 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 11 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 11 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 11 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 7 error locations. TIMEOUT Result, 56.0s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 32.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 326 SDtfs, 314 SDslu, 877 SDs, 0 SdLazy, 324 SolverSat, 61 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 25.7s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 196 GetRequests, 105 SyntacticMatches, 17 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 22.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8761463844797178 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 5.296296296296297 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 93 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 282 ConstructedInterpolants, 55 QuantifiedInterpolants, 119970 SizeOfPredicates, 18 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 12/40 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_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-04-26-592.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_00-04-26-592.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_00-04-26-592.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_00-04-26-592.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_00-04-26-592.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-04-26-592.csv Completed graceful shutdown