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_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:18:10,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:18:10,360 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:18:10,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:18:10,385 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:18:10,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:18:10,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:18:10,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:18:10,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:18:10,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:18:10,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:18:10,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:18:10,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:18:10,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:18:10,404 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:18:10,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:18:10,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:18:10,418 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:18:10,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:18:10,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:18:10,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:18:10,428 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:18:10,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:18:10,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:18:10,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:18:10,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:18:10,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:18:10,446 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:18:10,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:18:10,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:18:10,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:18:10,456 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_preciseopt.epf [2018-01-25 03:18:10,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:18:10,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:18:10,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:18:10,480 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:18:10,481 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:18:10,481 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:18:10,481 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:18:10,481 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:18:10,481 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:18:10,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:18:10,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:18:10,482 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:18:10,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:18:10,483 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:18:10,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:18:10,484 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:18:10,484 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:18:10,484 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:18:10,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:18:10,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:18:10,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:18:10,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:18:10,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:18:10,485 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:18:10,486 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:18:10,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:18:10,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:18:10,486 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:18:10,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:18:10,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:18:10,487 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:18:10,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:18:10,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:18:10,487 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:18:10,487 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:18:10,488 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:18:10,488 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:18:10,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:18:10,569 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:18:10,577 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:18:10,579 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:18:10,579 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:18:10,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-01-25 03:18:10,820 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:18:10,828 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:18:10,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:18:10,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:18:10,837 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:18:10,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:18:10" (1/1) ... [2018-01-25 03:18:10,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60552eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:10, skipping insertion in model container [2018-01-25 03:18:10,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:18:10" (1/1) ... [2018-01-25 03:18:10,861 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:18:10,922 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:18:11,058 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:18:11,080 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:18:11,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11 WrapperNode [2018-01-25 03:18:11,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:18:11,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:18:11,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:18:11,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:18:11,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (1/1) ... [2018-01-25 03:18:11,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (1/1) ... [2018-01-25 03:18:11,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (1/1) ... [2018-01-25 03:18:11,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (1/1) ... [2018-01-25 03:18:11,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (1/1) ... [2018-01-25 03:18:11,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (1/1) ... [2018-01-25 03:18:11,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (1/1) ... [2018-01-25 03:18:11,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:18:11,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:18:11,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:18:11,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:18:11,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:18:11,187 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:18:11,187 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:18:11,187 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-25 03:18:11,188 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 03:18:11,188 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:18:11,189 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:18:11,189 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:18:11,189 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-25 03:18:11,189 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:18:11,189 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:18:11,189 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:18:11,835 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:18:11,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:18:11 BoogieIcfgContainer [2018-01-25 03:18:11,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:18:11,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:18:11,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:18:11,839 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:18:11,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:18:10" (1/3) ... [2018-01-25 03:18:11,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b5cff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:18:11, skipping insertion in model container [2018-01-25 03:18:11,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:18:11" (2/3) ... [2018-01-25 03:18:11,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b5cff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:18:11, skipping insertion in model container [2018-01-25 03:18:11,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:18:11" (3/3) ... [2018-01-25 03:18:11,843 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_1_true-valid-memsafety.i [2018-01-25 03:18:11,849 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:18:11,856 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2018-01-25 03:18:11,951 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:18:11,951 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:18:11,951 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:18:11,952 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:18:11,952 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:18:11,952 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:18:11,952 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:18:11,952 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:18:11,953 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:18:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2018-01-25 03:18:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:18:12,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:12,008 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:18:12,009 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1146304688, now seen corresponding path program 1 times [2018-01-25 03:18:12,017 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:12,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:12,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:12,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:12,084 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:12,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:12,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:12,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:18:12,216 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:12,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:18:12,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:18:12,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:18:12,239 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 2 states. [2018-01-25 03:18:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:12,377 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2018-01-25 03:18:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:18:12,378 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-25 03:18:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:12,388 INFO L225 Difference]: With dead ends: 175 [2018-01-25 03:18:12,388 INFO L226 Difference]: Without dead ends: 93 [2018-01-25 03:18:12,392 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-25 03:18:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-25 03:18:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-25 03:18:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 03:18:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-01-25 03:18:12,436 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 13 [2018-01-25 03:18:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:12,436 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-01-25 03:18:12,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:18:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-01-25 03:18:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:18:12,438 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:12,438 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:18:12,438 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2120728880, now seen corresponding path program 1 times [2018-01-25 03:18:12,439 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:12,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:12,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:12,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:12,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:12,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:12,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:12,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:18:12,686 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:12,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:18:12,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:18:12,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:18:12,689 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 5 states. [2018-01-25 03:18:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:13,491 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-01-25 03:18:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:18:13,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:18:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:13,494 INFO L225 Difference]: With dead ends: 130 [2018-01-25 03:18:13,494 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 03:18:13,495 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:18:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 03:18:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-01-25 03:18:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 03:18:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-01-25 03:18:13,506 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 15 [2018-01-25 03:18:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:13,506 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-01-25 03:18:13,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:18:13,506 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-01-25 03:18:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:18:13,507 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:13,507 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:18:13,507 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:13,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2120728879, now seen corresponding path program 1 times [2018-01-25 03:18:13,507 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:13,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:13,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:13,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:13,509 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:13,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:13,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:13,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:18:13,652 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:13,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:18:13,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:18:13,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:18:13,653 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 5 states. [2018-01-25 03:18:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:14,126 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-01-25 03:18:14,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:18:14,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:18:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:14,128 INFO L225 Difference]: With dead ends: 150 [2018-01-25 03:18:14,128 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 03:18:14,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:18:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 03:18:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2018-01-25 03:18:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:18:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-01-25 03:18:14,142 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 15 [2018-01-25 03:18:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:14,142 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-01-25 03:18:14,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:18:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-01-25 03:18:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:18:14,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:14,145 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:18:14,145 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1313389118, now seen corresponding path program 1 times [2018-01-25 03:18:14,145 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:14,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:14,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:14,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:14,147 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:14,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:14,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:14,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:18:14,266 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:14,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:18:14,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:18:14,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:18:14,267 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 7 states. [2018-01-25 03:18:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:15,196 INFO L93 Difference]: Finished difference Result 236 states and 263 transitions. [2018-01-25 03:18:15,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:18:15,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 03:18:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:15,201 INFO L225 Difference]: With dead ends: 236 [2018-01-25 03:18:15,201 INFO L226 Difference]: Without dead ends: 233 [2018-01-25 03:18:15,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:18:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-25 03:18:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 127. [2018-01-25 03:18:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-25 03:18:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-01-25 03:18:15,220 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 26 [2018-01-25 03:18:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:15,221 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-01-25 03:18:15,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:18:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-01-25 03:18:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:18:15,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:15,223 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:18:15,223 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1313389119, now seen corresponding path program 1 times [2018-01-25 03:18:15,223 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:15,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:15,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:15,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:15,225 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:15,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:15,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:15,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:18:15,421 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:15,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:18:15,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:18:15,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:18:15,422 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 7 states. [2018-01-25 03:18:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:16,087 INFO L93 Difference]: Finished difference Result 256 states and 285 transitions. [2018-01-25 03:18:16,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:18:16,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 03:18:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:16,091 INFO L225 Difference]: With dead ends: 256 [2018-01-25 03:18:16,091 INFO L226 Difference]: Without dead ends: 248 [2018-01-25 03:18:16,092 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:18:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-25 03:18:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 108. [2018-01-25 03:18:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 03:18:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2018-01-25 03:18:16,104 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 26 [2018-01-25 03:18:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:16,105 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2018-01-25 03:18:16,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:18:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2018-01-25 03:18:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:18:16,106 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:16,106 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] [2018-01-25 03:18:16,106 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:16,107 INFO L82 PathProgramCache]: Analyzing trace with hash 356417959, now seen corresponding path program 1 times [2018-01-25 03:18:16,107 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:16,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:16,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:16,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:16,108 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:16,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:16,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:16,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:18:16,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:16,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:18:16,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:18:16,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:18:16,367 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 7 states. [2018-01-25 03:18:16,580 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-25 03:18:16,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:16,752 INFO L93 Difference]: Finished difference Result 237 states and 259 transitions. [2018-01-25 03:18:16,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:18:16,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-25 03:18:16,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:16,754 INFO L225 Difference]: With dead ends: 237 [2018-01-25 03:18:16,754 INFO L226 Difference]: Without dead ends: 191 [2018-01-25 03:18:16,755 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:18:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-25 03:18:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 122. [2018-01-25 03:18:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:18:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-01-25 03:18:16,770 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 28 [2018-01-25 03:18:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:16,770 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-01-25 03:18:16,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:18:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-01-25 03:18:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:18:16,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:16,772 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-25 03:18:16,772 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:16,773 INFO L82 PathProgramCache]: Analyzing trace with hash 167170662, now seen corresponding path program 1 times [2018-01-25 03:18:16,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:16,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:16,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:16,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:16,775 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:16,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:16,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:16,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:18:16,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:16,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:18:16,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:18:16,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:18:16,976 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 7 states. [2018-01-25 03:18:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:17,325 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2018-01-25 03:18:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:18:17,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 03:18:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:17,326 INFO L225 Difference]: With dead ends: 163 [2018-01-25 03:18:17,326 INFO L226 Difference]: Without dead ends: 161 [2018-01-25 03:18:17,327 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:18:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-25 03:18:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-01-25 03:18:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 03:18:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-01-25 03:18:17,342 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 30 [2018-01-25 03:18:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:17,342 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-01-25 03:18:17,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:18:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-01-25 03:18:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:18:17,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:17,344 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-25 03:18:17,344 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:17,344 INFO L82 PathProgramCache]: Analyzing trace with hash 167170663, now seen corresponding path program 1 times [2018-01-25 03:18:17,344 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:17,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:17,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:17,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:17,346 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:17,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:17,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:17,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:18:17,467 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:17,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:18:17,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:18:17,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:18:17,468 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 7 states. [2018-01-25 03:18:17,743 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-25 03:18:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:18,487 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2018-01-25 03:18:18,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:18:18,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 03:18:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:18,488 INFO L225 Difference]: With dead ends: 179 [2018-01-25 03:18:18,489 INFO L226 Difference]: Without dead ends: 174 [2018-01-25 03:18:18,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:18:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-25 03:18:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 103. [2018-01-25 03:18:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 03:18:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2018-01-25 03:18:18,496 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 30 [2018-01-25 03:18:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:18,497 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2018-01-25 03:18:18,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:18:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2018-01-25 03:18:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:18:18,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:18,498 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, 1, 1] [2018-01-25 03:18:18,498 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1351001059, now seen corresponding path program 1 times [2018-01-25 03:18:18,499 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:18,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:18,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:18,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:18,500 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:18,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:18,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:18,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:18:18,594 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:18,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:18:18,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:18:18,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:18:18,594 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 7 states. [2018-01-25 03:18:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:18,743 INFO L93 Difference]: Finished difference Result 194 states and 210 transitions. [2018-01-25 03:18:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:18:18,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-25 03:18:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:18,744 INFO L225 Difference]: With dead ends: 194 [2018-01-25 03:18:18,744 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 03:18:18,745 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:18:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 03:18:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. [2018-01-25 03:18:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 03:18:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-01-25 03:18:18,753 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 31 [2018-01-25 03:18:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:18,754 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-01-25 03:18:18,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:18:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-01-25 03:18:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 03:18:18,755 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:18,756 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:18:18,756 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash 730013695, now seen corresponding path program 1 times [2018-01-25 03:18:18,756 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:18,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:18,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:18,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:18,758 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:18,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:19,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:18:19,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:18:19,070 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:18:19,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:18:19,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:18:19,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:18:19,072 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2018-01-25 03:18:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:18:19,503 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-01-25 03:18:19,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:18:19,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-25 03:18:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:18:19,505 INFO L225 Difference]: With dead ends: 136 [2018-01-25 03:18:19,505 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 03:18:19,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:18:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 03:18:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-01-25 03:18:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 03:18:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-01-25 03:18:19,517 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 36 [2018-01-25 03:18:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:18:19,518 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-01-25 03:18:19,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:18:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-01-25 03:18:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 03:18:19,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:18:19,520 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-01-25 03:18:19,520 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 03:18:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash 150288015, now seen corresponding path program 1 times [2018-01-25 03:18:19,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:18:19,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:19,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:18:19,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:18:19,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:18:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:18:19,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:18:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:18:19,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:18:19,863 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:18:19,864 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-25 03:18:19,866 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [25], [52], [54], [57], [63], [65], [66], [69], [70], [76], [78], [81], [84], [88], [91], [94], [98], [100], [101], [107], [108], [111], [180], [181], [191], [192], [193] [2018-01-25 03:18:19,917 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:18:19,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 03:19:12,054 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 03:19:12,054 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 03:19:12,056 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:19:12,056 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:19:12,056 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:19:12,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:12,063 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:19:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:12,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:19:12,154 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:19:12,154 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:19:12,161 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:19:12,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:19:12 BoogieIcfgContainer [2018-01-25 03:19:12,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:19:12,164 INFO L168 Benchmark]: Toolchain (without parser) took 61343.29 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 264.0 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 851.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:12,165 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:19:12,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.45 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:12,166 INFO L168 Benchmark]: Boogie Preprocessor took 38.03 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:12,168 INFO L168 Benchmark]: RCFGBuilder took 703.77 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 221.1 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:12,169 INFO L168 Benchmark]: TraceAbstraction took 60326.06 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 221.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 808.4 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:12,171 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.24 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 264.45 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.03 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 703.77 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 221.1 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60326.06 ms. Allocated memory was 305.1 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 221.1 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 808.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 35 error locations. TIMEOUT Result, 60.2s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 768 SDtfs, 1507 SDslu, 1861 SDs, 0 SdLazy, 1900 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 52.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 524 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 30347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 24/24 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/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-19-12-183.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-19-12-183.csv Completed graceful shutdown