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_mostprecise.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 19:45:09,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:45:09,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:45:09,139 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:45:09,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:45:09,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:45:09,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:45:09,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:45:09,144 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:45:09,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:45:09,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:45:09,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:45:09,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:45:09,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:45:09,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:45:09,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:45:09,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:45:09,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:45:09,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:45:09,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:45:09,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:45:09,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:45:09,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:45:09,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:45:09,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:45:09,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:45:09,164 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:45:09,164 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:45:09,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:45:09,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:45:09,165 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:45:09,165 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_mostprecise.epf [2018-01-24 19:45:09,175 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:45:09,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:45:09,177 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:45:09,177 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:45:09,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:45:09,177 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:45:09,178 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:45:09,178 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:45:09,178 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:45:09,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:45:09,179 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:45:09,179 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:45:09,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:45:09,179 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:45:09,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:45:09,180 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:45:09,180 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:45:09,180 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:45:09,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:45:09,180 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:45:09,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:45:09,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:45:09,181 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:45:09,181 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:45:09,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:45:09,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:45:09,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:45:09,182 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:45:09,182 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:45:09,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:45:09,183 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:45:09,183 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:45:09,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:45:09,183 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:45:09,183 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:45:09,184 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:45:09,185 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:45:09,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:45:09,232 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:45:09,236 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:45:09,237 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:45:09,238 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:45:09,238 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 19:45:09,389 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:45:09,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:45:09,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:45:09,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:45:09,400 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:45:09,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a59f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09, skipping insertion in model container [2018-01-24 19:45:09,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,415 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:45:09,453 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:45:09,563 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:45:09,578 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:45:09,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09 WrapperNode [2018-01-24 19:45:09,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:45:09,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:45:09,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:45:09,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:45:09,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (1/1) ... [2018-01-24 19:45:09,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:45:09,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:45:09,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:45:09,626 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:45:09,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (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 19:45:09,678 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:45:09,678 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:45:09,678 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 19:45:09,678 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:45:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:45:09,678 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:45:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:45:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:45:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:45:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:45:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 19:45:09,679 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:45:09,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:45:09,680 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:45:09,859 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:45:09,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:45:09 BoogieIcfgContainer [2018-01-24 19:45:09,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:45:09,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:45:09,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:45:09,862 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:45:09,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:45:09" (1/3) ... [2018-01-24 19:45:09,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33298fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:45:09, skipping insertion in model container [2018-01-24 19:45:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:45:09" (2/3) ... [2018-01-24 19:45:09,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33298fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:45:09, skipping insertion in model container [2018-01-24 19:45:09,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:45:09" (3/3) ... [2018-01-24 19:45:09,865 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:45:09,871 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:45:09,877 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 19:45:09,920 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:45:09,920 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:45:09,920 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:45:09,920 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:45:09,921 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:45:09,921 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:45:09,921 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:45:09,921 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:45:09,921 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:45:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 19:45:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 19:45:09,941 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:09,942 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:09,942 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 19:45:09,951 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:09,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:09,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:09,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:09,995 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:10,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:10,108 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 19:45:10,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:10,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:45:10,110 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:10,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:45:10,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:45:10,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:45:10,127 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 19:45:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:10,222 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 19:45:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:45:10,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 19:45:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:10,232 INFO L225 Difference]: With dead ends: 57 [2018-01-24 19:45:10,232 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 19:45:10,235 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 19:45:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 19:45:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 19:45:10,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 19:45:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 19:45:10,327 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 19:45:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:10,327 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 19:45:10,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:45:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 19:45:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 19:45:10,328 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:10,328 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:10,328 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:10,329 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 19:45:10,329 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:10,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:10,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:10,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:10,330 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:10,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:10,363 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 19:45:10,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:10,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 19:45:10,364 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:10,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 19:45:10,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 19:45:10,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:45:10,367 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 19:45:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:10,436 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 19:45:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 19:45:10,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 19:45:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:10,437 INFO L225 Difference]: With dead ends: 40 [2018-01-24 19:45:10,437 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 19:45:10,438 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 19:45:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 19:45:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 19:45:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 19:45:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 19:45:10,444 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 19:45:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:10,445 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 19:45:10,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 19:45:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 19:45:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:45:10,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:10,446 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:10,446 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 19:45:10,446 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:10,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:10,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:10,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:10,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:10,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:10,512 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 19:45:10,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:10,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:45:10,513 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:10,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:45:10,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:45:10,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:45:10,514 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 19:45:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:10,572 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 19:45:10,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:45:10,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 19:45:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:10,574 INFO L225 Difference]: With dead ends: 37 [2018-01-24 19:45:10,574 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 19:45:10,574 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 19:45:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 19:45:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 19:45:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 19:45:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 19:45:10,580 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 19:45:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:10,581 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 19:45:10,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:45:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 19:45:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:45:10,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:10,582 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:45:10,582 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:10,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 19:45:10,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:10,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:10,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:10,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:10,584 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:10,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:10,709 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 19:45:10,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:10,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:45:10,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:10,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:45:10,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:45:10,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:45:10,711 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 19:45:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:10,778 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 19:45:10,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:45:10,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:45:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:10,780 INFO L225 Difference]: With dead ends: 36 [2018-01-24 19:45:10,780 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 19:45:10,780 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 19:45:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 19:45:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 19:45:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 19:45:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 19:45:10,786 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 19:45:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:10,786 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 19:45:10,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:45:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 19:45:10,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 19:45:10,787 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:10,787 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 19:45:10,787 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-01-24 19:45:10,788 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:10,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:10,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:10,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:10,789 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:10,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:10,853 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 19:45:10,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:10,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:45:10,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:10,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:45:10,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:45:10,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:45:10,855 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-24 19:45:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:11,001 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 19:45:11,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:45:11,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 19:45:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:11,002 INFO L225 Difference]: With dead ends: 35 [2018-01-24 19:45:11,002 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 19:45:11,002 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 19:45:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 19:45:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 19:45:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 19:45:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 19:45:11,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-01-24 19:45:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:11,008 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 19:45:11,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:45:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 19:45:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 19:45:11,009 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:11,009 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 19:45:11,009 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-01-24 19:45:11,009 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:11,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:11,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:11,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:11,011 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:11,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:11,123 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 19:45:11,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:11,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:45:11,124 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:11,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:45:11,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:45:11,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:45:11,126 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-01-24 19:45:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:11,232 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 19:45:11,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:45:11,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 19:45:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:11,233 INFO L225 Difference]: With dead ends: 42 [2018-01-24 19:45:11,233 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 19:45:11,233 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 19:45:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 19:45:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-01-24 19:45:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 19:45:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 19:45:11,238 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-01-24 19:45:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:11,238 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 19:45:11,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:45:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 19:45:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:45:11,239 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:11,239 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 19:45:11,239 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-01-24 19:45:11,239 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:11,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:11,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:11,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:11,240 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:11,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:11,342 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 19:45:11,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:11,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:45:11,343 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:11,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:45:11,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:45:11,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:45:11,343 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-01-24 19:45:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:11,466 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 19:45:11,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 19:45:11,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 19:45:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:11,468 INFO L225 Difference]: With dead ends: 37 [2018-01-24 19:45:11,468 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 19:45:11,468 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 19:45:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 19:45:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 19:45:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 19:45:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 19:45:11,474 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-01-24 19:45:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:11,474 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 19:45:11,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:45:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 19:45:11,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:45:11,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:11,476 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 19:45:11,476 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-01-24 19:45:11,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:11,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:11,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:11,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:11,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:11,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:11,606 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 19:45:11,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:11,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:45:11,646 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:11,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:45:11,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:45:11,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:45:11,646 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-01-24 19:45:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:11,776 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 19:45:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:45:11,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 19:45:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:11,777 INFO L225 Difference]: With dead ends: 39 [2018-01-24 19:45:11,778 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 19:45:11,778 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 19:45:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 19:45:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 19:45:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 19:45:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 19:45:11,782 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-01-24 19:45:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:11,782 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 19:45:11,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:45:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 19:45:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:45:11,783 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:11,783 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 19:45:11,783 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-01-24 19:45:11,783 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:11,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:11,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:11,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:11,784 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:11,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:11,940 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 19:45:11,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:45:11,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 19:45:11,941 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:45:11,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 19:45:11,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 19:45:11,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:45:11,941 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-24 19:45:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:12,091 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-01-24 19:45:12,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 19:45:12,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-24 19:45:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:12,092 INFO L225 Difference]: With dead ends: 77 [2018-01-24 19:45:12,092 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 19:45:12,092 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-24 19:45:12,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 19:45:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-24 19:45:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:45:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-24 19:45:12,098 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-01-24 19:45:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:12,099 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-24 19:45:12,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 19:45:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-24 19:45:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:45:12,099 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:12,100 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 19:45:12,100 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:12,100 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-01-24 19:45:12,100 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:12,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:12,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:12,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:12,101 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:12,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:12,316 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 19:45:12,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:45:12,317 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:45:12,318 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 19:45:12,319 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 19:45:12,362 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:45:12,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:45:44,875 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:45:44,877 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 19:45:44,895 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:45:44,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:45:44,896 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 19:45:44,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:44,903 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:45:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:44,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:45:44,987 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 19:45:44,990 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 19:45:44,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:44,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:44,999 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 19:45:44,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 19:45:45,139 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 19:45:45,146 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 19:45:45,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:45:45,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:45:45,160 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 19:45:45,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 19:45:45,226 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 19:45:45,226 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:45:45,404 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 19:45:45,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,411 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 19:45:45,419 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 19:45:45,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,421 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,426 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 19:45:45,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 19:45:45,434 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 19:45:45,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:45:45,455 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 19:45:45,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:45,462 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:45:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:45,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:45:45,517 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 19:45:45,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 19:45:45,578 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 19:45:45,580 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 19:45:45,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 19:45:45,736 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 19:45:45,741 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 19:45:45,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:45:45,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:45:45,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:45:45,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 19:45:45,850 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 19:45:45,850 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:45:45,985 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 19:45:45,992 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 19:45:45,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:45:45,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 19:45:46,055 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 19:45:46,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:45:46,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 37 [2018-01-24 19:45:46,057 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:45:46,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 19:45:46,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 19:45:46,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 19:45:46,058 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 17 states. [2018-01-24 19:45:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:45:46,590 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 19:45:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 19:45:46,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-24 19:45:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:45:46,593 INFO L225 Difference]: With dead ends: 61 [2018-01-24 19:45:46,593 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 19:45:46,594 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 19:45:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 19:45:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-24 19:45:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 19:45:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 19:45:46,604 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-01-24 19:45:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:45:46,604 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 19:45:46,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 19:45:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 19:45:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 19:45:46,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:45:46,606 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 19:45:46,606 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 19:45:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-01-24 19:45:46,606 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:45:46,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:46,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:45:46,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:45:46,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:45:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:45:46,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:45:47,226 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 19:45:47,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:45:47,226 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:45:47,226 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 19:45:47,226 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 19:45:47,227 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:45:47,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 19:46:02,339 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 19:46:02,340 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 19:46:02,340 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:46:02,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:46:02,340 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 19:46:02,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:46:02,345 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:46:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:46:02,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:46:02,365 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 19:46:02,365 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 19:46:02,368 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 19:46:02,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:46:02 BoogieIcfgContainer [2018-01-24 19:46:02,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:46:02,369 INFO L168 Benchmark]: Toolchain (without parser) took 52979.92 ms. Allocated memory was 293.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 253.0 MB in the beginning and 1.2 GB in the end (delta: -919.0 MB). Peak memory consumption was 592.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:02,369 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 293.1 MB. Free memory is still 259.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:46:02,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.88 ms. Allocated memory is still 293.1 MB. Free memory was 252.0 MB in the beginning and 242.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:02,370 INFO L168 Benchmark]: Boogie Preprocessor took 37.77 ms. Allocated memory is still 293.1 MB. Free memory was 242.0 MB in the beginning and 240.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:02,370 INFO L168 Benchmark]: RCFGBuilder took 233.78 ms. Allocated memory is still 293.1 MB. Free memory was 240.0 MB in the beginning and 224.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:02,370 INFO L168 Benchmark]: TraceAbstraction took 52508.52 ms. Allocated memory was 293.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 223.0 MB in the beginning and 1.2 GB in the end (delta: -949.0 MB). Peak memory consumption was 562.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:46:02,371 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.20 ms. Allocated memory is still 293.1 MB. Free memory is still 259.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 192.88 ms. Allocated memory is still 293.1 MB. Free memory was 252.0 MB in the beginning and 242.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.77 ms. Allocated memory is still 293.1 MB. Free memory was 242.0 MB in the beginning and 240.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 233.78 ms. Allocated memory is still 293.1 MB. Free memory was 240.0 MB in the beginning and 224.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52508.52 ms. Allocated memory was 293.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 223.0 MB in the beginning and 1.2 GB in the end (delta: -949.0 MB). Peak memory consumption was 562.0 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.573159 RENAME_VARIABLES(MILLISECONDS) : 1.326519 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 7.518484 PROJECTAWAY(MILLISECONDS) : 594.154122 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.055605 DISJOIN(MILLISECONDS) : 0.474667 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.356894 ADD_EQUALITY(MILLISECONDS) : 0.028274 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014726 #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, 52.4s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.5s 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.9s 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, 47.6s 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, 1.9s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-46-02-380.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-46-02-380.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-46-02-380.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-46-02-380.csv Completed graceful shutdown