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.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:36:00,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:36:00,457 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:36:00,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:36:00,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:36:00,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:36:00,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:36:00,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:36:00,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:36:00,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:36:00,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:36:00,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:36:00,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:36:00,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:36:00,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:36:00,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:36:00,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:36:00,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:36:00,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:36:00,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:36:00,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:36:00,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:36:00,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:36:00,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:36:00,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:36:00,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:36:00,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:36:00,495 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:36:00,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:36:00,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:36:00,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:36:00,497 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.epf [2018-01-24 15:36:00,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:36:00,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:36:00,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:36:00,508 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:36:00,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:36:00,508 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:36:00,508 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:36:00,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:36:00,509 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:36:00,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:36:00,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:36:00,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:36:00,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:36:00,510 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:36:00,510 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:36:00,511 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:36:00,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:36:00,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:36:00,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:36:00,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:36:00,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:36:00,512 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:36:00,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:36:00,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:36:00,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:36:00,513 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:36:00,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:36:00,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:36:00,513 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:36:00,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:36:00,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:36:00,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:36:00,514 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:36:00,515 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:36:00,515 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:36:00,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:36:00,564 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:36:00,568 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:36:00,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:36:00,570 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:36:00,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-24 15:36:00,759 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:36:00,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:36:00,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:36:00,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:36:00,771 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:36:00,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:00,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0999f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00, skipping insertion in model container [2018-01-24 15:36:00,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:00,794 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:36:00,838 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:36:00,953 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:36:00,968 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:36:00,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00 WrapperNode [2018-01-24 15:36:00,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:36:00,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:36:00,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:36:00,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:36:00,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:00,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:01,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:01,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:01,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:01,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:01,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (1/1) ... [2018-01-24 15:36:01,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:36:01,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:36:01,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:36:01,012 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:36:01,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (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 15:36:01,063 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:36:01,064 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:36:01,064 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 15:36:01,064 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:36:01,064 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:36:01,064 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:36:01,064 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:36:01,064 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:36:01,064 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:36:01,064 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:36:01,065 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:36:01,065 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-01-24 15:36:01,065 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-01-24 15:36:01,065 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:36:01,065 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:36:01,065 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-01-24 15:36:01,065 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 15:36:01,065 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:36:01,065 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:36:01,066 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:36:01,200 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 15:36:01,344 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:36:01,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:36:01 BoogieIcfgContainer [2018-01-24 15:36:01,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:36:01,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:36:01,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:36:01,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:36:01,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:36:00" (1/3) ... [2018-01-24 15:36:01,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3482bf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:36:01, skipping insertion in model container [2018-01-24 15:36:01,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:36:00" (2/3) ... [2018-01-24 15:36:01,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3482bf97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:36:01, skipping insertion in model container [2018-01-24 15:36:01,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:36:01" (3/3) ... [2018-01-24 15:36:01,349 INFO L105 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-24 15:36:01,355 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:36:01,361 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 15:36:01,408 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:36:01,408 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:36:01,408 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:36:01,408 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:36:01,409 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:36:01,409 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:36:01,409 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:36:01,409 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:36:01,410 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:36:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-24 15:36:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 15:36:01,437 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:01,438 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 15:36:01,439 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-01-24 15:36:01,447 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:01,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:01,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:01,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:01,489 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:01,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:01,583 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 15:36:01,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:36:01,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:36:01,585 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:36:01,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:36:01,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:36:01,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:36:01,632 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-24 15:36:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:01,798 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-24 15:36:01,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:36:01,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 15:36:01,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:01,888 INFO L225 Difference]: With dead ends: 65 [2018-01-24 15:36:01,888 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 15:36:01,892 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 15:36:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 15:36:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 15:36:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 15:36:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-24 15:36:01,927 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-01-24 15:36:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:01,928 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-24 15:36:01,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:36:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-24 15:36:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 15:36:01,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:01,928 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 15:36:01,929 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-01-24 15:36:01,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:01,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:01,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:01,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:01,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:01,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:02,029 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 15:36:02,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:36:02,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:36:02,029 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:36:02,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:36:02,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:36:02,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:36:02,032 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-01-24 15:36:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:02,089 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-01-24 15:36:02,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:36:02,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 15:36:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:02,091 INFO L225 Difference]: With dead ends: 57 [2018-01-24 15:36:02,091 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 15:36:02,092 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 15:36:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 15:36:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 15:36:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 15:36:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-01-24 15:36:02,101 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-01-24 15:36:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:02,101 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-01-24 15:36:02,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:36:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-01-24 15:36:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:36:02,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:02,102 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:36:02,102 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-01-24 15:36:02,103 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:02,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:02,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,104 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:02,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:02,225 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 15:36:02,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:36:02,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:36:02,226 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:36:02,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:36:02,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:36:02,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:36:02,227 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-01-24 15:36:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:02,293 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-01-24 15:36:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:36:02,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 15:36:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:02,294 INFO L225 Difference]: With dead ends: 53 [2018-01-24 15:36:02,294 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:36:02,295 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 15:36:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:36:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 15:36:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:36:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-01-24 15:36:02,301 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-01-24 15:36:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:02,301 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-01-24 15:36:02,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:36:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-01-24 15:36:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:36:02,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:02,302 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:36:02,302 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-01-24 15:36:02,303 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:02,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:02,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,304 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:02,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:02,406 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 15:36:02,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:36:02,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:36:02,406 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:36:02,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:36:02,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:36:02,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:36:02,407 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-01-24 15:36:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:02,486 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-01-24 15:36:02,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:36:02,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:36:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:02,488 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:36:02,488 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 15:36:02,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:36:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 15:36:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 15:36:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:36:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-01-24 15:36:02,496 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-01-24 15:36:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:02,496 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-01-24 15:36:02,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:36:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-01-24 15:36:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:36:02,497 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:02,497 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:36:02,497 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:02,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-01-24 15:36:02,497 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:02,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:02,499 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,499 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:02,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:02,731 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 15:36:02,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:36:02,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:36:02,732 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:36:02,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:36:02,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:36:02,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:36:02,733 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 8 states. [2018-01-24 15:36:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:02,851 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-01-24 15:36:02,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:36:02,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 15:36:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:02,852 INFO L225 Difference]: With dead ends: 49 [2018-01-24 15:36:02,852 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:36:02,852 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:36:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:36:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:36:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:36:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 15:36:02,858 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 15 [2018-01-24 15:36:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:02,858 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 15:36:02,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:36:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 15:36:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:36:02,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:02,859 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, 1, 1, 1, 1] [2018-01-24 15:36:02,859 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:02,859 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-01-24 15:36:02,859 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:02,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:02,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,860 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:02,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:02,925 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 15:36:02,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:36:02,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:36:02,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:36:02,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:36:02,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:36:02,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:36:02,926 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2018-01-24 15:36:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:02,980 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-01-24 15:36:02,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:36:02,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-24 15:36:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:02,982 INFO L225 Difference]: With dead ends: 46 [2018-01-24 15:36:02,982 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 15:36:02,982 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 15:36:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 15:36:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 15:36:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 15:36:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-01-24 15:36:02,990 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-01-24 15:36:02,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:02,990 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-01-24 15:36:02,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:36:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-01-24 15:36:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:36:02,992 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:02,992 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, 1, 1, 1, 1] [2018-01-24 15:36:02,992 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:02,992 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-01-24 15:36:02,992 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:02,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:02,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:02,994 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:03,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:03,063 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 15:36:03,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:36:03,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:36:03,064 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:36:03,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:36:03,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:36:03,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:36:03,065 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 4 states. [2018-01-24 15:36:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:03,092 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-01-24 15:36:03,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:36:03,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 15:36:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:03,094 INFO L225 Difference]: With dead ends: 74 [2018-01-24 15:36:03,094 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:36:03,095 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 15:36:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:36:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:36:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:36:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 15:36:03,101 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-01-24 15:36:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:03,101 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 15:36:03,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:36:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 15:36:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:36:03,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:03,102 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:36:03,102 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:03,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1523422321, now seen corresponding path program 1 times [2018-01-24 15:36:03,102 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:03,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:03,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:03,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:03,103 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:03,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:03,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:36:03,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:36:03,202 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:36:03,203 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 15:36:03,205 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [12], [13], [14], [15], [19], [21], [22], [24], [28], [42], [43], [44], [47], [50], [53], [56], [60], [61], [62], [63], [66], [67], [68] [2018-01-24 15:36:03,267 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:36:03,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:36:26,490 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:36:26,491 INFO L268 AbstractInterpreter]: Visited 28 different actions 52 times. Merged at 11 different actions 21 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 26 variables. [2018-01-24 15:36:26,506 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:36:26,506 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:36:26,506 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 15:36:26,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:26,524 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:36:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:26,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:36:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:36:26,609 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:36:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:36:26,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:36:26,785 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:36:26,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:26,796 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:36:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:26,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:36:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:36:26,867 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:36:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:36:26,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:36:26,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 11 [2018-01-24 15:36:26,956 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:36:26,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:36:26,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:36:26,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:36:26,957 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 8 states. [2018-01-24 15:36:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:27,012 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-01-24 15:36:27,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:36:27,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 15:36:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:27,015 INFO L225 Difference]: With dead ends: 77 [2018-01-24 15:36:27,015 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 15:36:27,016 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:36:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 15:36:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 15:36:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 15:36:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-24 15:36:27,022 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 28 [2018-01-24 15:36:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:27,023 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-24 15:36:27,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:36:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-24 15:36:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:36:27,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:27,024 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 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 15:36:27,024 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash -944250098, now seen corresponding path program 2 times [2018-01-24 15:36:27,024 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:27,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:27,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:27,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:27,026 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:27,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:36:27,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:36:27,120 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:36:27,120 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:36:27,121 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:36:27,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:36:27,121 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:36:27,129 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:36:27,130 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:36:27,156 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:36:27,159 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:36:27,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:36:27,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:36:27,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:36:27,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:36:27,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:36:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:36:27,211 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:36:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:36:27,273 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:36:27,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 8 [2018-01-24 15:36:27,273 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:36:27,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:36:27,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:36:27,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:36:27,274 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 3 states. [2018-01-24 15:36:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:36:27,297 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-24 15:36:27,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:36:27,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-24 15:36:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:36:27,298 INFO L225 Difference]: With dead ends: 48 [2018-01-24 15:36:27,298 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:36:27,298 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:36:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:36:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:36:27,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:36:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 15:36:27,305 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 29 [2018-01-24 15:36:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:36:27,305 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 15:36:27,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:36:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 15:36:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 15:36:27,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:36:27,307 INFO L322 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 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 15:36:27,307 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 15:36:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2111815019, now seen corresponding path program 1 times [2018-01-24 15:36:27,307 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:36:27,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:27,308 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:36:27,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:36:27,309 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:36:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:27,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:36:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 15:36:27,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:36:27,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:36:27,426 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-24 15:36:27,427 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [12], [13], [14], [15], [19], [21], [22], [24], [30], [31], [35], [42], [43], [44], [47], [50], [53], [56], [60], [61], [62], [63], [64], [65], [66], [67], [68] [2018-01-24 15:36:27,428 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:36:27,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 15:36:50,049 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 15:36:50,050 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 15:36:50,050 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:36:50,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:36:50,050 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:36:50,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:36:50,055 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:36:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:36:50,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:36:50,106 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 15:36:50,107 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:36:50,110 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:36:50,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:36:50 BoogieIcfgContainer [2018-01-24 15:36:50,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:36:50,111 INFO L168 Benchmark]: Toolchain (without parser) took 49352.42 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 259.9 MB in the beginning and 844.9 MB in the end (delta: -585.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-24 15:36:50,112 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:36:50,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.37 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 248.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:36:50,112 INFO L168 Benchmark]: Boogie Preprocessor took 34.33 ms. Allocated memory is still 299.9 MB. Free memory was 248.0 MB in the beginning and 246.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:36:50,112 INFO L168 Benchmark]: RCFGBuilder took 331.97 ms. Allocated memory is still 299.9 MB. Free memory was 246.0 MB in the beginning and 225.4 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:36:50,113 INFO L168 Benchmark]: TraceAbstraction took 48766.05 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 225.4 MB in the beginning and 844.9 MB in the end (delta: -619.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-24 15:36:50,114 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.19 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.37 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 248.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.33 ms. Allocated memory is still 299.9 MB. Free memory was 248.0 MB in the beginning and 246.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 331.97 ms. Allocated memory is still 299.9 MB. Free memory was 246.0 MB in the beginning and 225.4 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48766.05 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 225.4 MB in the beginning and 844.9 MB in the end (delta: -619.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 16 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 381 LocStat_NO_SUPPORTING_DISEQUALITIES : 163 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 94 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.912108 RENAME_VARIABLES(MILLISECONDS) : 0.117092 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.378815 PROJECTAWAY(MILLISECONDS) : 0.040234 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.029509 DISJOIN(MILLISECONDS) : 2.448277 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.137064 ADD_EQUALITY(MILLISECONDS) : 0.016278 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005672 #CONJOIN_DISJUNCTIVE : 89 #RENAME_VARIABLES : 172 #UNFREEZE : 0 #CONJOIN : 228 #PROJECTAWAY : 146 #ADD_WEAK_EQUALITY : 46 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 170 #ADD_EQUALITY : 121 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. TIMEOUT Result, 48.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 337 SDtfs, 117 SDslu, 342 SDs, 0 SdLazy, 224 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 45.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 247 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 13711 SizeOfPredicates, 3 NumberOfNonLiveVariables, 498 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 6/14 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/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-36-50-125.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-36-50-125.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-36-50-125.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-36-50-125.csv Completed graceful shutdown