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_smtcomp.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 06:04:28,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:04:28,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:04:28,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:04:28,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:04:28,528 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:04:28,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:04:28,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:04:28,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:04:28,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:04:28,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:04:28,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:04:28,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:04:28,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:04:28,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:04:28,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:04:28,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:04:28,544 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:04:28,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:04:28,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:04:28,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:04:28,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:04:28,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:04:28,550 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:04:28,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:04:28,552 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:04:28,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:04:28,553 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:04:28,553 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:04:28,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:04:28,554 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:04:28,554 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_smtcomp.epf [2018-01-25 06:04:28,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:04:28,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:04:28,565 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:04:28,566 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:04:28,566 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:04:28,566 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:04:28,566 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:04:28,567 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:04:28,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:04:28,567 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:04:28,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:04:28,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:04:28,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:04:28,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:04:28,568 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:04:28,569 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:04:28,569 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:04:28,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:04:28,569 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:04:28,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:04:28,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:04:28,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:04:28,570 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:04:28,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:04:28,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:04:28,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:04:28,571 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:04:28,571 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:04:28,571 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:04:28,571 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:04:28,572 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:04:28,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:04:28,572 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:04:28,572 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:04:28,573 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:04:28,573 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:04:28,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:04:28,621 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:04:28,625 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:04:28,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:04:28,627 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:04:28,627 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 06:04:28,838 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:04:28,843 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:04:28,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:04:28,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:04:28,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:04:28,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:04:28" (1/1) ... [2018-01-25 06:04:28,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d3d535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:28, skipping insertion in model container [2018-01-25 06:04:28,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:04:28" (1/1) ... [2018-01-25 06:04:28,865 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:04:28,911 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:04:29,026 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:04:29,045 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:04:29,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29 WrapperNode [2018-01-25 06:04:29,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:04:29,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:04:29,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:04:29,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:04:29,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (1/1) ... [2018-01-25 06:04:29,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (1/1) ... [2018-01-25 06:04:29,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (1/1) ... [2018-01-25 06:04:29,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (1/1) ... [2018-01-25 06:04:29,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (1/1) ... [2018-01-25 06:04:29,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (1/1) ... [2018-01-25 06:04:29,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (1/1) ... [2018-01-25 06:04:29,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:04:29,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:04:29,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:04:29,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:04:29,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (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 06:04:29,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:04:29,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:04:29,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:04:29,136 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:04:29,136 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:04:29,136 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:04:29,136 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:04:29,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:04:29,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:04:29,136 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:04:29,136 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:04:29,136 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:04:29,137 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:04:29,137 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:04:29,137 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:04:29,137 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:04:29,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:04:29,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:04:29,308 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:04:29,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:04:29 BoogieIcfgContainer [2018-01-25 06:04:29,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:04:29,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:04:29,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:04:29,311 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:04:29,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:04:28" (1/3) ... [2018-01-25 06:04:29,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564e679a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:04:29, skipping insertion in model container [2018-01-25 06:04:29,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:04:29" (2/3) ... [2018-01-25 06:04:29,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564e679a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:04:29, skipping insertion in model container [2018-01-25 06:04:29,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:04:29" (3/3) ... [2018-01-25 06:04:29,314 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-25 06:04:29,320 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:04:29,327 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 06:04:29,369 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:04:29,369 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:04:29,369 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:04:29,369 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:04:29,369 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:04:29,369 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:04:29,370 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:04:29,370 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:04:29,371 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:04:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-25 06:04:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:04:29,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:04:29,398 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 06:04:29,398 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:04:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1647065445, now seen corresponding path program 1 times [2018-01-25 06:04:29,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:04:29,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:29,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:29,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:29,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:04:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:29,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:04:29,575 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 06:04:29,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:04:29,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:04:29,577 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:04:29,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:04:29,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:04:29,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:04:29,594 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-01-25 06:04:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:04:29,781 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-01-25 06:04:29,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:04:29,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 06:04:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:04:29,793 INFO L225 Difference]: With dead ends: 86 [2018-01-25 06:04:29,793 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 06:04:29,796 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 06:04:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 06:04:29,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-01-25 06:04:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 06:04:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-01-25 06:04:29,838 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-01-25 06:04:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:04:29,838 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-01-25 06:04:29,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:04:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-01-25 06:04:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:04:29,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:04:29,840 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 06:04:29,840 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:04:29,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1810172163, now seen corresponding path program 1 times [2018-01-25 06:04:29,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:04:29,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:29,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:29,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:29,843 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:04:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:29,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:04:29,942 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 06:04:29,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:04:29,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:04:29,943 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:04:29,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:04:29,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:04:29,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:04:29,946 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-01-25 06:04:30,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:04:30,032 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-01-25 06:04:30,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:04:30,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:04:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:04:30,034 INFO L225 Difference]: With dead ends: 80 [2018-01-25 06:04:30,034 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 06:04:30,035 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 06:04:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 06:04:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-01-25 06:04:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 06:04:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-25 06:04:30,046 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 19 [2018-01-25 06:04:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:04:30,046 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-25 06:04:30,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:04:30,047 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-25 06:04:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 06:04:30,048 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:04:30,048 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 06:04:30,048 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:04:30,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1893738511, now seen corresponding path program 1 times [2018-01-25 06:04:30,049 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:04:30,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:30,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,051 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:04:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:30,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:04:30,116 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 06:04:30,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:04:30,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:04:30,117 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:04:30,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:04:30,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:04:30,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:04:30,118 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-01-25 06:04:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:04:30,136 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-01-25 06:04:30,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:04:30,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 06:04:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:04:30,138 INFO L225 Difference]: With dead ends: 86 [2018-01-25 06:04:30,138 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 06:04:30,139 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 06:04:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 06:04:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 06:04:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 06:04:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-25 06:04:30,145 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-25 06:04:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:04:30,145 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-25 06:04:30,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:04:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-25 06:04:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:04:30,147 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:04:30,147 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 06:04:30,147 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:04:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash 389514349, now seen corresponding path program 1 times [2018-01-25 06:04:30,147 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:04:30,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:30,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:04:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:30,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:04:30,222 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 06:04:30,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:04:30,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:04:30,222 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:04:30,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:04:30,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:04:30,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:04:30,223 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-01-25 06:04:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:04:30,329 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 06:04:30,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:04:30,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 06:04:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:04:30,331 INFO L225 Difference]: With dead ends: 50 [2018-01-25 06:04:30,331 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 06:04:30,331 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 06:04:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 06:04:30,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-25 06:04:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 06:04:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-25 06:04:30,338 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-01-25 06:04:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:04:30,338 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-25 06:04:30,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:04:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-25 06:04:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 06:04:30,339 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:04:30,340 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 06:04:30,340 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:04:30,340 INFO L82 PathProgramCache]: Analyzing trace with hash 389514350, now seen corresponding path program 1 times [2018-01-25 06:04:30,340 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:04:30,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:30,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,342 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:04:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:30,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:04:30,395 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 06:04:30,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:04:30,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:04:30,396 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:04:30,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:04:30,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:04:30,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:04:30,397 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-01-25 06:04:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:04:30,448 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-01-25 06:04:30,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:04:30,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 06:04:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:04:30,450 INFO L225 Difference]: With dead ends: 86 [2018-01-25 06:04:30,450 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 06:04:30,451 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 06:04:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 06:04:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-01-25 06:04:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 06:04:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-25 06:04:30,459 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-01-25 06:04:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:04:30,460 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-25 06:04:30,460 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:04:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-25 06:04:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:04:30,461 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:04:30,461 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 06:04:30,461 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:04:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1824781139, now seen corresponding path program 1 times [2018-01-25 06:04:30,462 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:04:30,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:30,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,464 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:04:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:30,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:04:30,520 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 06:04:30,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:04:30,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:04:30,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:04:30,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:04:30,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:04:30,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:04:30,521 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-01-25 06:04:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:04:30,540 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2018-01-25 06:04:30,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:04:30,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 06:04:30,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:04:30,542 INFO L225 Difference]: With dead ends: 98 [2018-01-25 06:04:30,542 INFO L226 Difference]: Without dead ends: 62 [2018-01-25 06:04:30,543 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 06:04:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-25 06:04:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-01-25 06:04:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 06:04:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 06:04:30,551 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 26 [2018-01-25 06:04:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:04:30,551 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 06:04:30,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:04:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 06:04:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:04:30,552 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:04:30,552 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 06:04:30,553 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:04:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash -85684427, now seen corresponding path program 1 times [2018-01-25 06:04:30,553 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:04:30,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:30,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:30,554 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:04:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:30,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:04:30,726 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 06:04:30,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:04:30,727 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:04:30,728 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 06:04:30,731 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 06:04:30,784 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:04:30,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:04:31,146 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:04:31,148 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 06:04:31,167 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:04:31,358 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-25 06:04:31,359 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:04:31,738 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:04:31,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:04:31,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 21 [2018-01-25 06:04:31,739 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:04:31,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:04:31,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:04:31,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=159, Unknown=2, NotChecked=0, Total=210 [2018-01-25 06:04:31,740 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 15 states. [2018-01-25 06:04:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:04:34,157 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-01-25 06:04:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:04:34,157 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-25 06:04:34,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:04:34,158 INFO L225 Difference]: With dead ends: 108 [2018-01-25 06:04:34,159 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 06:04:34,163 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=293, Unknown=2, NotChecked=0, Total=380 [2018-01-25 06:04:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 06:04:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-01-25 06:04:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 06:04:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-01-25 06:04:34,173 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 28 [2018-01-25 06:04:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:04:34,174 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-01-25 06:04:34,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:04:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-01-25 06:04:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:04:34,176 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:04:34,176 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 06:04:34,176 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:04:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash -85684426, now seen corresponding path program 1 times [2018-01-25 06:04:34,177 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:04:34,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:34,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:34,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:04:34,178 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:04:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:34,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:04:34,533 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 06:04:34,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:04:34,534 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:04:34,534 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 06:04:34,534 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 06:04:34,535 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:04:34,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:04:34,678 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:04:34,678 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 06:04:34,692 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:04:34,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:04:34,693 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 06:04:34,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:34,703 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:04:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:34,743 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:04:34,799 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 06:04:34,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:34,824 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 06:04:34,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:34,831 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 06:04:34,831 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:34,869 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 06:04:34,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:34,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:04:34,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 06:04:35,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:35,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:35,190 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 06:04:35,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:35,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:35,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:35,260 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 06:04:35,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:35,336 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 06:04:35,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:35,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:35,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:35,400 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 06:04:35,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:35,455 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 06:04:35,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 06:04:35,680 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 06:04:35,680 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:04:36,488 WARN L146 SmtUtils]: Spent 661ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-25 06:04:36,508 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 06:04:42,214 WARN L146 SmtUtils]: Spent 5562ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-25 06:04:42,229 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:04:46,337 WARN L143 SmtUtils]: Spent 4034ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-25 06:04:46,347 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:04:46,362 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:04:46,527 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 06:04:46,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:46,541 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 06:04:46,556 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 06:04:46,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:46,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:04:46,573 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 06:04:46,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:46,588 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 06:04:46,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 06:04:47,210 WARN L143 SmtUtils]: Spent 270ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-25 06:04:49,466 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 06:04:49,503 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 06:04:49,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:49,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:04:49,540 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 06:04:49,541 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:49,565 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 06:04:49,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:49,589 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 06:04:49,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 06:04:49,715 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 06:04:49,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:04:49,736 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 06:04:49,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:04:49,740 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:04:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:04:49,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:04:49,802 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 06:04:49,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:49,818 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 06:04:49,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:49,820 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 06:04:49,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:49,836 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 06:04:49,837 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:49,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:04:49,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 06:04:49,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:49,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:49,966 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 06:04:49,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:50,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:50,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:50,023 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 06:04:50,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:50,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:50,071 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 06:04:50,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:50,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:50,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:04:50,121 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 06:04:50,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:04:50,150 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 06:04:50,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 06:04:50,211 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 06:04:50,211 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:04:50,293 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-25 06:04:52,874 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-25 06:04:52,887 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:05:01,174 WARN L143 SmtUtils]: Spent 4021ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-25 06:05:01,179 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:05:01,186 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:05:01,397 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 06:05:01,416 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 06:05:01,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:01,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:05:01,466 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 06:05:01,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:01,483 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 06:05:01,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:01,499 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 06:05:01,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 06:05:04,034 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 06:05:04,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:04,075 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 06:05:04,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:04,105 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 06:05:04,138 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 06:05:04,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:04,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:05:04,175 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 06:05:04,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 06:05:04,368 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 06:05:04,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:05:04,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 29 [2018-01-25 06:05:04,370 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:05:04,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 06:05:04,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 06:05:04,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=779, Unknown=4, NotChecked=0, Total=870 [2018-01-25 06:05:04,371 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 19 states. [2018-01-25 06:05:04,841 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-25 06:05:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 06:05:39,591 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:05:39,595 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:05:39,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:05:39 BoogieIcfgContainer [2018-01-25 06:05:39,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:05:39,597 INFO L168 Benchmark]: Toolchain (without parser) took 70757.89 ms. Allocated memory was 304.1 MB in the beginning and 628.1 MB in the end (delta: 324.0 MB). Free memory was 261.0 MB in the beginning and 558.1 MB in the end (delta: -297.1 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-01-25 06:05:39,598 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:05:39,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.82 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 248.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 06:05:39,598 INFO L168 Benchmark]: Boogie Preprocessor took 30.34 ms. Allocated memory is still 304.1 MB. Free memory was 248.0 MB in the beginning and 245.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-25 06:05:39,598 INFO L168 Benchmark]: RCFGBuilder took 224.96 ms. Allocated memory is still 304.1 MB. Free memory was 245.9 MB in the beginning and 228.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:05:39,599 INFO L168 Benchmark]: TraceAbstraction took 70286.59 ms. Allocated memory was 304.1 MB in the beginning and 628.1 MB in the end (delta: 324.0 MB). Free memory was 228.7 MB in the beginning and 558.1 MB in the end (delta: -329.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:05:39,600 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.20 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.82 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 248.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 30.34 ms. Allocated memory is still 304.1 MB. Free memory was 248.0 MB in the beginning and 245.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 224.96 ms. Allocated memory is still 304.1 MB. Free memory was 245.9 MB in the beginning and 228.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70286.59 ms. Allocated memory was 304.1 MB in the beginning and 628.1 MB in the end (delta: 324.0 MB). Free memory was 228.7 MB in the beginning and 558.1 MB in the end (delta: -329.4 MB). There was no memory consumed. 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.329640 RENAME_VARIABLES(MILLISECONDS) : 0.191843 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.279509 PROJECTAWAY(MILLISECONDS) : 0.035714 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.170721 DISJOIN(MILLISECONDS) : 0.718062 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.229578 ADD_EQUALITY(MILLISECONDS) : 0.019801 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.031786 #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.486945 RENAME_VARIABLES(MILLISECONDS) : 0.107662 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.206742 PROJECTAWAY(MILLISECONDS) : 0.063488 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065179 DISJOIN(MILLISECONDS) : 0.587232 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.132130 ADD_EQUALITY(MILLISECONDS) : 0.020808 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007086 #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 13 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - 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 13 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 13 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 13 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - 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 13 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - 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 13 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - 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 13 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 7 error locations. TIMEOUT Result, 70.2s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 38.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 339 SDslu, 895 SDs, 0 SdLazy, 348 SolverSat, 62 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 29.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 196 GetRequests, 105 SyntacticMatches, 18 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 35.2s 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, 0.5s 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, 30.4s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 282 ConstructedInterpolants, 54 QuantifiedInterpolants, 123723 SizeOfPredicates, 18 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 13/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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-05-39-609.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-05-39-609.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-05-39-609.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-05-39-609.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-05-39-609.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-05-39-609.csv Completed graceful shutdown