java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:32:35,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:32:35,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:32:35,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:32:35,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:32:35,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:32:35,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:32:35,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:32:35,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:32:35,480 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:32:35,481 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:32:35,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:32:35,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:32:35,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:32:35,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:32:35,487 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:32:35,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:32:35,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:32:35,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:32:35,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:32:35,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:32:35,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:32:35,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:32:35,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:32:35,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:32:35,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:32:35,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:32:35,502 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:32:35,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:32:35,502 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:32:35,503 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:32:35,503 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:32:35,513 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:32:35,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:32:35,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:32:35,514 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:32:35,515 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:32:35,515 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:32:35,515 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:32:35,515 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:32:35,515 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:32:35,516 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:32:35,516 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:32:35,517 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:32:35,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:32:35,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:32:35,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:32:35,517 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:32:35,518 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:32:35,518 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:32:35,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:32:35,518 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:32:35,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:32:35,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:32:35,519 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:32:35,519 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:32:35,519 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:32:35,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:32:35,519 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:32:35,520 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:32:35,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:32:35,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:32:35,520 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:32:35,520 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:32:35,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:32:35,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:32:35,521 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:32:35,522 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:32:35,522 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:32:35,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:32:35,576 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:32:35,580 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:32:35,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:32:35,581 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:32:35,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:32:35,766 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:32:35,771 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:32:35,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:32:35,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:32:35,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:32:35,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:35,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35, skipping insertion in model container [2018-01-25 02:32:35,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:35,797 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:32:35,838 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:32:35,958 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:32:35,975 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:32:35,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35 WrapperNode [2018-01-25 02:32:35,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:32:35,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:32:35,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:32:35,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:32:35,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:35,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:36,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:36,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:36,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:36,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:36,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (1/1) ... [2018-01-25 02:32:36,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:32:36,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:32:36,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:32:36,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:32:36,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:32:36,066 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:32:36,066 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:32:36,066 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-25 02:32:36,067 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:32:36,067 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:32:36,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:32:36,310 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:32:36,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:32:36 BoogieIcfgContainer [2018-01-25 02:32:36,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:32:36,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:32:36,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:32:36,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:32:36,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:32:35" (1/3) ... [2018-01-25 02:32:36,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edcf69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:32:36, skipping insertion in model container [2018-01-25 02:32:36,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:35" (2/3) ... [2018-01-25 02:32:36,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edcf69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:32:36, skipping insertion in model container [2018-01-25 02:32:36,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:32:36" (3/3) ... [2018-01-25 02:32:36,317 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:32:36,324 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:32:36,331 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-25 02:32:36,380 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:32:36,380 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:32:36,380 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:32:36,380 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:32:36,380 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:32:36,381 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:32:36,381 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:32:36,381 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:32:36,382 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:32:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-25 02:32:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:32:36,411 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:36,412 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:36,412 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash 104454547, now seen corresponding path program 1 times [2018-01-25 02:32:36,420 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:36,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:36,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:36,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:36,465 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:36,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:36,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:36,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:32:36,578 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:36,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:32:36,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:32:36,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:32:36,601 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-01-25 02:32:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:36,828 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-01-25 02:32:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:32:36,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-25 02:32:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:36,841 INFO L225 Difference]: With dead ends: 72 [2018-01-25 02:32:36,842 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:32:36,845 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-25 02:32:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:32:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 02:32:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:32:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-25 02:32:36,877 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 11 [2018-01-25 02:32:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:36,877 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-25 02:32:36,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:32:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-25 02:32:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:32:36,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:36,878 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:36,878 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224676, now seen corresponding path program 1 times [2018-01-25 02:32:36,879 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:36,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:36,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:36,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:36,881 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:36,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:37,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:37,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:32:37,000 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:37,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:32:37,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:32:37,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:32:37,003 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-01-25 02:32:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:37,080 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-25 02:32:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:32:37,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 02:32:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:37,082 INFO L225 Difference]: With dead ends: 46 [2018-01-25 02:32:37,082 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:32:37,085 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-25 02:32:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:32:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 02:32:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 02:32:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-25 02:32:37,096 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-01-25 02:32:37,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:37,096 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-25 02:32:37,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:32:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-25 02:32:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:32:37,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:37,097 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:37,097 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224677, now seen corresponding path program 1 times [2018-01-25 02:32:37,098 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:37,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:37,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:37,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:37,102 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:37,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:37,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:37,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:32:37,380 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:37,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:32:37,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:32:37,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:32:37,381 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-01-25 02:32:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:37,441 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-25 02:32:37,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:32:37,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-25 02:32:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:37,443 INFO L225 Difference]: With dead ends: 45 [2018-01-25 02:32:37,443 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 02:32:37,444 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:32:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 02:32:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 02:32:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 02:32:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-25 02:32:37,450 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 15 [2018-01-25 02:32:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:37,451 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-25 02:32:37,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:32:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-25 02:32:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:32:37,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:37,452 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:37,452 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193927, now seen corresponding path program 1 times [2018-01-25 02:32:37,453 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:37,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:37,454 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:37,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:37,454 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:37,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:37,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:37,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:32:37,540 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:37,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:32:37,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:32:37,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:32:37,541 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2018-01-25 02:32:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:37,590 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-25 02:32:37,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:32:37,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 02:32:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:37,592 INFO L225 Difference]: With dead ends: 44 [2018-01-25 02:32:37,592 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 02:32:37,592 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-25 02:32:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 02:32:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-25 02:32:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:32:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-25 02:32:37,597 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-01-25 02:32:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:37,597 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-25 02:32:37,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:32:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-25 02:32:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:32:37,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:37,598 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:37,598 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193928, now seen corresponding path program 1 times [2018-01-25 02:32:37,598 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:37,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:37,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:37,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:37,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:37,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:37,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:37,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:32:37,690 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:37,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:32:37,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:32:37,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:32:37,692 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-01-25 02:32:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:37,825 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-25 02:32:37,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:32:37,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-25 02:32:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:37,828 INFO L225 Difference]: With dead ends: 59 [2018-01-25 02:32:37,828 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 02:32:37,829 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:32:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 02:32:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-25 02:32:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:32:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-25 02:32:37,842 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-01-25 02:32:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:37,843 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-25 02:32:37,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:32:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-25 02:32:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:32:37,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:37,844 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:37,844 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash 659847302, now seen corresponding path program 1 times [2018-01-25 02:32:37,844 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:37,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:37,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:37,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:37,846 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:37,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:37,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:37,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:32:37,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:37,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:32:37,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:32:37,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:32:37,952 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-01-25 02:32:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:38,071 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-25 02:32:38,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:32:38,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-25 02:32:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:38,073 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:32:38,073 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:32:38,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:32:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:32:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-01-25 02:32:38,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 02:32:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-25 02:32:38,079 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 16 [2018-01-25 02:32:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:38,080 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-25 02:32:38,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:32:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-25 02:32:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:32:38,081 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:38,081 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-25 02:32:38,081 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash -262056781, now seen corresponding path program 1 times [2018-01-25 02:32:38,081 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:38,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:38,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:38,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:38,083 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:38,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:38,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:38,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:32:38,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:38,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:32:38,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:32:38,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:32:38,134 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-01-25 02:32:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:38,181 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-01-25 02:32:38,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:32:38,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 02:32:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:38,182 INFO L225 Difference]: With dead ends: 42 [2018-01-25 02:32:38,182 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 02:32:38,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:32:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 02:32:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 02:32:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:32:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 02:32:38,186 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-01-25 02:32:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:38,187 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 02:32:38,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:32:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 02:32:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:32:38,187 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:38,188 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-25 02:32:38,188 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash -262056780, now seen corresponding path program 1 times [2018-01-25 02:32:38,188 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:38,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:38,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:38,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:38,189 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:38,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:38,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:38,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:32:38,321 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:38,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:32:38,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:32:38,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:32:38,322 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-01-25 02:32:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:38,456 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-25 02:32:38,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:32:38,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-25 02:32:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:38,456 INFO L225 Difference]: With dead ends: 47 [2018-01-25 02:32:38,457 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:32:38,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:32:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:32:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-25 02:32:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:32:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-25 02:32:38,463 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20 [2018-01-25 02:32:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:38,463 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-25 02:32:38,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:32:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-25 02:32:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:32:38,464 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:38,464 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:38,464 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:32:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1316966177, now seen corresponding path program 1 times [2018-01-25 02:32:38,465 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:38,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:38,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:38,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:38,466 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:38,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:38,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:32:38,675 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:32:38,676 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 02:32:38,678 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [43], [48], [52], [58], [65], [66], [67], [68], [69], [70], [73], [84], [85], [86], [88] [2018-01-25 02:32:38,744 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:32:38,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:33:17,688 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:33:17,690 INFO L268 AbstractInterpreter]: Visited 22 different actions 26 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 02:33:17,697 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:33:17,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:17,697 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:33:17,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:17,722 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:33:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:17,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:33:17,854 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 11 treesize of output 8 [2018-01-25 02:33:17,864 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 8 treesize of output 7 [2018-01-25 02:33:17,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:17,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:17,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:17,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-25 02:33:18,011 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 15 treesize of output 11 [2018-01-25 02:33:18,019 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-25 02:33:18,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:18,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:18,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:18,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-25 02:33:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:18,043 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:33:18,052 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-25 02:33:18,067 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-25 02:33:18,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:33:18,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:18,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:33:18,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-25 02:33:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:18,147 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 02:33:18,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 13 [2018-01-25 02:33:18,147 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:18,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:33:18,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:33:18,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:33:18,148 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 7 states. [2018-01-25 02:33:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:18,462 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-25 02:33:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:33:18,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-25 02:33:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:18,465 INFO L225 Difference]: With dead ends: 93 [2018-01-25 02:33:18,465 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 02:33:18,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:33:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 02:33:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2018-01-25 02:33:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:33:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-25 02:33:18,475 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 23 [2018-01-25 02:33:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:18,476 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-25 02:33:18,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:33:18,476 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-25 02:33:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:33:18,477 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:18,477 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:18,477 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash 37102499, now seen corresponding path program 1 times [2018-01-25 02:33:18,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:18,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:18,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:18,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:18,479 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:18,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:33:18,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:18,682 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:33:18,682 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 02:33:18,682 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [43], [48], [52], [60], [65], [66], [67], [68], [69], [70], [73], [84], [85], [86], [88] [2018-01-25 02:33:18,683 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:33:18,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:33:34,550 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:33:34,550 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:33:34,551 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:33:34,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:34,551 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:33:34,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:34,557 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:33:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:34,584 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:33:34,586 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:33:34,586 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:33:34,591 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:33:34,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:33:34 BoogieIcfgContainer [2018-01-25 02:33:34,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:33:34,593 INFO L168 Benchmark]: Toolchain (without parser) took 58825.80 ms. Allocated memory was 296.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 256.1 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 258.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:34,594 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 296.2 MB. Free memory is still 262.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:33:34,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.88 ms. Allocated memory is still 296.2 MB. Free memory was 255.1 MB in the beginning and 244.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:34,594 INFO L168 Benchmark]: Boogie Preprocessor took 32.63 ms. Allocated memory is still 296.2 MB. Free memory was 244.9 MB in the beginning and 242.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:34,595 INFO L168 Benchmark]: RCFGBuilder took 295.96 ms. Allocated memory is still 296.2 MB. Free memory was 242.9 MB in the beginning and 224.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:34,595 INFO L168 Benchmark]: TraceAbstraction took 58280.52 ms. Allocated memory was 296.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 223.9 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 225.8 MB. Max. memory is 5.3 GB. [2018-01-25 02:33:34,597 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.16 ms. Allocated memory is still 296.2 MB. Free memory is still 262.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.88 ms. Allocated memory is still 296.2 MB. Free memory was 255.1 MB in the beginning and 244.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.63 ms. Allocated memory is still 296.2 MB. Free memory was 244.9 MB in the beginning and 242.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 295.96 ms. Allocated memory is still 296.2 MB. Free memory was 242.9 MB in the beginning and 224.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58280.52 ms. Allocated memory was 296.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 223.9 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 225.8 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 : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 251 LocStat_NO_SUPPORTING_DISEQUALITIES : 48 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 : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.920256 RENAME_VARIABLES(MILLISECONDS) : 0.185542 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.875203 PROJECTAWAY(MILLISECONDS) : 0.376233 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.101926 DISJOIN(MILLISECONDS) : 0.259541 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.208390 ADD_EQUALITY(MILLISECONDS) : 0.013208 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012246 #CONJOIN_DISJUNCTIVE : 49 #RENAME_VARIABLES : 72 #UNFREEZE : 0 #CONJOIN : 95 #PROJECTAWAY : 66 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 69 #ADD_EQUALITY : 59 #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 543). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 545). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 543). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 545). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 545). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 545). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 566). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 565). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 566). Cancelled while BasicCegarLoop was analyzing trace of length 24 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 565). Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 24 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, 49 locations, 11 error locations. TIMEOUT Result, 58.2s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 356 SDtfs, 275 SDslu, 698 SDs, 0 SdLazy, 387 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 54.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 187 ConstructedInterpolants, 0 QuantifiedInterpolants, 12309 SizeOfPredicates, 12 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 4/6 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/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-33-34-608.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-33-34-608.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-33-34-608.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-33-34-608.csv Completed graceful shutdown