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/memsafety/lockfree-3.2_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:30:55,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:30:55,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:30:55,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:30:55,805 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:30:55,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:30:55,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:30:55,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:30:55,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:30:55,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:30:55,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:30:55,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:30:55,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:30:55,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:30:55,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:30:55,817 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:30:55,819 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:30:55,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:30:55,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:30:55,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:30:55,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:30:55,826 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:30:55,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:30:55,827 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:30:55,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:30:55,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:30:55,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:30:55,830 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:30:55,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:30:55,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:30:55,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:30:55,831 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:30:55,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:30:55,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:30:55,842 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:30:55,843 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:30:55,843 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:30:55,843 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:30:55,843 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:30:55,844 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:30:55,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:30:55,844 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:30:55,845 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:30:55,845 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:30:55,845 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:30:55,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:30:55,845 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:30:55,846 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:30:55,846 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:30:55,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:30:55,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:30:55,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:30:55,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:30:55,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:30:55,847 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:30:55,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:30:55,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:30:55,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:30:55,848 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:30:55,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:30:55,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:30:55,848 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:30:55,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:30:55,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:30:55,849 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:30:55,849 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:30:55,850 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:30:55,850 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:30:55,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:30:55,898 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:30:55,902 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:30:55,903 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:30:55,904 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:30:55,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.2_false-valid-memtrack.i [2018-01-24 23:30:56,052 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:30:56,058 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:30:56,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:30:56,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:30:56,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:30:56,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4430c394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56, skipping insertion in model container [2018-01-24 23:30:56,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,085 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:30:56,126 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:30:56,238 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:30:56,258 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:30:56,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56 WrapperNode [2018-01-24 23:30:56,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:30:56,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:30:56,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:30:56,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:30:56,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (1/1) ... [2018-01-24 23:30:56,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:30:56,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:30:56,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:30:56,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:30:56,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (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:30:56,368 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:30:56,368 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:30:56,368 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-24 23:30:56,368 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-24 23:30:56,368 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:30:56,368 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:30:56,369 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:30:56,369 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 23:30:56,369 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 23:30:56,369 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:30:56,369 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:30:56,369 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:30:56,369 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 23:30:56,370 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 23:30:56,370 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:30:56,370 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-24 23:30:56,370 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-24 23:30:56,370 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:30:56,370 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:30:56,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:30:56,729 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:30:56,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:30:56 BoogieIcfgContainer [2018-01-24 23:30:56,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:30:56,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:30:56,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:30:56,734 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:30:56,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:30:56" (1/3) ... [2018-01-24 23:30:56,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da08a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:30:56, skipping insertion in model container [2018-01-24 23:30:56,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:30:56" (2/3) ... [2018-01-24 23:30:56,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35da08a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:30:56, skipping insertion in model container [2018-01-24 23:30:56,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:30:56" (3/3) ... [2018-01-24 23:30:56,737 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.2_false-valid-memtrack.i [2018-01-24 23:30:56,744 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:30:56,752 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-24 23:30:56,790 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:30:56,791 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:30:56,791 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:30:56,791 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:30:56,791 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:30:56,791 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:30:56,791 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:30:56,791 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:30:56,792 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:30:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-24 23:30:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-24 23:30:56,815 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:56,816 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:56,816 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:56,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-01-24 23:30:56,822 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:56,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:56,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:56,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:56,864 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:56,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:30:56,972 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:30:56,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:30:56,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:30:56,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:56,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 23:30:56,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 23:30:56,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 23:30:56,995 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-01-24 23:30:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:30:57,095 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2018-01-24 23:30:57,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 23:30:57,097 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-24 23:30:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:30:57,110 INFO L225 Difference]: With dead ends: 92 [2018-01-24 23:30:57,110 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 23:30:57,114 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 23:30:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 23:30:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 23:30:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 23:30:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-01-24 23:30:57,152 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-01-24 23:30:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:30:57,152 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-01-24 23:30:57,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 23:30:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-01-24 23:30:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 23:30:57,153 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:57,153 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:57,153 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-01-24 23:30:57,153 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:57,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:57,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,155 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:57,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:30:57,217 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:30:57,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:30:57,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:30:57,218 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:57,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:30:57,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:30:57,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:30:57,220 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-01-24 23:30:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:30:57,252 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2018-01-24 23:30:57,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:30:57,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 23:30:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:30:57,254 INFO L225 Difference]: With dead ends: 87 [2018-01-24 23:30:57,255 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 23:30:57,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 23:30:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 23:30:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 23:30:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 23:30:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-01-24 23:30:57,266 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-01-24 23:30:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:30:57,266 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-01-24 23:30:57,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:30:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-01-24 23:30:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 23:30:57,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:57,267 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:57,267 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:57,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-01-24 23:30:57,268 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:57,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:57,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,269 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:57,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:30:57,370 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:30:57,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:30:57,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:30:57,371 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:57,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:30:57,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:30:57,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:30:57,371 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-01-24 23:30:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:30:57,419 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2018-01-24 23:30:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:30:57,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 23:30:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:30:57,421 INFO L225 Difference]: With dead ends: 145 [2018-01-24 23:30:57,422 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 23:30:57,422 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 23:30:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 23:30:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-01-24 23:30:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 23:30:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-01-24 23:30:57,440 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-01-24 23:30:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:30:57,440 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-01-24 23:30:57,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:30:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-01-24 23:30:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:30:57,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:57,441 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:57,442 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:57,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-01-24 23:30:57,442 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:57,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:57,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,443 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:57,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:30:57,499 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:30:57,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:30:57,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:30:57,499 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:57,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:30:57,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:30:57,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:30:57,500 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-01-24 23:30:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:30:57,587 INFO L93 Difference]: Finished difference Result 148 states and 206 transitions. [2018-01-24 23:30:57,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:30:57,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 23:30:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:30:57,589 INFO L225 Difference]: With dead ends: 148 [2018-01-24 23:30:57,589 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 23:30:57,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:30:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 23:30:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-01-24 23:30:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 23:30:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-01-24 23:30:57,605 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-01-24 23:30:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:30:57,605 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-01-24 23:30:57,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:30:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-01-24 23:30:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 23:30:57,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:57,606 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:57,606 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-01-24 23:30:57,606 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:57,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:57,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:57,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:30:57,671 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:30:57,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:30:57,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:30:57,672 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:57,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:30:57,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:30:57,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:30:57,673 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-01-24 23:30:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:30:57,838 INFO L93 Difference]: Finished difference Result 385 states and 558 transitions. [2018-01-24 23:30:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:30:57,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 23:30:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:30:57,841 INFO L225 Difference]: With dead ends: 385 [2018-01-24 23:30:57,841 INFO L226 Difference]: Without dead ends: 255 [2018-01-24 23:30:57,843 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:30:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-24 23:30:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-01-24 23:30:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-24 23:30:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-01-24 23:30:57,871 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-01-24 23:30:57,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:30:57,872 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-01-24 23:30:57,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:30:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-01-24 23:30:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 23:30:57,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:57,873 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:57,873 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-01-24 23:30:57,874 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:57,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:57,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:57,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:57,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:30:57,929 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:30:57,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:30:57,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:30:57,930 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:57,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:30:57,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:30:57,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:30:57,930 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-01-24 23:30:58,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:30:58,084 INFO L93 Difference]: Finished difference Result 390 states and 581 transitions. [2018-01-24 23:30:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:30:58,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 23:30:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:30:58,087 INFO L225 Difference]: With dead ends: 390 [2018-01-24 23:30:58,087 INFO L226 Difference]: Without dead ends: 386 [2018-01-24 23:30:58,088 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:30:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-24 23:30:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-01-24 23:30:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-24 23:30:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-01-24 23:30:58,122 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-01-24 23:30:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:30:58,122 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-01-24 23:30:58,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:30:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-01-24 23:30:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 23:30:58,123 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:58,123 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:58,124 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-01-24 23:30:58,124 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:58,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:58,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:58,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:58,125 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:58,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:30:58,191 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:30:58,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:30:58,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:30:58,191 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:58,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:30:58,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:30:58,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:30:58,193 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-01-24 23:30:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:30:58,363 INFO L93 Difference]: Finished difference Result 489 states and 728 transitions. [2018-01-24 23:30:58,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:30:58,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 23:30:58,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:30:58,405 INFO L225 Difference]: With dead ends: 489 [2018-01-24 23:30:58,406 INFO L226 Difference]: Without dead ends: 485 [2018-01-24 23:30:58,406 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:30:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-01-24 23:30:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-01-24 23:30:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-01-24 23:30:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-01-24 23:30:58,440 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-01-24 23:30:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:30:58,440 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-01-24 23:30:58,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:30:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-01-24 23:30:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 23:30:58,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:58,442 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:58,442 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:58,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-01-24 23:30:58,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:58,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:58,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:58,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:58,451 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:58,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:30:58,510 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:30:58,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:30:58,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:30:58,510 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:58,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:30:58,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:30:58,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:30:58,511 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-01-24 23:30:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:30:58,669 INFO L93 Difference]: Finished difference Result 1316 states and 1982 transitions. [2018-01-24 23:30:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:30:58,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 23:30:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:30:58,676 INFO L225 Difference]: With dead ends: 1316 [2018-01-24 23:30:58,676 INFO L226 Difference]: Without dead ends: 861 [2018-01-24 23:30:58,678 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:30:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-01-24 23:30:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-01-24 23:30:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-01-24 23:30:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-01-24 23:30:58,737 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-01-24 23:30:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:30:58,737 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-01-24 23:30:58,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:30:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-01-24 23:30:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:30:58,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:30:58,739 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:30:58,739 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-24 23:30:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-01-24 23:30:58,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:30:58,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:58,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:30:58,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:30:58,740 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:30:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:30:58,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:30:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:30:58,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:30:58,817 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:30:58,818 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 23:30:58,820 INFO L201 CegarAbsIntRunner]: [2], [4], [7], [15], [21], [98], [101], [102], [112], [115], [117], [145], [146], [147], [153], [154], [155], [156], [157] [2018-01-24 23:30:58,863 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:30:58,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:30:59,136 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 23:30:59,139 INFO L268 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 39 variables. [2018-01-24 23:30:59,146 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 23:30:59,313 INFO L232 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 85.7% of their original sizes. [2018-01-24 23:30:59,313 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 23:30:59,333 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 23:30:59,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 23:30:59,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-01-24 23:30:59,334 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:30:59,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:30:59,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:30:59,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:30:59,335 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. Received shutdown request... [2018-01-24 23:32:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:32:01,652 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:32:01,658 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:32:01,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:32:01 BoogieIcfgContainer [2018-01-24 23:32:01,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:32:01,659 INFO L168 Benchmark]: Toolchain (without parser) took 65606.04 ms. Allocated memory was 306.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 266.6 MB in the beginning and 1.2 GB in the end (delta: -960.1 MB). Peak memory consumption was 799.4 MB. Max. memory is 5.3 GB. [2018-01-24 23:32:01,659 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:32:01,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.10 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 254.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:32:01,660 INFO L168 Benchmark]: Boogie Preprocessor took 47.17 ms. Allocated memory is still 306.7 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:32:01,660 INFO L168 Benchmark]: RCFGBuilder took 417.60 ms. Allocated memory is still 306.7 MB. Free memory was 252.6 MB in the beginning and 226.6 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:32:01,660 INFO L168 Benchmark]: TraceAbstraction took 64926.71 ms. Allocated memory was 306.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 225.6 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 758.4 MB. Max. memory is 5.3 GB. [2018-01-24 23:32:01,662 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.17 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.10 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 254.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.17 ms. Allocated memory is still 306.7 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 417.60 ms. Allocated memory is still 306.7 MB. Free memory was 252.6 MB in the beginning and 226.6 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64926.71 ms. Allocated memory was 306.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 225.6 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 758.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 7 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 175 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -14 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 12 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 94 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 15 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.745891 RENAME_VARIABLES(MILLISECONDS) : 0.171811 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.685935 PROJECTAWAY(MILLISECONDS) : 0.045983 ADD_WEAK_EQUALITY(MILLISECONDS) : 4.445370 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.213385 ADD_EQUALITY(MILLISECONDS) : 0.027703 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012294 #CONJOIN_DISJUNCTIVE : 15 #RENAME_VARIABLES : 26 #UNFREEZE : 0 #CONJOIN : 106 #PROJECTAWAY : 25 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 23 #ADD_EQUALITY : 92 #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 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (828states) and interpolant automaton (currently 4 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (237 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 64.8s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 63.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 830 SDtfs, 436 SDslu, 1149 SDs, 0 SdLazy, 266 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 62.5s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=828occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9787581699346404 AbsIntWeakeningRatio, 1.08 AbsIntAvgWeakeningVarsNumRemoved, 9.6 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 141 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 4489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 7/8 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/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-32-01-672.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-32-01-672.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-32-01-672.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.2_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-32-01-672.csv Completed graceful shutdown