java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:14:02,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:14:02,802 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:14:02,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:14:02,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:14:02,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:14:02,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:14:02,825 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:14:02,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:14:02,829 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:14:02,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:14:02,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:14:02,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:14:02,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:14:02,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:14:02,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:14:02,840 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:14:02,843 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:14:02,844 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:14:02,846 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:14:02,848 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:14:02,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:14:02,849 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:14:02,850 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:14:02,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:14:02,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:14:02,853 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:14:02,853 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:14:02,854 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:14:02,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:14:02,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:14:02,855 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-24 23:14:02,866 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:14:02,867 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:14:02,868 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:14:02,868 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:14:02,868 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:14:02,868 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:14:02,869 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:14:02,869 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:14:02,870 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:14:02,870 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:14:02,870 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:14:02,870 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:14:02,871 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:14:02,871 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:14:02,871 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:14:02,871 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:14:02,871 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:14:02,872 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:14:02,872 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:14:02,872 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:14:02,872 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:14:02,873 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:14:02,873 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:14:02,873 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:14:02,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:14:02,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:14:02,874 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:14:02,874 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:14:02,874 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:14:02,874 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:14:02,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:14:02,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:14:02,875 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:14:02,875 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:14:02,876 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:14:02,876 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:14:02,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:14:02,932 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:14:02,938 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:14:02,940 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:14:02,940 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:14:02,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:14:03,150 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:14:03,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:14:03,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:14:03,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:14:03,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:14:03,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8c01df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03, skipping insertion in model container [2018-01-24 23:14:03,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,192 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:14:03,234 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:14:03,387 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:14:03,407 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:14:03,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03 WrapperNode [2018-01-24 23:14:03,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:14:03,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:14:03,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:14:03,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:14:03,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (1/1) ... [2018-01-24 23:14:03,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:14:03,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:14:03,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:14:03,461 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:14:03,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (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 23:14:03,513 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:14:03,513 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:14:03,514 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-24 23:14:03,514 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:14:03,514 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:14:03,514 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:14:03,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:14:03,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:14:03,515 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:14:03,515 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:14:03,515 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-24 23:14:03,515 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:14:03,515 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:14:03,516 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:14:03,864 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:14:03,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:14:03 BoogieIcfgContainer [2018-01-24 23:14:03,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:14:03,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:14:03,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:14:03,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:14:03,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:14:03" (1/3) ... [2018-01-24 23:14:03,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0dad10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:14:03, skipping insertion in model container [2018-01-24 23:14:03,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:14:03" (2/3) ... [2018-01-24 23:14:03,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0dad10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:14:03, skipping insertion in model container [2018-01-24 23:14:03,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:14:03" (3/3) ... [2018-01-24 23:14:03,873 INFO L105 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:14:03,880 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:14:03,888 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 23:14:03,929 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:14:03,929 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:14:03,929 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:14:03,930 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:14:03,930 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:14:03,930 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:14:03,930 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:14:03,930 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:14:03,931 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:14:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-24 23:14:03,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:14:03,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:03,963 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:14:03,963 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 23:14:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-01-24 23:14:03,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:04,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:04,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:04,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:04,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:04,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:14:04,224 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 23:14:04,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:04,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:14:04,227 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:04,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:14:04,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:14:04,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:14:04,318 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-01-24 23:14:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:04,490 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2018-01-24 23:14:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:14:04,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-24 23:14:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:04,504 INFO L225 Difference]: With dead ends: 138 [2018-01-24 23:14:04,504 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 23:14:04,509 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:14:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 23:14:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 23:14:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 23:14:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-24 23:14:04,547 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-01-24 23:14:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:04,547 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-24 23:14:04,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:14:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-24 23:14:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:14:04,548 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:04,548 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:14:04,548 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 23:14:04,548 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-01-24 23:14:04,549 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:04,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:04,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:04,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:04,550 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:04,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:14:04,720 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 23:14:04,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:04,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:14:04,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:04,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:14:04,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:14:04,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:14:04,723 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-01-24 23:14:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:05,065 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-01-24 23:14:05,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:14:05,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-24 23:14:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:05,070 INFO L225 Difference]: With dead ends: 99 [2018-01-24 23:14:05,070 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 23:14:05,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:14:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 23:14:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-01-24 23:14:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 23:14:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-24 23:14:05,082 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-01-24 23:14:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:05,082 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-24 23:14:05,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:14:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-24 23:14:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:14:05,083 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:05,083 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 23:14:05,083 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 23:14:05,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-01-24 23:14:05,084 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:05,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:05,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:05,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:05,085 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:05,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:14:05,143 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 23:14:05,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:05,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:14:05,143 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:05,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:14:05,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:14:05,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:14:05,144 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-01-24 23:14:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:05,202 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-24 23:14:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:14:05,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 23:14:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:05,204 INFO L225 Difference]: With dead ends: 82 [2018-01-24 23:14:05,204 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 23:14:05,205 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:14:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 23:14:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 23:14:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 23:14:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-24 23:14:05,216 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-01-24 23:14:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:05,217 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-24 23:14:05,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:14:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-24 23:14:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:14:05,218 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:05,218 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 23:14:05,218 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 23:14:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-01-24 23:14:05,219 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:05,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:05,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:05,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:05,220 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:05,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:14:05,326 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 23:14:05,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:05,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:14:05,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:05,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:14:05,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:14:05,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:14:05,327 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-01-24 23:14:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:05,570 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-01-24 23:14:05,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:14:05,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 23:14:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:05,572 INFO L225 Difference]: With dead ends: 99 [2018-01-24 23:14:05,573 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 23:14:05,573 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:14:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 23:14:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-01-24 23:14:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 23:14:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-01-24 23:14:05,584 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-01-24 23:14:05,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:05,584 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-01-24 23:14:05,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:14:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-01-24 23:14:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 23:14:05,585 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:05,585 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, 1] [2018-01-24 23:14:05,586 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 23:14:05,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-01-24 23:14:05,586 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:05,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:05,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:05,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:05,593 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:05,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:14:05,684 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 23:14:05,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:05,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:14:05,684 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:05,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:14:05,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:14:05,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:14:05,686 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-01-24 23:14:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:05,853 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-01-24 23:14:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:14:05,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 23:14:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:05,856 INFO L225 Difference]: With dead ends: 181 [2018-01-24 23:14:05,856 INFO L226 Difference]: Without dead ends: 128 [2018-01-24 23:14:05,857 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:14:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-24 23:14:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-01-24 23:14:05,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-24 23:14:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-01-24 23:14:05,871 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-01-24 23:14:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:05,871 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-01-24 23:14:05,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:14:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-01-24 23:14:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 23:14:05,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:05,873 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] [2018-01-24 23:14:05,873 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 23:14:05,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-01-24 23:14:05,873 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:05,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:05,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:05,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:05,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:05,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:14:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:05,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:05,987 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:14:05,988 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 23:14:05,990 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [126], [129], [133], [134], [141], [142], [143], [145] [2018-01-24 23:14:06,043 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:14:06,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:14:43,221 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:14:43,223 INFO L268 AbstractInterpreter]: Visited 21 different actions 32 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 23:14:43,240 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:14:43,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:43,240 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 23:14:43,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:43,246 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:43,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:14:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:43,323 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:14:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:43,396 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 23:14:43,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-01-24 23:14:43,397 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:43,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:14:43,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:14:43,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 23:14:43,397 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 7 states. [2018-01-24 23:14:43,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:43,470 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2018-01-24 23:14:43,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:14:43,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 23:14:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:43,472 INFO L225 Difference]: With dead ends: 165 [2018-01-24 23:14:43,472 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 23:14:43,473 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-24 23:14:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 23:14:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2018-01-24 23:14:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 23:14:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-01-24 23:14:43,485 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-01-24 23:14:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:43,486 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-01-24 23:14:43,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:14:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-01-24 23:14:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 23:14:43,487 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:43,487 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, 1] [2018-01-24 23:14:43,487 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 23:14:43,488 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-01-24 23:14:43,488 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:43,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:43,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:43,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:43,489 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:43,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:14:43,559 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 23:14:43,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:14:43,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:14:43,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:14:43,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:14:43,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:14:43,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:14:43,560 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-01-24 23:14:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:14:43,674 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-01-24 23:14:43,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:14:43,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 23:14:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:14:43,675 INFO L225 Difference]: With dead ends: 191 [2018-01-24 23:14:43,675 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 23:14:43,676 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:14:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 23:14:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-24 23:14:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 23:14:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-24 23:14:43,686 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-01-24 23:14:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:14:43,686 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-24 23:14:43,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:14:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-24 23:14:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 23:14:43,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:14:43,687 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] [2018-01-24 23:14:43,687 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 23:14:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-01-24 23:14:43,688 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:14:43,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:43,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:43,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:14:43,689 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:14:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:43,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:14:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:14:43,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:43,843 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:14:43,844 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 23:14:43,844 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [10], [15], [16], [18], [19], [23], [126], [131], [133], [134], [141], [142], [143], [145] [2018-01-24 23:14:43,845 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:14:43,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 23:14:56,774 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 23:14:56,774 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 23:14:56,774 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:14:56,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:14:56,775 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:14:56,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:14:56,781 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:14:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:14:56,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:14:56,802 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:14:56,802 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:14:56,805 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:14:56,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:14:56 BoogieIcfgContainer [2018-01-24 23:14:56,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:14:56,806 INFO L168 Benchmark]: Toolchain (without parser) took 53654.97 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 263.7 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 266.8 MB. Max. memory is 5.3 GB. [2018-01-24 23:14:56,806 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 304.6 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:14:56,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.48 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 23:14:56,807 INFO L168 Benchmark]: Boogie Preprocessor took 42.64 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 23:14:56,807 INFO L168 Benchmark]: RCFGBuilder took 404.13 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 226.8 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. [2018-01-24 23:14:56,807 INFO L168 Benchmark]: TraceAbstraction took 52939.94 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 226.8 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 229.9 MB. Max. memory is 5.3 GB. [2018-01-24 23:14:56,808 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.35 ms. Allocated memory is still 304.6 MB. Free memory is still 269.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 258.48 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 253.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.64 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 404.13 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 226.8 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52939.94 ms. Allocated memory was 304.6 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 226.8 MB in the beginning and 2.0 GB in the end (delta: -1.8 GB). Peak memory consumption was 229.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 275 LocStat_NO_SUPPORTING_DISEQUALITIES : 63 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 22.230517 RENAME_VARIABLES(MILLISECONDS) : 6.088097 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 22.153546 PROJECTAWAY(MILLISECONDS) : 3516.772400 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.075934 DISJOIN(MILLISECONDS) : 3.069249 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 6.168586 ADD_EQUALITY(MILLISECONDS) : 0.040688 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012405 #CONJOIN_DISJUNCTIVE : 61 #RENAME_VARIABLES : 98 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 79 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 93 #ADD_EQUALITY : 58 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 23 error locations. TIMEOUT Result, 52.8s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 980 SDslu, 808 SDs, 0 SdLazy, 538 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 50.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 58 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 12825 SizeOfPredicates, 3 NumberOfNonLiveVariables, 106 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 7/9 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/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-14-56-817.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-14-56-817.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-14-56-817.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-14-56-817.csv Completed graceful shutdown