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/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:45:53,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:45:53,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:45:53,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:45:53,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:45:53,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:45:53,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:45:53,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:45:53,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:45:53,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:45:53,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:45:53,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:45:53,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:45:53,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:45:53,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:45:53,077 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:45:53,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:45:53,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:45:53,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:45:53,083 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:45:53,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:45:53,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:45:53,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:45:53,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:45:53,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:45:53,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:45:53,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:45:53,089 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:45:53,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:45:53,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:45:53,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:45:53,090 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:45:53,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:45:53,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:45:53,101 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:45:53,101 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:45:53,101 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:45:53,101 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:45:53,102 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:45:53,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:45:53,102 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:45:53,103 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:45:53,103 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:45:53,103 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:45:53,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:45:53,103 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:45:53,104 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:45:53,104 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:45:53,104 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:45:53,104 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:45:53,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:45:53,105 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:45:53,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:45:53,105 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:45:53,105 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:45:53,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:45:53,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:45:53,106 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:45:53,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:45:53,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:45:53,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:45:53,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:45:53,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:45:53,107 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:45:53,108 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:45:53,108 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:45:53,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:45:53,154 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:45:53,158 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:45:53,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:45:53,160 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:45:53,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:45:53,320 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:45:53,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:45:53,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:45:53,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:45:53,330 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:45:53,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53, skipping insertion in model container [2018-01-29 22:45:53,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,350 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:45:53,389 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:45:53,501 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:45:53,517 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:45:53,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53 WrapperNode [2018-01-29 22:45:53,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:45:53,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:45:53,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:45:53,523 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:45:53,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (1/1) ... [2018-01-29 22:45:53,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:45:53,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:45:53,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:45:53,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:45:53,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (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:45:53,599 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:45:53,600 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:45:53,600 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-29 22:45:53,600 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:45:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:45:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:45:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:45:53,600 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:45:53,601 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:45:53,601 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:45:53,601 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-29 22:45:53,601 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:45:53,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:45:53,601 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:45:53,795 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:45:53,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:45:53 BoogieIcfgContainer [2018-01-29 22:45:53,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:45:53,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:45:53,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:45:53,799 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:45:53,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:45:53" (1/3) ... [2018-01-29 22:45:53,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44161853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:45:53, skipping insertion in model container [2018-01-29 22:45:53,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:45:53" (2/3) ... [2018-01-29 22:45:53,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44161853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:45:53, skipping insertion in model container [2018-01-29 22:45:53,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:45:53" (3/3) ... [2018-01-29 22:45:53,802 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:45:53,809 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:45:53,816 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-29 22:45:53,850 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:45:53,850 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:45:53,851 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:45:53,851 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:45:53,851 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:45:53,851 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:45:53,851 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:45:53,851 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:45:53,852 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:45:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-29 22:45:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-29 22:45:53,878 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:53,879 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:45:53,879 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2131412433, now seen corresponding path program 1 times [2018-01-29 22:45:53,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:53,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:53,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:53,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:53,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:53,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:54,035 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:45:54,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:45:54,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 22:45:54,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:45:54,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:45:54,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:45:54,053 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-29 22:45:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:54,156 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-29 22:45:54,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:45:54,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-29 22:45:54,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:54,171 INFO L225 Difference]: With dead ends: 74 [2018-01-29 22:45:54,171 INFO L226 Difference]: Without dead ends: 55 [2018-01-29 22:45:54,243 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:45:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-29 22:45:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-29 22:45:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-29 22:45:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-29 22:45:54,281 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 17 [2018-01-29 22:45:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:54,281 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-29 22:45:54,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:45:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-29 22:45:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:45:54,282 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:54,282 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:45:54,282 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash -52534590, now seen corresponding path program 1 times [2018-01-29 22:45:54,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:54,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:54,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:54,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:54,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:54,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:54,350 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:45:54,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:45:54,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:45:54,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:45:54,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:45:54,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:45:54,353 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2018-01-29 22:45:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:54,426 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-01-29 22:45:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:45:54,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-29 22:45:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:54,428 INFO L225 Difference]: With dead ends: 55 [2018-01-29 22:45:54,428 INFO L226 Difference]: Without dead ends: 54 [2018-01-29 22:45:54,429 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:45:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-29 22:45:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-29 22:45:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-29 22:45:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-01-29 22:45:54,439 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 20 [2018-01-29 22:45:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:54,439 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-01-29 22:45:54,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:45:54,440 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-01-29 22:45:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:45:54,441 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:54,441 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:45:54,441 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash -52534589, now seen corresponding path program 1 times [2018-01-29 22:45:54,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:54,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:54,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:54,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:54,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:54,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:54,568 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:45:54,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:45:54,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:45:54,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:45:54,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:45:54,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:45:54,569 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2018-01-29 22:45:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:54,630 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-01-29 22:45:54,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:45:54,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-29 22:45:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:54,631 INFO L225 Difference]: With dead ends: 54 [2018-01-29 22:45:54,632 INFO L226 Difference]: Without dead ends: 53 [2018-01-29 22:45:54,632 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:45:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-29 22:45:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-29 22:45:54,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-29 22:45:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-29 22:45:54,639 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 20 [2018-01-29 22:45:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:54,640 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-29 22:45:54,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:45:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-29 22:45:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 22:45:54,641 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:54,641 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] [2018-01-29 22:45:54,641 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash -264092111, now seen corresponding path program 1 times [2018-01-29 22:45:54,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:54,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:54,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:54,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:54,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:54,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:54,703 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:45:54,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:45:54,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:45:54,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:45:54,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:45:54,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:45:54,704 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2018-01-29 22:45:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:54,765 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-01-29 22:45:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:45:54,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-29 22:45:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:54,766 INFO L225 Difference]: With dead ends: 53 [2018-01-29 22:45:54,766 INFO L226 Difference]: Without dead ends: 52 [2018-01-29 22:45:54,767 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:45:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-29 22:45:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-29 22:45:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-29 22:45:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-29 22:45:54,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 26 [2018-01-29 22:45:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:54,774 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-29 22:45:54,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:45:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-29 22:45:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 22:45:54,775 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:54,775 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] [2018-01-29 22:45:54,775 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash -264092110, now seen corresponding path program 1 times [2018-01-29 22:45:54,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:54,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:54,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:54,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:54,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:54,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:54,911 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:45:54,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:45:54,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:45:54,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:45:54,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:45:54,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:45:54,912 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 8 states. [2018-01-29 22:45:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:55,018 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-29 22:45:55,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:45:55,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-01-29 22:45:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:55,022 INFO L225 Difference]: With dead ends: 66 [2018-01-29 22:45:55,023 INFO L226 Difference]: Without dead ends: 65 [2018-01-29 22:45:55,023 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:45:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-29 22:45:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-01-29 22:45:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-29 22:45:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-01-29 22:45:55,030 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 26 [2018-01-29 22:45:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:55,030 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-01-29 22:45:55,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:45:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-01-29 22:45:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 22:45:55,032 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:55,032 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] [2018-01-29 22:45:55,032 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash 403079131, now seen corresponding path program 1 times [2018-01-29 22:45:55,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:55,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:55,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:55,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:55,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:55,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:55,184 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:45:55,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:45:55,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:45:55,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:45:55,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:45:55,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:45:55,185 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 10 states. [2018-01-29 22:45:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:55,344 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-01-29 22:45:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:45:55,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-29 22:45:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:55,345 INFO L225 Difference]: With dead ends: 54 [2018-01-29 22:45:55,345 INFO L226 Difference]: Without dead ends: 53 [2018-01-29 22:45:55,346 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:45:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-29 22:45:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-29 22:45:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-29 22:45:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-29 22:45:55,352 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 27 [2018-01-29 22:45:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:55,353 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-29 22:45:55,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:45:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-29 22:45:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 22:45:55,354 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:55,354 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] [2018-01-29 22:45:55,354 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash 403079132, now seen corresponding path program 1 times [2018-01-29 22:45:55,354 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:55,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:55,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:55,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:55,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:55,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:55,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:45:55,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:45:55,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:45:55,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:45:55,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:45:55,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:45:55,484 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 8 states. [2018-01-29 22:45:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:55,698 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-29 22:45:55,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:45:55,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-29 22:45:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:55,717 INFO L225 Difference]: With dead ends: 66 [2018-01-29 22:45:55,718 INFO L226 Difference]: Without dead ends: 65 [2018-01-29 22:45:55,718 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-29 22:45:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-29 22:45:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2018-01-29 22:45:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-29 22:45:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-01-29 22:45:55,723 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 27 [2018-01-29 22:45:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:55,723 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-01-29 22:45:55,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:45:55,723 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-01-29 22:45:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 22:45:55,724 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:55,724 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:45:55,724 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash -267298687, now seen corresponding path program 1 times [2018-01-29 22:45:55,725 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:55,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:55,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:55,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:55,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:55,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:45:55,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:45:55,964 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:45:55,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:56,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:45:56,058 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:45:56,065 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:45:56,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:56,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:45:56,089 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:45:56,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:45:56,170 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 18 treesize of output 14 [2018-01-29 22:45:56,178 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 14 treesize of output 11 [2018-01-29 22:45:56,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:45:56,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:45:56,194 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:45:56,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-29 22:45:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:45:56,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:45:56,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2018-01-29 22:45:56,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 22:45:56,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 22:45:56,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:45:56,303 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 17 states. [2018-01-29 22:45:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:56,760 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-01-29 22:45:56,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 22:45:56,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-01-29 22:45:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:56,761 INFO L225 Difference]: With dead ends: 79 [2018-01-29 22:45:56,761 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 22:45:56,762 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-01-29 22:45:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 22:45:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-29 22:45:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-29 22:45:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-29 22:45:56,771 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 37 [2018-01-29 22:45:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:56,771 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-29 22:45:56,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 22:45:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-29 22:45:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:45:56,772 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:56,773 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:45:56,773 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash 303675245, now seen corresponding path program 1 times [2018-01-29 22:45:56,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:56,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:56,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:56,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:56,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:56,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:45:57,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:45:57,032 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:45:57,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:57,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:45:57,062 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:45:57,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:57,068 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:45:57,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:57,073 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:45:57,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-29 22:45:57,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:45:57,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:45:57,129 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:45:57,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:57,137 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:45:57,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:57,147 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:45:57,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-29 22:45:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:45:57,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:45:57,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-01-29 22:45:57,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 22:45:57,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 22:45:57,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:45:57,437 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 26 states. [2018-01-29 22:45:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:58,058 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-29 22:45:58,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 22:45:58,058 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-01-29 22:45:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:58,059 INFO L225 Difference]: With dead ends: 81 [2018-01-29 22:45:58,059 INFO L226 Difference]: Without dead ends: 80 [2018-01-29 22:45:58,060 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1236, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 22:45:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-29 22:45:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2018-01-29 22:45:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-29 22:45:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-01-29 22:45:58,066 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 38 [2018-01-29 22:45:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:58,067 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-01-29 22:45:58,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 22:45:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-01-29 22:45:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:45:58,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:58,068 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] [2018-01-29 22:45:58,068 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash -231889037, now seen corresponding path program 1 times [2018-01-29 22:45:58,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:58,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:58,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:58,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:58,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:58,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:58,186 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:45:58,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:45:58,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:45:58,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:45:58,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:45:58,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:45:58,187 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 6 states. [2018-01-29 22:45:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:45:58,275 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-01-29 22:45:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:45:58,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-29 22:45:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:45:58,276 INFO L225 Difference]: With dead ends: 65 [2018-01-29 22:45:58,276 INFO L226 Difference]: Without dead ends: 53 [2018-01-29 22:45:58,277 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:45:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-29 22:45:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-29 22:45:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-29 22:45:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-29 22:45:58,286 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 39 [2018-01-29 22:45:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:45:58,287 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-29 22:45:58,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:45:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-29 22:45:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-29 22:45:58,288 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:45:58,289 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 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] [2018-01-29 22:45:58,289 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:45:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash 643108562, now seen corresponding path program 2 times [2018-01-29 22:45:58,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:45:58,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:45:58,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:58,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:45:58,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:45:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:45:58,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:45:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:45:58,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:45:58,778 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:45:58,783 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:45:58,795 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:45:58,801 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:45:58,804 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:45:58,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:45:58,810 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:45:58,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:58,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:45:58,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:45:58,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:45:58,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:45:58,818 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:45:58,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:58,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-01-29 22:45:58,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:58,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:45:58,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:45:58,862 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:45:58,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:45:58,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:58,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:45:58,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:45:58,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-29 22:45:59,012 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 24 treesize of output 25 [2018-01-29 22:45:59,024 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:45:59,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:45:59,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:45:59,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:45:59,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-29 22:45:59,227 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:45:59,240 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:45:59,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:45:59,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:45:59,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:45:59,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-29 22:45:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:45:59,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:45:59,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2018-01-29 22:45:59,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 22:45:59,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 22:45:59,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:45:59,350 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 26 states. [2018-01-29 22:46:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:00,225 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-29 22:46:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 22:46:00,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-01-29 22:46:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:00,226 INFO L225 Difference]: With dead ends: 57 [2018-01-29 22:46:00,226 INFO L226 Difference]: Without dead ends: 56 [2018-01-29 22:46:00,227 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=1270, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:46:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-29 22:46:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2018-01-29 22:46:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-29 22:46:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-29 22:46:00,235 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2018-01-29 22:46:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:00,236 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-29 22:46:00,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 22:46:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-29 22:46:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 22:46:00,237 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:46:00,237 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2018-01-29 22:46:00,238 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:46:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1538471108, now seen corresponding path program 2 times [2018-01-29 22:46:00,238 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:46:00,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:46:00,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,239 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:46:00,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:46:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:46:00,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:46:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:00,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:46:00,573 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:46:00,579 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:46:00,590 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:00,596 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:46:00,598 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:46:00,601 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:46:00,614 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:46:00,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:00,635 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:46:00,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:00,641 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:46:00,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-29 22:46:00,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:00,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:46:00,654 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:46:00,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:00,667 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:46:00,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:46:00,675 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:46:00,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-29 22:46:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:46:00,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:46:00,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-29 22:46:00,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 22:46:00,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 22:46:00,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:46:00,928 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-01-29 22:46:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:46:01,740 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-01-29 22:46:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 22:46:01,741 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-01-29 22:46:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:46:01,741 INFO L225 Difference]: With dead ends: 70 [2018-01-29 22:46:01,741 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:46:01,742 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=1515, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 22:46:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:46:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:46:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:46:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:46:01,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-29 22:46:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:46:01,743 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:46:01,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 22:46:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:46:01,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:46:01,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:46:02,309 WARN L146 SmtUtils]: Spent 484ms on a formula simplification. DAG size of input: 129 DAG size of output 107 [2018-01-29 22:46:02,519 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 68 DAG size of output 53 [2018-01-29 22:46:02,524 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,524 INFO L399 ceAbstractionStarter]: For program point L544'''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,524 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,524 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 546) no Hoare annotation was computed. [2018-01-29 22:46:02,524 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,524 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,524 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-29 22:46:02,524 INFO L399 ceAbstractionStarter]: For program point L544''''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,525 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,525 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,525 INFO L399 ceAbstractionStarter]: For program point L544''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,525 INFO L399 ceAbstractionStarter]: For program point L544'''''''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,526 INFO L395 ceAbstractionStarter]: At program point L544''''''''''''(line 544) the Hoare annotation is: (let ((.cse9 (select |#length| cstrcpy_~from.base)) (.cse4 (select |#length| cstrcpy_~to.base))) (let ((.cse0 (select |#length| |cstrcpy_#in~from.base|)) (.cse3 (<= .cse9 .cse4)) (.cse8 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 1) cstrcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (= 0 (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| cstrcpy_~from.base) (- 1))))))) (.cse1 (= 1 (select |#valid| cstrcpy_~from.base))) (.cse5 (= (select |#valid| cstrcpy_~to.base) 1)) (.cse6 (not (= cstrcpy_~to.base cstrcpy_~from.base))) (.cse10 (<= (+ cstrcpy_~from.offset 1) .cse9)) (.cse2 (not (= cstrcpy_~to.base |cstrcpy_#in~from.base|))) (.cse7 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstrcpy_#in~from.base|) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2))))) (or (not (= (select |#valid| |cstrcpy_#in~to.base|) 1)) (< (select |#length| |cstrcpy_#in~to.base|) .cse0) (and .cse1 (= cstrcpy_~from.offset 0) .cse2 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_1 Int) (main_~length2~4 Int)) (and (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4) (select |#length| cstrcpy_~from.base)) (<= 1 main_~length2~4) (= 0 (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4 (- 1)))) (<= cstrcpy_~from.offset v_main_~nondetString~4.offset_BEFORE_CALL_1))) (= cstrcpy_~to.offset 0) .cse3 (<= .cse0 .cse4) .cse5 .cse6 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 cstrcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2) (= 0 (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| cstrcpy_~from.base) (- 1)))))) .cse7) (and .cse8 .cse1 (<= cstrcpy_~to.offset 1) (or (<= (+ cstrcpy_~from.offset 2) .cse9) (= 1 cstrcpy_~from.offset)) .cse3 .cse5 .cse6 .cse10 .cse2 .cse7 (<= 1 cstrcpy_~to.offset)) (and .cse8 (<= (+ cstrcpy_~to.offset .cse9) (+ .cse4 cstrcpy_~from.offset)) .cse1 (<= 2 cstrcpy_~to.offset) .cse5 .cse6 .cse10 .cse2 (<= 2 cstrcpy_~from.offset) .cse7) (not (= 1 (select |#valid| |cstrcpy_#in~from.base|))) (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstrcpy_#in~from.base|) (- 1)))) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2)))) (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|) (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_1 Int) (main_~length2~4 Int)) (and (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4) (select |#length| |cstrcpy_#in~from.base|)) (<= |cstrcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_1) (= (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4 (- 1))) 0) (<= 1 main_~length2~4)))) (not (= 0 |cstrcpy_#in~to.offset|)) (not (= 0 |cstrcpy_#in~from.offset|))))) [2018-01-29 22:46:02,526 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,526 INFO L399 ceAbstractionStarter]: For program point L544'''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,526 INFO L399 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-29 22:46:02,526 INFO L399 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,526 INFO L399 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-29 22:46:02,526 INFO L399 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,526 INFO L399 ceAbstractionStarter]: For program point L544'''''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,527 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-29 22:46:02,527 INFO L395 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 546) the Hoare annotation is: (let ((.cse0 (select |#length| |cstrcpy_#in~from.base|))) (or (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|) (not (= (select |#valid| |cstrcpy_#in~to.base|) 1)) (< (select |#length| |cstrcpy_#in~to.base|) .cse0) (not (= 0 |cstrcpy_#in~to.offset|)) (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (= (select (select |#memory_int| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstrcpy_#in~from.base|) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2))) (< .cse0 1) (not (= 1 (select |#valid| |cstrcpy_#in~from.base|))) (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 0) (= 0 (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_2 (select |#length| |cstrcpy_#in~from.base|) (- 1)))) (<= v_main_~nondetString~4.offset_BEFORE_CALL_2 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_2)))) (not (= 0 |cstrcpy_#in~from.offset|)))) [2018-01-29 22:46:02,527 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,527 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,527 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:46:02,527 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,527 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,528 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 562) no Hoare annotation was computed. [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:46:02,528 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-29 22:46:02,529 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-29 22:46:02,530 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 547 562) no Hoare annotation was computed. [2018-01-29 22:46:02,530 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-29 22:46:02,530 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-29 22:46:02,530 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-29 22:46:02,530 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-29 22:46:02,530 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 547 562) no Hoare annotation was computed. [2018-01-29 22:46:02,530 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 547 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:46:02,530 INFO L399 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-29 22:46:02,530 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-29 22:46:02,531 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-29 22:46:02,531 INFO L395 ceAbstractionStarter]: At program point L559'(line 559) the Hoare annotation is: (let ((.cse1 (select |#length| |main_#t~malloc7.base|)) (.cse0 (select |#length| main_~nondetString~4.base))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= |old(#valid)| (store (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc7.base| 0)) (= 1 (select |#valid| main_~nondetString~4.base)) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= main_~length2~4 .cse0) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ main_~nondetString~4.offset .cse0 (- 1)))) (= (select |#valid| |main_#t~malloc6.base|) 1))) [2018-01-29 22:46:02,531 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-29 22:46:02,542 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,543 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,544 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,545 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,546 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,547 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,548 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,549 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,550 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,551 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,552 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,553 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,554 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,555 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,557 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,558 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,559 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,560 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,580 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,581 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,582 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,582 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,583 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,584 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,585 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,586 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,587 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,588 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,588 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,589 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,590 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,591 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,592 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,593 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:46:02 BoogieIcfgContainer [2018-01-29 22:46:02,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:46:02,601 INFO L168 Benchmark]: Toolchain (without parser) took 9280.37 ms. Allocated memory was 304.1 MB in the beginning and 579.9 MB in the end (delta: 275.8 MB). Free memory was 264.1 MB in the beginning and 377.8 MB in the end (delta: -113.7 MB). Peak memory consumption was 162.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:46:02,602 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:46:02,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.59 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 252.9 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:46:02,603 INFO L168 Benchmark]: Boogie Preprocessor took 30.17 ms. Allocated memory is still 304.1 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:46:02,603 INFO L168 Benchmark]: RCFGBuilder took 242.58 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 233.3 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:46:02,604 INFO L168 Benchmark]: TraceAbstraction took 8803.43 ms. Allocated memory was 304.1 MB in the beginning and 579.9 MB in the end (delta: 275.8 MB). Free memory was 233.3 MB in the beginning and 377.8 MB in the end (delta: -144.5 MB). Peak memory consumption was 131.3 MB. Max. memory is 5.3 GB. [2018-01-29 22:46:02,606 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.21 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.59 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 252.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.17 ms. Allocated memory is still 304.1 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 242.58 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 233.3 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8803.43 ms. Allocated memory was 304.1 MB in the beginning and 579.9 MB in the end (delta: 275.8 MB). Free memory was 233.3 MB in the beginning and 377.8 MB in the end (delta: -144.5 MB). Peak memory consumption was 131.3 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[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,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 #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 #memory_int - 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 #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 #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 #memory_int - 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 #memory_int - 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 #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 #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 #memory_int - 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 * 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: 547]: 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:46:02,616 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,617 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,618 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,623 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,624 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,625 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,626 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,627 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,628 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,629 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,635 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,636 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,637 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,638 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-29 22:46:02,642 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:46:02,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,643 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-29 22:46:02,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,644 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,645 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:46:02,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:46:02,651 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((!(\valid[to] == 1) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) || ((((((((((1 == \valid[from] && from == 0) && !(to == from)) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_1 : int, main_~length2~4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 <= unknown-#length-unknown[from] && 1 <= main_~length2~4) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 + -1]) && from <= v_main_~nondetString~4.offset_BEFORE_CALL_1)) && to == 0) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && !(to == from)) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1])) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2))) || (((((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 + 1 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1]) && 1 == \valid[from]) && to <= 1) && (from + 2 <= unknown-#length-unknown[from] || 1 == from)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && !(to == from)) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2)) && 1 <= to)) || ((((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 + 1 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1]) && to + unknown-#length-unknown[from] <= unknown-#length-unknown[to] + from) && 1 == \valid[from]) && 2 <= to) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && !(to == from)) && 2 <= from) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2))) || !(1 == \valid[from])) || !(\exists v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_2 <= 0 && 0 == \old(unknown-#memory_int-unknown)[from][v_main_~nondetString~4.offset_BEFORE_CALL_2 + unknown-#length-unknown[from] + -1]) && v_main_~nondetString~4.offset_BEFORE_CALL_2 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_2)) || from == to) || !(\exists v_main_~nondetString~4.offset_BEFORE_CALL_1 : int, main_~length2~4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 <= unknown-#length-unknown[from] && from <= v_main_~nondetString~4.offset_BEFORE_CALL_1) && \old(unknown-#memory_int-unknown)[from][v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 + -1] == 0) && 1 <= main_~length2~4)) || !(0 == to)) || !(0 == from) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 7 error locations. SAFE Result, 8.6s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 517 SDtfs, 940 SDslu, 2863 SDs, 0 SdLazy, 2042 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 55 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 568 HoareAnnotationTreeSize, 7 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 487 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 530 ConstructedInterpolants, 24 QuantifiedInterpolants, 184494 SizeOfPredicates, 41 NumberOfNonLiveVariables, 568 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 3/74 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/openbsd_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-46-02-657.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-46-02-657.csv Received shutdown request...