java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:09:15,580 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:09:15,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:09:15,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:09:15,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:09:15,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:09:15,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:09:15,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:09:15,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:09:15,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:09:15,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:09:15,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:09:15,616 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:09:15,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:09:15,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:09:15,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:09:15,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:09:15,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:09:15,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:09:15,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:09:15,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:09:15,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:09:15,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:09:15,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:09:15,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:09:15,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:09:15,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:09:15,654 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:09:15,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:09:15,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:09:15,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:09:15,656 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-24 23:09:15,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:09:15,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:09:15,673 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:09:15,673 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:09:15,673 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:09:15,673 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:09:15,674 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:09:15,674 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:09:15,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:09:15,675 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:09:15,677 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:09:15,677 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:09:15,677 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:09:15,677 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:09:15,678 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:09:15,678 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:09:15,678 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:09:15,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:09:15,678 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:09:15,679 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:09:15,679 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:09:15,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:09:15,679 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:09:15,679 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:09:15,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:09:15,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:09:15,680 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:09:15,681 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:09:15,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:09:15,681 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:09:15,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:09:15,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:09:15,681 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:09:15,682 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:09:15,682 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:09:15,683 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:09:15,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:09:15,766 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:09:15,771 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:09:15,773 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:09:15,773 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:09:15,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:09:15,984 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:09:15,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:09:15,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:09:15,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:09:16,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:09:16,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:09:15" (1/1) ... [2018-01-24 23:09:16,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ca4782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16, skipping insertion in model container [2018-01-24 23:09:16,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:09:15" (1/1) ... [2018-01-24 23:09:16,025 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:09:16,096 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:09:16,259 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:09:16,279 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:09:16,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16 WrapperNode [2018-01-24 23:09:16,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:09:16,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:09:16,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:09:16,289 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:09:16,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (1/1) ... [2018-01-24 23:09:16,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (1/1) ... [2018-01-24 23:09:16,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (1/1) ... [2018-01-24 23:09:16,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (1/1) ... [2018-01-24 23:09:16,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (1/1) ... [2018-01-24 23:09:16,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (1/1) ... [2018-01-24 23:09:16,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (1/1) ... [2018-01-24 23:09:16,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:09:16,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:09:16,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:09:16,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:09:16,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:09:16,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:09:16,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:09:16,404 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 23:09:16,404 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:09:16,404 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:09:16,405 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:09:16,405 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:09:16,405 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:09:16,405 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:09:16,405 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:09:16,405 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 23:09:16,406 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:09:16,406 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:09:16,406 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:09:16,650 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:09:16,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:09:16 BoogieIcfgContainer [2018-01-24 23:09:16,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:09:16,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:09:16,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:09:16,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:09:16,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:09:15" (1/3) ... [2018-01-24 23:09:16,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66668f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:09:16, skipping insertion in model container [2018-01-24 23:09:16,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:09:16" (2/3) ... [2018-01-24 23:09:16,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66668f59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:09:16, skipping insertion in model container [2018-01-24 23:09:16,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:09:16" (3/3) ... [2018-01-24 23:09:16,657 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:09:16,668 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:09:16,677 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 23:09:16,728 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:09:16,728 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:09:16,728 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:09:16,729 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:09:16,729 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:09:16,729 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:09:16,729 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:09:16,729 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:09:16,730 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:09:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 23:09:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 23:09:16,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:16,761 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:16,761 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:16,767 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 23:09:16,770 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:16,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:16,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:16,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:16,838 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:16,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:16,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:16,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:09:16,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:16,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:09:16,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:09:16,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:09:16,991 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 23:09:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:17,115 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 23:09:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:09:17,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 23:09:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:17,219 INFO L225 Difference]: With dead ends: 57 [2018-01-24 23:09:17,219 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 23:09:17,223 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:09:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 23:09:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 23:09:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 23:09:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 23:09:17,254 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 23:09:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:17,254 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 23:09:17,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:09:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 23:09:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 23:09:17,255 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:17,255 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:17,255 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 23:09:17,255 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:17,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:17,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,257 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:17,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:17,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:17,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:09:17,301 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:17,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:09:17,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:09:17,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:09:17,303 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 23:09:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:17,379 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 23:09:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:09:17,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 23:09:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:17,380 INFO L225 Difference]: With dead ends: 40 [2018-01-24 23:09:17,380 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 23:09:17,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:09:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 23:09:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 23:09:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 23:09:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 23:09:17,387 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 23:09:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:17,388 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 23:09:17,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:09:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 23:09:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:09:17,389 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:17,389 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:17,389 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 23:09:17,389 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:17,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:17,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,391 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:17,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:17,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:17,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:09:17,449 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:17,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:09:17,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:09:17,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:09:17,450 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 23:09:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:17,513 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 23:09:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:09:17,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:09:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:17,514 INFO L225 Difference]: With dead ends: 37 [2018-01-24 23:09:17,514 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 23:09:17,515 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:09:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 23:09:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 23:09:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 23:09:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 23:09:17,520 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 23:09:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:17,521 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 23:09:17,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:09:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 23:09:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:09:17,521 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:17,522 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:17,522 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:17,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 23:09:17,522 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:17,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:17,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,524 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:17,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:17,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:17,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:09:17,650 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:17,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:09:17,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:09:17,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:09:17,651 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 23:09:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:17,703 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 23:09:17,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:09:17,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:09:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:17,705 INFO L225 Difference]: With dead ends: 36 [2018-01-24 23:09:17,705 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 23:09:17,706 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:09:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 23:09:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 23:09:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 23:09:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 23:09:17,711 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 23:09:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:17,711 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 23:09:17,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:09:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 23:09:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:09:17,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:17,712 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:17,712 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:17,712 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-01-24 23:09:17,712 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:17,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:17,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,714 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:17,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:17,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:17,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:09:17,774 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:17,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:09:17,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:09:17,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:09:17,775 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-24 23:09:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:17,924 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 23:09:17,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:09:17,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 23:09:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:17,925 INFO L225 Difference]: With dead ends: 35 [2018-01-24 23:09:17,925 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 23:09:17,926 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:09:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 23:09:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 23:09:17,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 23:09:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 23:09:17,931 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-01-24 23:09:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:17,932 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 23:09:17,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:09:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 23:09:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:09:17,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:17,933 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:17,933 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-01-24 23:09:17,934 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:17,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:17,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:17,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:17,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:18,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:18,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:09:18,069 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:18,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:09:18,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:09:18,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:09:18,070 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-01-24 23:09:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:18,206 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 23:09:18,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:09:18,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 23:09:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:18,208 INFO L225 Difference]: With dead ends: 42 [2018-01-24 23:09:18,208 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 23:09:18,209 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:09:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 23:09:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-01-24 23:09:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 23:09:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 23:09:18,216 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-01-24 23:09:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:18,216 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 23:09:18,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:09:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 23:09:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:09:18,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:18,217 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:18,217 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-01-24 23:09:18,218 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:18,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:18,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:18,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:18,219 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:18,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:18,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:18,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:09:18,370 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:18,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:09:18,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:09:18,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:09:18,370 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-01-24 23:09:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:18,491 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 23:09:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:09:18,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 23:09:18,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:18,493 INFO L225 Difference]: With dead ends: 37 [2018-01-24 23:09:18,493 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 23:09:18,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:09:18,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 23:09:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 23:09:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 23:09:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 23:09:18,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-01-24 23:09:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:18,499 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 23:09:18,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:09:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 23:09:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:09:18,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:18,500 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:18,500 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:18,501 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-01-24 23:09:18,501 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:18,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:18,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:18,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:18,502 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:18,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:18,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:18,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:09:18,665 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:18,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:09:18,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:09:18,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:09:18,666 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-01-24 23:09:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:18,851 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 23:09:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:09:18,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 23:09:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:18,853 INFO L225 Difference]: With dead ends: 39 [2018-01-24 23:09:18,853 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 23:09:18,853 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:09:18,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 23:09:18,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 23:09:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 23:09:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 23:09:18,864 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-01-24 23:09:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:18,864 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 23:09:18,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:09:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 23:09:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:09:18,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:18,865 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:18,865 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:18,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-01-24 23:09:18,866 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:18,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:18,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:18,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:18,867 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:18,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:19,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:09:19,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:09:19,098 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:09:19,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 23:09:19,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 23:09:19,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:09:19,099 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-24 23:09:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:09:19,475 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-01-24 23:09:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:09:19,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-24 23:09:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:09:19,476 INFO L225 Difference]: With dead ends: 77 [2018-01-24 23:09:19,476 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 23:09:19,477 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-24 23:09:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 23:09:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-24 23:09:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:09:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-24 23:09:19,486 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-01-24 23:09:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:09:19,487 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-24 23:09:19,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 23:09:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-24 23:09:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:09:19,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:09:19,488 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:09:19,488 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:09:19,489 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-01-24 23:09:19,489 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:09:19,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:19,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:19,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:09:19,490 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:09:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:19,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:09:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:19,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:09:19,773 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:09:19,774 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 23:09:19,776 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [7], [9], [10], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-24 23:09:19,824 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:09:19,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:09:57,212 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:09:57,219 INFO L268 AbstractInterpreter]: Visited 22 different actions 40 times. Merged at 6 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-24 23:09:57,268 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:09:57,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:09:57,268 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:09:57,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:57,282 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:09:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:57,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:09:57,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 23:09:57,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 23:09:57,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:09:57,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:09:57,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 23:09:57,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 23:09:57,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 23:09:57,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:09:57,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:09:57,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:09:57,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:09:57,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 23:09:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:57,939 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:09:58,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 23:09:58,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:09:58,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:09:58,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,187 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 23:09:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:58,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:09:58,215 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 23:09:58,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:58,220 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:09:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:58,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:09:58,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:09:58,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 23:09:58,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:09:58,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 23:09:58,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:09:58,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 23:09:58,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 23:09:58,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 23:09:58,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:09:58,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:09:58,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:09:58,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 23:09:58,663 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-24 23:09:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:58,854 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:09:59,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:09:59,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:09:59,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:09:59,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:09:59,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:09:59,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 23:09:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:09:59,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 23:09:59,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 37 [2018-01-24 23:09:59,133 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:09:59,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 23:09:59,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 23:09:59,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 23:09:59,140 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 17 states. [2018-01-24 23:10:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:10:00,092 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 23:10:00,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 23:10:00,092 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-24 23:10:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:10:00,095 INFO L225 Difference]: With dead ends: 61 [2018-01-24 23:10:00,095 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 23:10:00,096 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 23:10:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 23:10:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-24 23:10:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 23:10:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 23:10:00,110 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-01-24 23:10:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:10:00,110 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 23:10:00,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 23:10:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 23:10:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 23:10:00,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:10:00,112 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:10:00,112 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:10:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-01-24 23:10:00,112 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:10:00,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:10:00,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:10:00,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:10:00,114 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:10:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:10:00,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:10:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:10:00,406 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:10:00,406 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:10:00,406 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 23:10:00,406 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [7], [10], [12], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-24 23:10:00,407 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:10:00,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 23:10:08,481 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 23:10:08,482 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 23:10:08,482 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:10:08,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:10:08,482 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:10:08,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:10:08,488 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:10:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:10:08,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:10:08,512 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:10:08,512 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:10:08,515 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:10:08,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:10:08 BoogieIcfgContainer [2018-01-24 23:10:08,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:10:08,517 INFO L168 Benchmark]: Toolchain (without parser) took 52531.59 ms. Allocated memory was 306.2 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 265.9 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 294.4 MB. Max. memory is 5.3 GB. [2018-01-24 23:10:08,517 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:10:08,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.96 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 254.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-24 23:10:08,517 INFO L168 Benchmark]: Boogie Preprocessor took 51.04 ms. Allocated memory is still 306.2 MB. Free memory was 254.7 MB in the beginning and 253.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-24 23:10:08,518 INFO L168 Benchmark]: RCFGBuilder took 311.05 ms. Allocated memory is still 306.2 MB. Free memory was 253.7 MB in the beginning and 236.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:10:08,518 INFO L168 Benchmark]: TraceAbstraction took 51864.38 ms. Allocated memory was 306.2 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 236.7 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 265.2 MB. Max. memory is 5.3 GB. [2018-01-24 23:10:08,519 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.22 ms. Allocated memory is still 306.2 MB. Free memory is still 271.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 294.96 ms. Allocated memory is still 306.2 MB. Free memory was 264.9 MB in the beginning and 254.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.04 ms. Allocated memory is still 306.2 MB. Free memory was 254.7 MB in the beginning and 253.7 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 311.05 ms. Allocated memory is still 306.2 MB. Free memory was 253.7 MB in the beginning and 236.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51864.38 ms. Allocated memory was 306.2 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 236.7 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 265.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 244 LocStat_NO_SUPPORTING_DISEQUALITIES : 37 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 7.757643 RENAME_VARIABLES(MILLISECONDS) : 1.293186 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 7.706057 PROJECTAWAY(MILLISECONDS) : 833.747532 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.071914 DISJOIN(MILLISECONDS) : 0.800995 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.325928 ADD_EQUALITY(MILLISECONDS) : 0.030205 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013992 #CONJOIN_DISJUNCTIVE : 72 #RENAME_VARIABLES : 128 #UNFREEZE : 0 #CONJOIN : 126 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 64 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 544). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 544). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 544). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 560). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 560). Cancelled while BasicCegarLoop was analyzing trace of length 26 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, 40 locations, 7 error locations. TIMEOUT Result, 51.7s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 292 SDtfs, 284 SDslu, 899 SDs, 0 SdLazy, 653 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 45.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 256 ConstructedInterpolants, 9 QuantifiedInterpolants, 34239 SizeOfPredicates, 27 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 3/18 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/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-10-08-527.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-10-08-527.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-10-08-527.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-10-08-527.csv Completed graceful shutdown