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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:36:31,030 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:36:31,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:36:31,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:36:31,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:36:31,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:36:31,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:36:31,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:36:31,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:36:31,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:36:31,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:36:31,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:36:31,057 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:36:31,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:36:31,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:36:31,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:36:31,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:36:31,066 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:36:31,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:36:31,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:36:31,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:36:31,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:36:31,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:36:31,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:36:31,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:36:31,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:36:31,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:36:31,075 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:36:31,076 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:36:31,076 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:36:31,076 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:36:31,077 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:36:31,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:36:31,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:36:31,087 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:36:31,087 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:36:31,088 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:36:31,088 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:36:31,088 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:36:31,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:36:31,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:36:31,089 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:36:31,089 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:36:31,089 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:36:31,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:36:31,089 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:36:31,089 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:36:31,090 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:36:31,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:36:31,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:36:31,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:36:31,090 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:36:31,090 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:36:31,090 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:36:31,090 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:36:31,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:36:31,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:36:31,091 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:36:31,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:36:31,091 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:36:31,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:36:31,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:36:31,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:36:31,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:36:31,093 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:36:31,093 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:36:31,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:36:31,137 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:36:31,140 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:36:31,142 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:36:31,142 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:36:31,143 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-29 22:36:31,297 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:36:31,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:36:31,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:36:31,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:36:31,308 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:36:31,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a116ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31, skipping insertion in model container [2018-01-29 22:36:31,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,325 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:36:31,363 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:36:31,483 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:36:31,500 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:36:31,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31 WrapperNode [2018-01-29 22:36:31,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:36:31,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:36:31,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:36:31,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:36:31,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (1/1) ... [2018-01-29 22:36:31,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:36:31,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:36:31,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:36:31,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:36:31,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (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-29 22:36:31,594 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:36:31,594 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:36:31,595 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-29 22:36:31,595 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:36:31,595 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:36:31,595 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:36:31,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:36:31,595 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:36:31,595 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:36:31,596 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:36:31,596 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-29 22:36:31,596 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:36:31,596 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:36:31,596 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:36:31,786 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:36:31,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:36:31 BoogieIcfgContainer [2018-01-29 22:36:31,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:36:31,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:36:31,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:36:31,789 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:36:31,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:36:31" (1/3) ... [2018-01-29 22:36:31,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7017e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:36:31, skipping insertion in model container [2018-01-29 22:36:31,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:31" (2/3) ... [2018-01-29 22:36:31,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7017e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:36:31, skipping insertion in model container [2018-01-29 22:36:31,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:36:31" (3/3) ... [2018-01-29 22:36:31,792 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:36:31,799 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:36:31,804 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-29 22:36:31,848 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:36:31,848 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:36:31,848 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:36:31,849 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:36:31,849 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:36:31,849 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:36:31,849 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:36:31,849 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:36:31,850 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:36:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-29 22:36:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-29 22:36:31,877 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:31,878 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:31,878 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash -513132750, now seen corresponding path program 1 times [2018-01-29 22:36:31,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:31,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:31,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:31,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:31,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:31,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:32,034 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-29 22:36:32,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:32,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 22:36:32,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:36:32,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:36:32,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:36:32,050 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-29 22:36:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:32,163 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-29 22:36:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:36:32,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-29 22:36:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:32,178 INFO L225 Difference]: With dead ends: 77 [2018-01-29 22:36:32,178 INFO L226 Difference]: Without dead ends: 58 [2018-01-29 22:36:32,244 INFO L553 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-29 22:36:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-29 22:36:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-29 22:36:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-29 22:36:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-29 22:36:32,283 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 17 [2018-01-29 22:36:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:32,284 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-29 22:36:32,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:36:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-29 22:36:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:36:32,284 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:32,285 INFO L350 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-29 22:36:32,285 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -890392958, now seen corresponding path program 1 times [2018-01-29 22:36:32,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:32,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:32,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:32,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:32,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:32,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:32,349 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-29 22:36:32,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:32,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:36:32,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:36:32,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:36:32,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:36:32,353 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 4 states. [2018-01-29 22:36:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:32,455 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-01-29 22:36:32,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:36:32,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-29 22:36:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:32,457 INFO L225 Difference]: With dead ends: 58 [2018-01-29 22:36:32,457 INFO L226 Difference]: Without dead ends: 57 [2018-01-29 22:36:32,458 INFO L553 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-29 22:36:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-29 22:36:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-29 22:36:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-29 22:36:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-29 22:36:32,466 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 20 [2018-01-29 22:36:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:32,466 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-29 22:36:32,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:36:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-29 22:36:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:36:32,467 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:32,468 INFO L350 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-29 22:36:32,468 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash -890392957, now seen corresponding path program 1 times [2018-01-29 22:36:32,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:32,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:32,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:32,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:32,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:32,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:32,584 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-29 22:36:32,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:32,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:36:32,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:36:32,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:36:32,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:36:32,585 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2018-01-29 22:36:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:32,645 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-29 22:36:32,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:36:32,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-29 22:36:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:32,647 INFO L225 Difference]: With dead ends: 57 [2018-01-29 22:36:32,647 INFO L226 Difference]: Without dead ends: 56 [2018-01-29 22:36:32,648 INFO L553 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-29 22:36:32,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-29 22:36:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-29 22:36:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-29 22:36:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-29 22:36:32,655 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 20 [2018-01-29 22:36:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:32,656 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-29 22:36:32,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:36:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-29 22:36:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:36:32,657 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:32,657 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:32,657 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1042226020, now seen corresponding path program 1 times [2018-01-29 22:36:32,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:32,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:32,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:32,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:32,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:32,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:32,741 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-29 22:36:32,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:32,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:36:32,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:36:32,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:36:32,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:36:32,743 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2018-01-29 22:36:32,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:32,884 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-01-29 22:36:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:36:32,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-29 22:36:32,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:32,886 INFO L225 Difference]: With dead ends: 56 [2018-01-29 22:36:32,886 INFO L226 Difference]: Without dead ends: 55 [2018-01-29 22:36:32,886 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:36:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-29 22:36:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-29 22:36:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-29 22:36:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-29 22:36:32,893 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2018-01-29 22:36:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:32,894 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-29 22:36:32,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:36:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-29 22:36:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:36:32,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:32,895 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:32,895 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1042226019, now seen corresponding path program 1 times [2018-01-29 22:36:32,896 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:32,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:32,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:32,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:32,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:32,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:33,059 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-29 22:36:33,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:33,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:36:33,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:36:33,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:36:33,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:36:33,061 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 10 states. [2018-01-29 22:36:33,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:33,268 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-01-29 22:36:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:36:33,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-29 22:36:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:33,269 INFO L225 Difference]: With dead ends: 70 [2018-01-29 22:36:33,269 INFO L226 Difference]: Without dead ends: 69 [2018-01-29 22:36:33,270 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:36:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-29 22:36:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-01-29 22:36:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-29 22:36:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-29 22:36:33,275 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 31 [2018-01-29 22:36:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:33,275 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-29 22:36:33,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:36:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-29 22:36:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:36:33,276 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:33,276 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:33,276 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:33,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2050731734, now seen corresponding path program 1 times [2018-01-29 22:36:33,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:33,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:33,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:33,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:33,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:33,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:33,380 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-29 22:36:33,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:33,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:36:33,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:36:33,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:36:33,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:36:33,381 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 10 states. [2018-01-29 22:36:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:33,521 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-01-29 22:36:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:36:33,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-29 22:36:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:33,523 INFO L225 Difference]: With dead ends: 61 [2018-01-29 22:36:33,523 INFO L226 Difference]: Without dead ends: 60 [2018-01-29 22:36:33,523 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:36:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-29 22:36:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-29 22:36:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-29 22:36:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-29 22:36:33,534 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2018-01-29 22:36:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:33,534 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-29 22:36:33,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:36:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-29 22:36:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:36:33,536 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:33,536 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:33,536 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2050731735, now seen corresponding path program 1 times [2018-01-29 22:36:33,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:33,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:33,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:33,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:33,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:33,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:33,767 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-29 22:36:33,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:33,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:36:33,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:36:33,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:36:33,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:36:33,768 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-01-29 22:36:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:34,059 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-01-29 22:36:34,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:36:34,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-29 22:36:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:34,060 INFO L225 Difference]: With dead ends: 65 [2018-01-29 22:36:34,060 INFO L226 Difference]: Without dead ends: 64 [2018-01-29 22:36:34,061 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:36:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-29 22:36:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-29 22:36:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-29 22:36:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-29 22:36:34,066 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 32 [2018-01-29 22:36:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:34,067 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-29 22:36:34,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:36:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-29 22:36:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 22:36:34,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:34,068 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:34,069 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:34,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1511731197, now seen corresponding path program 1 times [2018-01-29 22:36:34,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:34,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:34,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:34,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:34,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:34,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:34,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:34,327 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-29 22:36:34,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:34,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:34,423 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-29 22:36:34,425 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-29 22:36:34,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:34,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:34,433 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-29 22:36:34,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:36:34,685 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-29 22:36:34,694 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-29 22:36:34,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:34,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:34,708 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-29 22:36:34,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-29 22:36:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:34,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:34,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-29 22:36:34,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:36:34,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:36:34,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:36:34,778 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 21 states. [2018-01-29 22:36:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:35,477 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-29 22:36:35,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:36:35,477 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-01-29 22:36:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:35,478 INFO L225 Difference]: With dead ends: 82 [2018-01-29 22:36:35,478 INFO L226 Difference]: Without dead ends: 81 [2018-01-29 22:36:35,479 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 22:36:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-29 22:36:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2018-01-29 22:36:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-29 22:36:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-01-29 22:36:35,489 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 42 [2018-01-29 22:36:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:35,489 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-01-29 22:36:35,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:36:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-01-29 22:36:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 22:36:35,490 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:35,491 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:35,491 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:35,491 INFO L82 PathProgramCache]: Analyzing trace with hash -380973193, now seen corresponding path program 1 times [2018-01-29 22:36:35,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:35,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:35,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:35,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:35,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:35,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:35,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:35,938 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-29 22:36:35,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:35,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:35,983 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-29 22:36:35,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:36,001 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-29 22:36:36,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:36,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:36,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-29 22:36:36,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:36,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:36,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:36:36,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:36,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:36:36,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:36,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:36,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-29 22:36:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:36,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:36,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2018-01-29 22:36:36,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 22:36:36,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 22:36:36,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1470, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 22:36:36,686 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 40 states. [2018-01-29 22:36:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:38,334 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-29 22:36:38,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 22:36:38,335 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2018-01-29 22:36:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:38,338 INFO L225 Difference]: With dead ends: 82 [2018-01-29 22:36:38,338 INFO L226 Difference]: Without dead ends: 81 [2018-01-29 22:36:38,340 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=348, Invalid=3192, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 22:36:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-29 22:36:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-01-29 22:36:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 22:36:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-01-29 22:36:38,350 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 43 [2018-01-29 22:36:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:38,350 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-01-29 22:36:38,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-29 22:36:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-01-29 22:36:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 22:36:38,352 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:38,352 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:38,352 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:38,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1418567855, now seen corresponding path program 1 times [2018-01-29 22:36:38,353 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:38,353 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:38,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:38,354 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:38,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:38,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:38,483 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-29 22:36:38,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:36:38,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:36:38,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:36:38,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:36:38,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:36:38,485 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2018-01-29 22:36:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:38,611 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-29 22:36:38,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:36:38,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-29 22:36:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:38,613 INFO L225 Difference]: With dead ends: 72 [2018-01-29 22:36:38,613 INFO L226 Difference]: Without dead ends: 58 [2018-01-29 22:36:38,613 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:36:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-29 22:36:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-29 22:36:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-29 22:36:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-29 22:36:38,624 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 46 [2018-01-29 22:36:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:38,625 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-29 22:36:38,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:36:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-29 22:36:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 22:36:38,626 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:38,626 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:38,626 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash 665979037, now seen corresponding path program 2 times [2018-01-29 22:36:38,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:38,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:38,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:38,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:36:38,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:38,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:39,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:39,208 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-29 22:36:39,216 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:36:39,230 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:39,237 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:39,240 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:36:39,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:39,283 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-29 22:36:39,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:39,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:39,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:36:39,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:39,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:39,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:36:39,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:39,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:39,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 22:36:39,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-01-29 22:36:39,389 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-29 22:36:39,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:39,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:39,395 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-29 22:36:39,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-29 22:36:39,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-01-29 22:36:39,863 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-29 22:36:39,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:39,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:39,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 22:36:39,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:49 [2018-01-29 22:36:40,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-29 22:36:40,215 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:40,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-01-29 22:36:40,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:40,248 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 25 treesize of output 23 [2018-01-29 22:36:40,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:40,250 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 19 treesize of output 17 [2018-01-29 22:36:40,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:40,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:40,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:40,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:43 [2018-01-29 22:36:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:40,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:40,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2018-01-29 22:36:40,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-29 22:36:40,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-29 22:36:40,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1627, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 22:36:40,400 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 42 states. [2018-01-29 22:36:41,378 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 89 DAG size of output 76 [2018-01-29 22:36:41,880 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 104 DAG size of output 92 [2018-01-29 22:36:42,228 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 112 DAG size of output 83 [2018-01-29 22:36:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:43,711 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-01-29 22:36:43,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 22:36:43,711 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 53 [2018-01-29 22:36:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:43,712 INFO L225 Difference]: With dead ends: 74 [2018-01-29 22:36:43,712 INFO L226 Difference]: Without dead ends: 73 [2018-01-29 22:36:43,713 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=359, Invalid=3930, Unknown=1, NotChecked=0, Total=4290 [2018-01-29 22:36:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-29 22:36:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-29 22:36:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-29 22:36:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-01-29 22:36:43,721 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 53 [2018-01-29 22:36:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:43,721 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-01-29 22:36:43,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-29 22:36:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-01-29 22:36:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:36:43,723 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:43,723 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:43,723 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:43,723 INFO L82 PathProgramCache]: Analyzing trace with hash -829486377, now seen corresponding path program 2 times [2018-01-29 22:36:43,723 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:43,723 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:43,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:43,724 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:36:43,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:43,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:44,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:44,275 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:36:44,280 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:36:44,293 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:44,300 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:36:44,302 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:36:44,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:44,310 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-29 22:36:44,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:44,318 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-29 22:36:44,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:44,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:44,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-29 22:36:44,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:44,396 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:44,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:36:44,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:44,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:36:44,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:44,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:44,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-29 22:36:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:36:45,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:45,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-01-29 22:36:45,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-29 22:36:45,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-29 22:36:45,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2235, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 22:36:45,137 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 49 states. [2018-01-29 22:36:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:48,004 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-01-29 22:36:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 22:36:48,004 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 54 [2018-01-29 22:36:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:48,005 INFO L225 Difference]: With dead ends: 71 [2018-01-29 22:36:48,005 INFO L226 Difference]: Without dead ends: 70 [2018-01-29 22:36:48,006 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=634, Invalid=5686, Unknown=0, NotChecked=0, Total=6320 [2018-01-29 22:36:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-29 22:36:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-29 22:36:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-29 22:36:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-01-29 22:36:48,012 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 54 [2018-01-29 22:36:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:48,013 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-01-29 22:36:48,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-29 22:36:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-01-29 22:36:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-29 22:36:48,013 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:36:48,013 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:36:48,013 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:36:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash -756315139, now seen corresponding path program 3 times [2018-01-29 22:36:48,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:36:48,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:36:48,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:48,014 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:36:48,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:36:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:36:48,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:36:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:36:48,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:36:48,577 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:36:48,583 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:36:48,595 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:36:48,601 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:36:48,605 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:36:48,609 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:36:48,612 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:36:48,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:36:48,619 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-29 22:36:48,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:36:48,626 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-29 22:36:48,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:48,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:36:48,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:36:48,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:36:48,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-01-29 22:36:48,683 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-29 22:36:48,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,689 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-29 22:36:48,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:36:48,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 22:36:48,836 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-29 22:36:48,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,844 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-29 22:36:48,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-29 22:36:48,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 22:36:48,899 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-29 22:36:48,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:36:48,907 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-29 22:36:48,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-29 22:36:48,964 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 21 treesize of output 17 [2018-01-29 22:36:48,969 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 17 treesize of output 14 [2018-01-29 22:36:48,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:36:48,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:48,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:36:48,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-29 22:36:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-29 22:36:49,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:36:49,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 31 [2018-01-29 22:36:49,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 22:36:49,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 22:36:49,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-01-29 22:36:49,055 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 32 states. [2018-01-29 22:36:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:36:49,967 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-29 22:36:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:36:49,968 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-01-29 22:36:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:36:49,968 INFO L225 Difference]: With dead ends: 67 [2018-01-29 22:36:49,968 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:36:49,969 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=449, Invalid=2413, Unknown=0, NotChecked=0, Total=2862 [2018-01-29 22:36:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:36:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:36:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:36:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:36:49,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-01-29 22:36:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:36:49,970 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:36:49,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 22:36:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:36:49,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:36:49,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:36:51,443 WARN L146 SmtUtils]: Spent 1347ms on a formula simplification. DAG size of input: 85 DAG size of output 37 [2018-01-29 22:36:52,054 WARN L146 SmtUtils]: Spent 609ms on a formula simplification. DAG size of input: 207 DAG size of output 115 [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point L544'''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 547) no Hoare annotation was computed. [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point L544(lines 544 545) no Hoare annotation was computed. [2018-01-29 22:36:52,141 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-29 22:36:52,142 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,142 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,142 INFO L395 ceAbstractionStarter]: At program point L544''''''''''''''(lines 544 545) the Hoare annotation is: (let ((.cse22 (select |#memory_int| cstrcpy_~src~2.base)) (.cse7 (select |#length| cstrcpy_~src~2.base)) (.cse8 (select |#length| cstrcpy_~dst~2.base)) (.cse20 (select |#length| cstrcpy_~s2.base)) (.cse24 (select |#length| cstrcpy_~s1.base)) (.cse23 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse19 (+ .cse23 (- 1))) (.cse0 (not (= cstrcpy_~s1.base cstrcpy_~s2.base))) (.cse1 (= 0 cstrcpy_~s2.offset)) (.cse2 (<= .cse23 .cse24)) (.cse3 (= 1 (select |#valid| cstrcpy_~s1.base))) (.cse5 (not (= cstrcpy_~s1.base |cstrcpy_#in~s2.base|))) (.cse6 (<= .cse20 .cse24)) (.cse9 (= 0 cstrcpy_~s1.offset)) (.cse10 (= 0 (select (select |#memory_int| cstrcpy_~s2.base) (+ .cse20 (- 1))))) (.cse11 (= 1 (select |#valid| cstrcpy_~src~2.base))) (.cse21 (<= .cse7 .cse8)) (.cse12 (not (= cstrcpy_~dst~2.base cstrcpy_~s2.base))) (.cse4 (<= 1 cstrcpy_~src~2.offset)) (.cse13 (<= 1 .cse20)) (.cse14 (not (= cstrcpy_~dst~2.base cstrcpy_~src~2.base))) (.cse15 (= 0 (select .cse22 (+ .cse7 (- 1))))) (.cse16 (<= (+ cstrcpy_~src~2.offset 1) .cse7)) (.cse17 (= 1 (select |#valid| cstrcpy_~dst~2.base))) (.cse18 (= 1 (select |#valid| cstrcpy_~s2.base)))) (or (and .cse0 .cse1 .cse2 (<= 2 cstrcpy_~dst~2.offset) .cse3 .cse4 .cse5 .cse6 (<= (+ cstrcpy_~dst~2.offset .cse7) (+ cstrcpy_~src~2.offset .cse8)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1)) (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|) (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|))) (not (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) .cse19))) (not (= 0 |cstrcpy_#in~s1.offset|)) (and .cse0 .cse1 .cse2 (= 0 cstrcpy_~dst~2.offset) (= 0 cstrcpy_~src~2.offset) .cse3 (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) .cse19)) .cse5 .cse6 (<= .cse20 .cse8) .cse9 .cse10 .cse11 .cse21 .cse12 (<= 1 .cse7) .cse13 .cse14 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 (<= cstrcpy_~dst~2.offset 1) .cse3 (exists ((|cstrcpy_#t~post0.offset| Int) (|cstrcpy_#t~post0.base| Int)) (and (= (select (select |#memory_int| |cstrcpy_#t~post0.base|) |cstrcpy_#t~post0.offset|) (select (select |#memory_int| cstrcpy_~src~2.base) (+ cstrcpy_~src~2.offset (- 1)))) (not (= cstrcpy_~src~2.base |cstrcpy_#t~post0.base|)))) .cse5 (not (= 0 (select .cse22 (+ cstrcpy_~src~2.offset (- 1))))) .cse6 .cse9 .cse10 (<= 1 cstrcpy_~dst~2.offset) .cse11 .cse21 .cse12 (or (and (<= (+ cstrcpy_~src~2.offset 2) .cse7) .cse4) (and (<= cstrcpy_~src~2.offset 1) .cse4)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (not (= 0 |cstrcpy_#in~s2.offset|)) (< (select |#length| |cstrcpy_#in~s1.base|) .cse23) (< .cse23 1)))) [2018-01-29 22:36:52,142 INFO L399 ceAbstractionStarter]: For program point L544''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,142 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,142 INFO L399 ceAbstractionStarter]: For program point L544''''''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,142 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,142 INFO L399 ceAbstractionStarter]: For program point L544'''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 547) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 547) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point L544'''''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''''''(lines 544 545) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L395 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 547) the Hoare annotation is: (let ((.cse1 (select |#length| |cstrcpy_#in~s2.base|))) (let ((.cse0 (+ .cse1 (- 1)))) (or (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) .cse0)) (not (= (select |#valid| |cstrcpy_#in~s1.base|) 1)) (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|) (not (= 1 (select |#valid| |cstrcpy_#in~s2.base|))) (not (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~s2.base|) .cse0))) (not (= 0 |cstrcpy_#in~s1.offset|)) (not (= 0 |cstrcpy_#in~s2.offset|)) (< (select |#length| |cstrcpy_#in~s1.base|) .cse1) (< .cse1 1)))) [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,143 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:36:52,143 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,144 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 563) the Hoare annotation is: true [2018-01-29 22:36:52,144 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,144 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 563) the Hoare annotation is: true [2018-01-29 22:36:52,144 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,144 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-29 22:36:52,144 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,144 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-29 22:36:52,144 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-29 22:36:52,144 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 548 563) no Hoare annotation was computed. [2018-01-29 22:36:52,144 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 563) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L399 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L399 ceAbstractionStarter]: For program point L559'''(line 559) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L399 ceAbstractionStarter]: For program point L554'(lines 554 556) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L399 ceAbstractionStarter]: For program point L559''(line 559) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-29 22:36:52,145 INFO L395 ceAbstractionStarter]: At program point L560'(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~3.base))) (and (= 1 (select |#valid| main_~nondetString~3.base)) (= 0 main_~nondetArea~3.offset) (= 0 |main_#t~malloc6.offset|) (not (= main_~nondetArea~3.base main_~nondetString~3.base)) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~3 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~3.base |main_#t~malloc7.base|)) (= 1 (select |#valid| main_~nondetArea~3.base)) (<= main_~length2~3 main_~length1~3) (= 0 (select (select |#memory_int| main_~nondetString~3.base) (+ .cse0 (+ main_~nondetString~3.offset (- 1))))) (= 0 |main_#t~malloc7.offset|) (= main_~length2~3 (select |#length| |main_#t~malloc7.base|)) (= main_~length2~3 .cse0) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= 0 main_~nondetString~3.offset) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (<= 1 main_~length2~3) (= (select |#valid| |main_#t~malloc6.base|) 1) (<= .cse0 (select |#length| main_~nondetArea~3.base)))) [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 548 563) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 548 563) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 548 563) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-29 22:36:52,146 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-29 22:36:52,160 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-29 22:36:52,161 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] [2018-01-29 22:36:52,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-29 22:36:52,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,169 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,187 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-29 22:36:52,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] [2018-01-29 22:36:52,188 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-29 22:36:52,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,197 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:36:52 BoogieIcfgContainer [2018-01-29 22:36:52,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:36:52,204 INFO L168 Benchmark]: Toolchain (without parser) took 20905.60 ms. Allocated memory was 308.3 MB in the beginning and 598.7 MB in the end (delta: 290.5 MB). Free memory was 268.3 MB in the beginning and 507.1 MB in the end (delta: -238.8 MB). Peak memory consumption was 242.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:52,205 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:36:52,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.19 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:52,206 INFO L168 Benchmark]: Boogie Preprocessor took 38.16 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:52,206 INFO L168 Benchmark]: RCFGBuilder took 239.09 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 237.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:52,206 INFO L168 Benchmark]: TraceAbstraction took 20415.60 ms. Allocated memory was 308.3 MB in the beginning and 598.7 MB in the end (delta: 290.5 MB). Free memory was 236.5 MB in the beginning and 507.1 MB in the end (delta: -270.6 MB). Peak memory consumption was 210.2 MB. Max. memory is 5.3 GB. [2018-01-29 22:36:52,208 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.15 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.19 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.16 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 256.1 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 239.09 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 237.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20415.60 ms. Allocated memory was 308.3 MB in the beginning and 598.7 MB in the end (delta: 290.5 MB). Free memory was 236.5 MB in the beginning and 507.1 MB in the end (delta: -270.6 MB). Peak memory consumption was 210.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-29 22:36:52,218 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-29 22:36:52,219 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] [2018-01-29 22:36:52,219 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-29 22:36:52,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,226 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,227 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,229 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,230 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,236 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-29 22:36:52,237 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.offset,QUANTIFIED] [2018-01-29 22:36:52,237 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[cstrcpy_#t~post0.base,QUANTIFIED] [2018-01-29 22:36:52,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,242 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,242 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,242 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,242 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,243 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,243 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,243 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,243 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:36:52,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:36:52,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((((((((!(s1 == s2) && 0 == s2) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && 2 <= dst) && 1 == \valid[s1]) && 1 <= src) && !(s1 == s2)) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && dst + unknown-#length-unknown[src] <= src + unknown-#length-unknown[dst]) && 0 == s1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 == \valid[src]) && !(dst == s2)) && 1 <= unknown-#length-unknown[s2]) && !(dst == src)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && 1 == \valid[s2]) || !(\valid[s1] == 1)) || s1 == s2) || !(1 == \valid[s2])) || !(0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + -1])) || !(0 == s1)) || ((((((((((((((((((((!(s1 == s2) && 0 == s2) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && 0 == dst) && 0 == src) && 1 == \valid[s1]) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && !(s1 == s2)) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && unknown-#length-unknown[s2] <= unknown-#length-unknown[dst]) && 0 == s1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 == \valid[src]) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && !(dst == s2)) && 1 <= unknown-#length-unknown[src]) && 1 <= unknown-#length-unknown[s2]) && !(dst == src)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 1 == \valid[dst]) && 1 == \valid[s2])) || (((((((((((((((((((((!(s1 == s2) && 0 == s2) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && dst <= 1) && 1 == \valid[s1]) && (\exists cstrcpy_#t~post0.offset : int, cstrcpy_#t~post0.base : int :: unknown-#memory_int-unknown[cstrcpy_#t~post0.base][cstrcpy_#t~post0.offset] == unknown-#memory_int-unknown[src][src + -1] && !(src == cstrcpy_#t~post0.base))) && !(s1 == s2)) && !(0 == unknown-#memory_int-unknown[src][src + -1])) && unknown-#length-unknown[s2] <= unknown-#length-unknown[s1]) && 0 == s1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 <= dst) && 1 == \valid[src]) && unknown-#length-unknown[src] <= unknown-#length-unknown[dst]) && !(dst == s2)) && ((src + 2 <= unknown-#length-unknown[src] && 1 <= src) || (src <= 1 && 1 <= src))) && 1 <= unknown-#length-unknown[s2]) && !(dst == src)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && 1 == \valid[s2])) || !(0 == s2)) || unknown-#length-unknown[s1] < unknown-#length-unknown[s2]) || unknown-#length-unknown[s2] < 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 7 error locations. SAFE Result, 20.3s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 572 SDtfs, 1486 SDslu, 5303 SDs, 0 SdLazy, 4206 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 541 GetRequests, 185 SyntacticMatches, 11 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 599 HoareAnnotationTreeSize, 7 FomulaSimplifications, 25 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 879 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 741 NumberOfCodeBlocks, 741 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 723 ConstructedInterpolants, 36 QuantifiedInterpolants, 374185 SizeOfPredicates, 127 NumberOfNonLiveVariables, 855 ConjunctsInSsa, 263 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 25/224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! 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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-36-52-251.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-36-52-251.csv Received shutdown request...