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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:45:31,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:45:31,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:45:32,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:45:32,002 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:45:32,003 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:45:32,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:45:32,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:45:32,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:45:32,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:45:32,010 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:45:32,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:45:32,011 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:45:32,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:45:32,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:45:32,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:45:32,018 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:45:32,020 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:45:32,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:45:32,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:45:32,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:45:32,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:45:32,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:45:32,026 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:45:32,026 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:45:32,027 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:45:32,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:45:32,028 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:45:32,028 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:45:32,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:45:32,029 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:45:32,029 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_mostprecise.epf [2018-01-24 20:45:32,039 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:45:32,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:45:32,040 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:45:32,041 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:45:32,041 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:45:32,041 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:45:32,041 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:45:32,041 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:45:32,042 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:45:32,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:45:32,042 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:45:32,043 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:45:32,043 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:45:32,043 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:45:32,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:45:32,043 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:45:32,044 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:45:32,044 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:45:32,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:45:32,044 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:45:32,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:45:32,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:45:32,045 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:45:32,045 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:45:32,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:45:32,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:45:32,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:45:32,046 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:45:32,046 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:45:32,046 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:45:32,046 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:45:32,046 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:45:32,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:45:32,047 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:45:32,047 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:45:32,048 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:45:32,048 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:45:32,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:45:32,097 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:45:32,101 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:45:32,102 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:45:32,103 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:45:32,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-24 20:45:32,297 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:45:32,303 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:45:32,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:45:32,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:45:32,311 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:45:32,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a251b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32, skipping insertion in model container [2018-01-24 20:45:32,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,327 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:45:32,377 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:45:32,492 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:45:32,509 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:45:32,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32 WrapperNode [2018-01-24 20:45:32,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:45:32,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:45:32,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:45:32,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:45:32,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (1/1) ... [2018-01-24 20:45:32,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:45:32,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:45:32,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:45:32,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:45:32,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:45:32,600 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:45:32,600 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:45:32,601 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 20:45:32,601 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 20:45:32,601 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:45:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:45:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:45:32,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:45:32,602 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:45:32,602 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:45:32,602 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:45:32,602 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:45:32,602 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:45:32,602 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 20:45:32,603 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 20:45:32,603 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:45:32,603 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:45:32,603 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:45:32,776 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:45:32,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:45:32 BoogieIcfgContainer [2018-01-24 20:45:32,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:45:32,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:45:32,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:45:32,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:45:32,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:45:32" (1/3) ... [2018-01-24 20:45:32,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308d1505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:45:32, skipping insertion in model container [2018-01-24 20:45:32,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:45:32" (2/3) ... [2018-01-24 20:45:32,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308d1505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:45:32, skipping insertion in model container [2018-01-24 20:45:32,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:45:32" (3/3) ... [2018-01-24 20:45:32,782 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-01-24 20:45:32,788 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:45:32,794 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 20:45:32,845 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:45:32,846 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:45:32,846 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:45:32,846 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:45:32,846 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:45:32,846 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:45:32,846 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:45:32,847 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:45:32,847 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:45:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 20:45:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:45:32,875 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:32,876 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:32,876 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:32,881 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-01-24 20:45:32,884 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:32,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:32,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:32,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:32,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:33,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:33,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:33,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:45:33,086 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:33,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:45:33,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:45:33,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:45:33,106 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 20:45:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:33,312 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-01-24 20:45:33,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:45:33,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 20:45:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:33,326 INFO L225 Difference]: With dead ends: 95 [2018-01-24 20:45:33,327 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 20:45:33,330 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:45:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 20:45:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-01-24 20:45:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 20:45:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-01-24 20:45:33,380 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-01-24 20:45:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:33,380 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-01-24 20:45:33,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:45:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-01-24 20:45:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 20:45:33,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:33,383 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:33,383 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-01-24 20:45:33,384 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:33,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:33,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:33,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:33,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:33,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:45:33,490 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:33,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:45:33,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:45:33,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:45:33,492 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-01-24 20:45:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:33,554 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-01-24 20:45:33,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:45:33,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 20:45:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:33,557 INFO L225 Difference]: With dead ends: 75 [2018-01-24 20:45:33,557 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 20:45:33,558 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:45:33,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 20:45:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-01-24 20:45:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 20:45:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 20:45:33,566 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-24 20:45:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:33,567 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 20:45:33,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:45:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 20:45:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:45:33,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:33,568 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:33,569 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-01-24 20:45:33,569 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:33,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:33,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:33,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:33,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:33,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:45:33,627 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:33,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:45:33,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:45:33,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:45:33,628 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-24 20:45:33,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:33,661 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 20:45:33,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:45:33,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 20:45:33,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:33,664 INFO L225 Difference]: With dead ends: 70 [2018-01-24 20:45:33,664 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 20:45:33,664 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:45:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 20:45:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-24 20:45:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 20:45:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-01-24 20:45:33,671 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-01-24 20:45:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:33,671 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-01-24 20:45:33,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:45:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-01-24 20:45:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:45:33,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:33,672 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:33,672 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-01-24 20:45:33,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:33,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:33,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:33,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:33,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:33,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:45:33,732 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:33,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:45:33,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:45:33,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:45:33,733 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-01-24 20:45:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:33,888 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-01-24 20:45:33,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:45:33,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 20:45:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:33,891 INFO L225 Difference]: With dead ends: 71 [2018-01-24 20:45:33,891 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 20:45:33,891 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:45:33,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 20:45:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-01-24 20:45:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 20:45:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-01-24 20:45:33,902 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-01-24 20:45:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:33,902 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-01-24 20:45:33,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:45:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-01-24 20:45:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:45:33,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:33,904 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:33,904 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-01-24 20:45:33,904 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:33,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:33,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:33,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:33,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:33,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:45:33,960 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:33,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:45:33,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:45:33,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:45:33,961 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-01-24 20:45:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:33,981 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-24 20:45:33,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:45:33,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 20:45:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:33,982 INFO L225 Difference]: With dead ends: 80 [2018-01-24 20:45:33,982 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 20:45:33,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:45:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 20:45:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 20:45:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 20:45:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-24 20:45:33,989 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-01-24 20:45:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:33,989 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-24 20:45:33,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:45:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-24 20:45:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:45:33,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:33,991 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:33,991 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-01-24 20:45:33,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:33,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:33,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:33,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:34,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:34,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:34,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:45:34,039 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:34,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:45:34,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:45:34,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:45:34,041 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-01-24 20:45:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:34,086 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-24 20:45:34,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:45:34,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 20:45:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:34,088 INFO L225 Difference]: With dead ends: 45 [2018-01-24 20:45:34,088 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 20:45:34,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:45:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 20:45:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 20:45:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 20:45:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 20:45:34,100 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-01-24 20:45:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:34,101 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 20:45:34,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:45:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 20:45:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:45:34,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:34,102 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:34,102 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:34,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-01-24 20:45:34,103 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:34,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:34,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:34,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:34,105 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:34,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:34,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:34,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:45:34,167 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:34,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:45:34,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:45:34,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:45:34,168 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 20:45:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:34,270 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 20:45:34,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:45:34,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 20:45:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:34,273 INFO L225 Difference]: With dead ends: 52 [2018-01-24 20:45:34,273 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 20:45:34,274 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:45:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 20:45:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-01-24 20:45:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 20:45:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-24 20:45:34,285 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-01-24 20:45:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:34,286 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-24 20:45:34,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:45:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-24 20:45:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:45:34,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:34,287 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:34,287 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-01-24 20:45:34,287 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:34,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:34,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:34,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:34,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:34,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:34,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:34,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:45:34,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:34,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:45:34,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:45:34,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:45:34,364 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-01-24 20:45:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:34,394 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-01-24 20:45:34,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:45:34,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 20:45:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:34,396 INFO L225 Difference]: With dead ends: 94 [2018-01-24 20:45:34,396 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 20:45:34,396 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:45:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 20:45:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-01-24 20:45:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 20:45:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-24 20:45:34,404 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-01-24 20:45:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:34,405 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-24 20:45:34,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:45:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-24 20:45:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:45:34,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:34,406 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:34,406 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-01-24 20:45:34,406 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:34,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:34,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:34,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:34,408 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:34,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 20:45:34,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:45:34,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:45:34,547 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:34,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:45:34,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:45:34,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:45:34,548 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-24 20:45:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:34,602 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-24 20:45:34,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:45:34,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 20:45:34,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:34,603 INFO L225 Difference]: With dead ends: 106 [2018-01-24 20:45:34,604 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 20:45:34,604 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:45:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 20:45:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-01-24 20:45:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 20:45:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 20:45:34,612 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-01-24 20:45:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:34,612 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 20:45:34,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:45:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 20:45:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 20:45:34,613 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:34,614 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:34,614 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-01-24 20:45:34,614 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:34,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:34,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:34,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:34,616 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:34,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:34,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:45:34,772 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:45:34,773 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 20:45:34,775 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [39], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-24 20:45:34,825 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:45:34,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:45:36,032 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 20:45:36,041 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 20:45:36,047 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 20:45:36,848 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-24 20:45:36,848 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 20:45:37,490 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 20:45:37,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:45:37,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-24 20:45:37,491 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:45:37,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 20:45:37,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 20:45:37,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-24 20:45:37,492 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 16 states. [2018-01-24 20:45:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:45:49,090 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2018-01-24 20:45:49,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 20:45:49,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-01-24 20:45:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:45:49,093 INFO L225 Difference]: With dead ends: 107 [2018-01-24 20:45:49,093 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 20:45:49,094 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2018-01-24 20:45:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 20:45:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2018-01-24 20:45:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 20:45:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-24 20:45:49,103 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2018-01-24 20:45:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:45:49,104 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-24 20:45:49,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 20:45:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-24 20:45:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 20:45:49,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:45:49,105 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:45:49,105 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:45:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-01-24 20:45:49,106 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:45:49,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:49,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:49,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:45:49,108 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:45:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:49,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:45:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:49,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:45:49,700 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:45:49,700 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 20:45:49,700 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [21], [25], [30], [32], [37], [40], [75], [77], [78], [79], [81], [82], [83], [84] [2018-01-24 20:45:49,702 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:45:49,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:45:50,417 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:45:50,418 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 20:45:50,433 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:45:50,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:45:50,433 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:45:50,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:50,440 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:45:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:50,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:45:50,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 20:45:50,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:50,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 20:45:50,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:50,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 20:45:50,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:50,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 20:45:50,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:50,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:45:50,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 20:45:51,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:45:51,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:45:51,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-24 20:45:51,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:51,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:45:51,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:45:51,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 20:45:51,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:51,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:45:51,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:45:51,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-24 20:45:51,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:51,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 20:45:51,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:51,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 20:45:51,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 20:45:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:51,462 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:45:52,259 WARN L146 SmtUtils]: Spent 677ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-24 20:45:52,282 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 20:45:55,145 WARN L146 SmtUtils]: Spent 2756ms on a formula simplification. DAG size of input: 84 DAG size of output 58 [2018-01-24 20:45:55,150 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-24 20:45:55,159 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-24 20:45:55,214 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 100 [2018-01-24 20:45:57,552 WARN L143 SmtUtils]: Spent 1065ms on a formula simplification that was a NOOP. DAG size: 104 [2018-01-24 20:45:57,578 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 100 [2018-01-24 20:45:58,011 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 100 [2018-01-24 20:45:58,720 WARN L143 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 20:45:59,124 WARN L143 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 20:45:59,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 20:45:59,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:59,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-24 20:45:59,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 20:45:59,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:59,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:45:59,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 20:45:59,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:59,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:45:59,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 20:45:59,716 WARN L143 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-24 20:46:00,390 WARN L143 SmtUtils]: Spent 166ms on a formula simplification that was a NOOP. DAG size: 51 [2018-01-24 20:46:00,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 20:46:00,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:00,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 20:46:00,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:00,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 20:46:00,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 20:46:00,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:00,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:46:00,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 20:46:00,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 20:46:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:46:00,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:46:00,737 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:46:00,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:46:00,741 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:46:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:46:00,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:46:00,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 20:46:00,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:00,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 20:46:00,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:00,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 20:46:00,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:00,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 20:46:00,828 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:00,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:46:00,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 20:46:01,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:46:01,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:46:01,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-24 20:46:01,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:01,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:46:01,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-24 20:46:01,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:01,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:46:01,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:46:01,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 20:46:01,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:01,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 20:46:01,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:46:01,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 20:46:01,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 20:46:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:46:01,738 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:46:01,888 WARN L143 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-24 20:46:02,039 WARN L143 SmtUtils]: Spent 150ms on a formula simplification that was a NOOP. DAG size: 22 [2018-01-24 20:46:03,411 WARN L143 SmtUtils]: Spent 363ms on a formula simplification that was a NOOP. DAG size: 46 [2018-01-24 20:46:03,432 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2018-01-24 20:46:05,823 WARN L143 SmtUtils]: Spent 1316ms on a formula simplification that was a NOOP. DAG size: 117 [2018-01-24 20:46:05,844 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2018-01-24 20:46:05,907 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 64 [2018-01-24 20:46:05,972 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 6480 conjuctions. This might take some time... [2018-01-24 20:46:08,570 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 6480 conjuctions. [2018-01-24 20:46:09,899 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6480 Received shutdown request... [2018-01-24 20:46:19,653 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 20:46:19,654 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:46:19,657 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:46:19,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:46:19 BoogieIcfgContainer [2018-01-24 20:46:19,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:46:19,658 INFO L168 Benchmark]: Toolchain (without parser) took 47360.85 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 266.1 MB in the beginning and 1.1 GB in the end (delta: -832.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-24 20:46:19,659 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:46:19,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.42 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 252.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:46:19,659 INFO L168 Benchmark]: Boogie Preprocessor took 35.79 ms. Allocated memory is still 307.2 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:46:19,659 INFO L168 Benchmark]: RCFGBuilder took 224.64 ms. Allocated memory is still 307.2 MB. Free memory was 250.1 MB in the beginning and 233.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:46:19,660 INFO L168 Benchmark]: TraceAbstraction took 46879.88 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 233.1 MB in the beginning and 1.1 GB in the end (delta: -865.9 MB). Peak memory consumption was 974.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:46:19,661 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.23 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.42 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 252.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.79 ms. Allocated memory is still 307.2 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 224.64 ms. Allocated memory is still 307.2 MB. Free memory was 250.1 MB in the beginning and 233.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46879.88 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 233.1 MB in the beginning and 1.1 GB in the end (delta: -865.9 MB). Peak memory consumption was 974.1 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 : 133 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 41 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.004060 RENAME_VARIABLES(MILLISECONDS) : 0.168866 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.949146 PROJECTAWAY(MILLISECONDS) : 0.110459 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.149155 DISJOIN(MILLISECONDS) : 2.283853 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.203422 ADD_EQUALITY(MILLISECONDS) : 0.024979 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.052234 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 77 #PROJECTAWAY : 73 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 145 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.363127 RENAME_VARIABLES(MILLISECONDS) : 0.077289 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.144533 PROJECTAWAY(MILLISECONDS) : 0.033657 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.045675 DISJOIN(MILLISECONDS) : 0.361398 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.109569 ADD_EQUALITY(MILLISECONDS) : 0.011690 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003700 #CONJOIN_DISJUNCTIVE : 45 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 78 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 6480 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 46.8s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 445 SDtfs, 410 SDslu, 1201 SDs, 0 SdLazy, 319 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8761463844797178 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 5.296296296296297 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 131 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 11868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 8/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-46-19-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-46-19-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-46-19-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_20-46-19-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_20-46-19-671.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-46-19-671.csv Completed graceful shutdown