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/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:39:32,173 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:39:32,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:39:32,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:39:32,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:39:32,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:39:32,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:39:32,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:39:32,196 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:39:32,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:39:32,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:39:32,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:39:32,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:39:32,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:39:32,201 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:39:32,203 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:39:32,206 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:39:32,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:39:32,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:39:32,210 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:39:32,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:39:32,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:39:32,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:39:32,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:39:32,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:39:32,217 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:39:32,217 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:39:32,218 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:39:32,218 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:39:32,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:39:32,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:39:32,219 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:39:32,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:39:32,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:39:32,228 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:39:32,228 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:39:32,229 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:39:32,229 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:39:32,229 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:39:32,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:39:32,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:39:32,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:39:32,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:39:32,230 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:39:32,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:39:32,230 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:39:32,230 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:39:32,230 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:39:32,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:39:32,231 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:39:32,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:39:32,231 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:39:32,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:39:32,231 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:39:32,231 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:39:32,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:39:32,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:39:32,232 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:39:32,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:39:32,232 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:39:32,232 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:39:32,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:39:32,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:39:32,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:39:32,233 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:39:32,234 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:39:32,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:39:32,277 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:39:32,281 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:39:32,282 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:39:32,282 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:39:32,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:39:32,440 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:39:32,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:39:32,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:39:32,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:39:32,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:39:32,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c55e0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32, skipping insertion in model container [2018-01-29 22:39:32,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,468 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:39:32,507 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:39:32,627 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:39:32,650 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:39:32,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32 WrapperNode [2018-01-29 22:39:32,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:39:32,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:39:32,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:39:32,660 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:39:32,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (1/1) ... [2018-01-29 22:39:32,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:39:32,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:39:32,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:39:32,699 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:39:32,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (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:39:32,753 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:39:32,753 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:39:32,753 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-29 22:39:32,753 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:39:32,753 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:39:32,754 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:39:32,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:39:32,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:39:32,754 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:39:32,754 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:39:32,754 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-29 22:39:32,755 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:39:32,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:39:32,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:39:33,012 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:39:33,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:39:33 BoogieIcfgContainer [2018-01-29 22:39:33,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:39:33,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:39:33,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:39:33,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:39:33,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:39:32" (1/3) ... [2018-01-29 22:39:33,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67813434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:39:33, skipping insertion in model container [2018-01-29 22:39:33,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:39:32" (2/3) ... [2018-01-29 22:39:33,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67813434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:39:33, skipping insertion in model container [2018-01-29 22:39:33,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:39:33" (3/3) ... [2018-01-29 22:39:33,019 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:39:33,026 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:39:33,032 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-29 22:39:33,084 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:39:33,085 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:39:33,085 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:39:33,085 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:39:33,085 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:39:33,085 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:39:33,085 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:39:33,086 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:39:33,087 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:39:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-29 22:39:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:39:33,116 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:33,117 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:33,118 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 379542241, now seen corresponding path program 1 times [2018-01-29 22:39:33,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:33,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:33,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:33,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:33,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:33,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:33,356 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:39:33,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:33,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:39:33,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:39:33,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:39:33,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:39:33,374 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-01-29 22:39:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:33,614 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-29 22:39:33,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:39:33,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 22:39:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:33,627 INFO L225 Difference]: With dead ends: 95 [2018-01-29 22:39:33,627 INFO L226 Difference]: Without dead ends: 77 [2018-01-29 22:39:33,630 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:39:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-29 22:39:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-29 22:39:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-29 22:39:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-29 22:39:33,664 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2018-01-29 22:39:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:33,664 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-29 22:39:33,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:39:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-29 22:39:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:39:33,665 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:33,665 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:33,665 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash 379542242, now seen corresponding path program 1 times [2018-01-29 22:39:33,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:33,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:33,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:33,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:33,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:33,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:33,801 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:39:33,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:33,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:39:33,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:39:33,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:39:33,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:39:33,804 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 5 states. [2018-01-29 22:39:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:33,878 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-29 22:39:33,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:39:33,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-29 22:39:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:33,881 INFO L225 Difference]: With dead ends: 77 [2018-01-29 22:39:33,881 INFO L226 Difference]: Without dead ends: 76 [2018-01-29 22:39:33,882 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:39:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-29 22:39:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-29 22:39:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-29 22:39:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-29 22:39:33,892 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 19 [2018-01-29 22:39:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:33,893 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-29 22:39:33,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:39:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-29 22:39:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 22:39:33,894 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:33,895 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:33,895 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash 647666553, now seen corresponding path program 1 times [2018-01-29 22:39:33,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:33,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:33,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:33,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:33,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:33,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:34,038 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:39:34,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:34,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:39:34,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:39:34,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:39:34,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:39:34,040 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 7 states. [2018-01-29 22:39:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:34,195 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-01-29 22:39:34,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:39:34,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-29 22:39:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:34,197 INFO L225 Difference]: With dead ends: 76 [2018-01-29 22:39:34,197 INFO L226 Difference]: Without dead ends: 75 [2018-01-29 22:39:34,198 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:39:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-29 22:39:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-29 22:39:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-29 22:39:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-29 22:39:34,206 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 37 [2018-01-29 22:39:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:34,207 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-29 22:39:34,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:39:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-29 22:39:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 22:39:34,208 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:34,209 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] [2018-01-29 22:39:34,209 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:34,209 INFO L82 PathProgramCache]: Analyzing trace with hash 647666554, now seen corresponding path program 1 times [2018-01-29 22:39:34,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:34,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:34,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:34,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:34,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:34,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:34,407 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:39:34,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:34,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:39:34,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:39:34,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:39:34,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:39:34,409 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 10 states. [2018-01-29 22:39:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:34,606 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-29 22:39:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:39:34,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-29 22:39:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:34,610 INFO L225 Difference]: With dead ends: 97 [2018-01-29 22:39:34,610 INFO L226 Difference]: Without dead ends: 96 [2018-01-29 22:39:34,611 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:39:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-29 22:39:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2018-01-29 22:39:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:39:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-29 22:39:34,620 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 37 [2018-01-29 22:39:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:34,620 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-29 22:39:34,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:39:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-29 22:39:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:39:34,622 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:34,622 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] [2018-01-29 22:39:34,622 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1397173340, now seen corresponding path program 1 times [2018-01-29 22:39:34,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:34,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:34,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:34,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:34,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:34,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:34,813 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:39:34,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:34,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:39:34,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:39:34,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:39:34,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:39:34,815 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 10 states. [2018-01-29 22:39:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:35,006 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-01-29 22:39:35,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:39:35,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-29 22:39:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:35,007 INFO L225 Difference]: With dead ends: 85 [2018-01-29 22:39:35,007 INFO L226 Difference]: Without dead ends: 84 [2018-01-29 22:39:35,008 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:39:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-29 22:39:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-29 22:39:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 22:39:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-29 22:39:35,014 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2018-01-29 22:39:35,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:35,015 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-29 22:39:35,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:39:35,015 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-29 22:39:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:39:35,016 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:35,016 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] [2018-01-29 22:39:35,016 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:35,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1397173339, now seen corresponding path program 1 times [2018-01-29 22:39:35,016 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:35,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:35,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:35,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:35,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:35,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:35,220 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:39:35,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:35,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:39:35,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:39:35,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:39:35,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:39:35,222 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 10 states. [2018-01-29 22:39:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:35,399 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-29 22:39:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:39:35,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-29 22:39:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:35,400 INFO L225 Difference]: With dead ends: 92 [2018-01-29 22:39:35,400 INFO L226 Difference]: Without dead ends: 91 [2018-01-29 22:39:35,401 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:39:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-29 22:39:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-01-29 22:39:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:39:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-29 22:39:35,408 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 38 [2018-01-29 22:39:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:35,408 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-29 22:39:35,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:39:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-29 22:39:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:39:35,410 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:35,410 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:39:35,410 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -808357814, now seen corresponding path program 1 times [2018-01-29 22:39:35,411 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:35,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:35,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:35,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:35,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:35,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:35,464 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:39:35,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:35,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:39:35,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:39:35,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:39:35,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:39:35,466 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 5 states. [2018-01-29 22:39:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:35,507 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-01-29 22:39:35,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:39:35,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-29 22:39:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:35,508 INFO L225 Difference]: With dead ends: 96 [2018-01-29 22:39:35,508 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 22:39:35,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:39:35,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 22:39:35,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-29 22:39:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:39:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-29 22:39:35,517 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2018-01-29 22:39:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:35,518 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-29 22:39:35,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:39:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-29 22:39:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:39:35,520 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:35,520 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:35,520 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash 291212881, now seen corresponding path program 1 times [2018-01-29 22:39:35,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:35,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:35,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:35,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:35,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:35,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:35,600 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:39:35,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:35,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:39:35,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:39:35,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:39:35,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:39:35,601 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 6 states. [2018-01-29 22:39:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:35,726 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-01-29 22:39:35,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:39:35,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-01-29 22:39:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:35,727 INFO L225 Difference]: With dead ends: 88 [2018-01-29 22:39:35,727 INFO L226 Difference]: Without dead ends: 87 [2018-01-29 22:39:35,727 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:39:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-29 22:39:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-29 22:39:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 22:39:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-29 22:39:35,734 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 52 [2018-01-29 22:39:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:35,735 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-29 22:39:35,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:39:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-29 22:39:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:39:35,736 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:35,736 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:35,736 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:35,737 INFO L82 PathProgramCache]: Analyzing trace with hash 291212882, now seen corresponding path program 1 times [2018-01-29 22:39:35,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:35,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:35,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:35,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:35,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:35,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:36,173 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:39:36,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:36,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-01-29 22:39:36,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 22:39:36,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 22:39:36,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-01-29 22:39:36,174 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 19 states. [2018-01-29 22:39:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:37,205 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-29 22:39:37,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:39:37,205 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-01-29 22:39:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:37,206 INFO L225 Difference]: With dead ends: 125 [2018-01-29 22:39:37,206 INFO L226 Difference]: Without dead ends: 124 [2018-01-29 22:39:37,207 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 22:39:37,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-29 22:39:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2018-01-29 22:39:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:39:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-29 22:39:37,217 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 52 [2018-01-29 22:39:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:37,217 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-29 22:39:37,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 22:39:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-29 22:39:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:39:37,218 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:37,219 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:37,219 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash -917917903, now seen corresponding path program 1 times [2018-01-29 22:39:37,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:37,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:37,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:37,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:37,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:37,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:37,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:39:37,470 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:39:37,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:37,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:39:37,591 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:39:37,596 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:39:37,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:37,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:37,605 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:39:37,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:39:37,996 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:39:38,003 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:39:38,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:39:38,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:39:38,018 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:39:38,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-29 22:39:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:38,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:39:38,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-29 22:39:38,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:39:38,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:39:38,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:39:38,096 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 21 states. [2018-01-29 22:39:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:39,603 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-29 22:39:39,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:39:39,603 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-01-29 22:39:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:39,605 INFO L225 Difference]: With dead ends: 122 [2018-01-29 22:39:39,605 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 22:39:39,606 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 22:39:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 22:39:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-01-29 22:39:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-29 22:39:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-01-29 22:39:39,615 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 52 [2018-01-29 22:39:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:39,616 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-01-29 22:39:39,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:39:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-01-29 22:39:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 22:39:39,617 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:39,617 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:39,617 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:39,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1609316046, now seen corresponding path program 1 times [2018-01-29 22:39:39,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:39,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:39,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:39,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:39,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:39,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:39,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:39:39,867 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:39:39,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:39,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:39:39,912 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:39:39,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:39,917 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:39:39,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:39,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:39,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:39:39,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:39,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:39,962 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:39:39,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:39,969 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:39:39,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:39,974 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:39:39,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:39:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:40,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:39:40,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2018-01-29 22:39:40,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 22:39:40,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 22:39:40,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2018-01-29 22:39:40,278 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 31 states. [2018-01-29 22:39:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:40,927 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-01-29 22:39:40,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:39:40,927 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-01-29 22:39:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:40,928 INFO L225 Difference]: With dead ends: 130 [2018-01-29 22:39:40,928 INFO L226 Difference]: Without dead ends: 129 [2018-01-29 22:39:40,929 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=1908, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 22:39:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-29 22:39:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2018-01-29 22:39:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 22:39:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-29 22:39:40,938 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 53 [2018-01-29 22:39:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:40,939 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-29 22:39:40,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 22:39:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-29 22:39:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:39:40,940 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:40,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:40,940 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash -2096467391, now seen corresponding path program 1 times [2018-01-29 22:39:40,941 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:40,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:40,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:40,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:40,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:40,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:39:41,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:39:41,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:39:41,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:39:41,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:39:41,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:39:41,054 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 6 states. [2018-01-29 22:39:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:41,168 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-01-29 22:39:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:39:41,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-29 22:39:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:41,169 INFO L225 Difference]: With dead ends: 112 [2018-01-29 22:39:41,170 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 22:39:41,170 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:39:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 22:39:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-29 22:39:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-29 22:39:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-01-29 22:39:41,177 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 54 [2018-01-29 22:39:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:41,178 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-01-29 22:39:41,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:39:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-01-29 22:39:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 22:39:41,179 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:41,179 INFO L350 BasicCegarLoop]: trace histogram [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, 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:39:41,179 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:41,180 INFO L82 PathProgramCache]: Analyzing trace with hash 798896597, now seen corresponding path program 1 times [2018-01-29 22:39:41,180 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:41,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:41,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:41,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:41,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:41,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:41,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:39:41,651 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:39:41,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:41,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:39:41,688 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:39:41,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:41,695 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:39:41,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:41,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:41,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:39:41,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:41,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:41,750 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:39:41,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:41,756 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:39:41,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:41,761 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:39:41,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:39:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:42,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:39:42,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2018-01-29 22:39:42,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-29 22:39:42,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-29 22:39:42,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=2142, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 22:39:42,511 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 48 states. [2018-01-29 22:39:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:45,727 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-29 22:39:45,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-29 22:39:45,728 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 61 [2018-01-29 22:39:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:45,728 INFO L225 Difference]: With dead ends: 120 [2018-01-29 22:39:45,728 INFO L226 Difference]: Without dead ends: 87 [2018-01-29 22:39:45,730 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=642, Invalid=6000, Unknown=0, NotChecked=0, Total=6642 [2018-01-29 22:39:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-29 22:39:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-29 22:39:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 22:39:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-01-29 22:39:45,735 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 61 [2018-01-29 22:39:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:45,735 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-01-29 22:39:45,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-29 22:39:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-01-29 22:39:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-29 22:39:45,736 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:45,736 INFO L350 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:45,736 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash -309742149, now seen corresponding path program 1 times [2018-01-29 22:39:45,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:45,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:45,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:45,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:45,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:45,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:46,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:39:46,211 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:39:46,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:46,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:39:46,252 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:39:46,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:46,259 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:39:46,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:46,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:46,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:39:46,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:46,328 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:39:46,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:46,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:46,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:46,338 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:39:46,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:46,343 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:39:46,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:39:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:46,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:39:46,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2018-01-29 22:39:46,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-29 22:39:46,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-29 22:39:46,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2045, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 22:39:46,996 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 47 states. [2018-01-29 22:39:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:49,854 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-01-29 22:39:49,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-29 22:39:49,854 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 67 [2018-01-29 22:39:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:49,855 INFO L225 Difference]: With dead ends: 129 [2018-01-29 22:39:49,855 INFO L226 Difference]: Without dead ends: 128 [2018-01-29 22:39:49,857 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=722, Invalid=7110, Unknown=0, NotChecked=0, Total=7832 [2018-01-29 22:39:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-29 22:39:49,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2018-01-29 22:39:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-29 22:39:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-01-29 22:39:49,864 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 67 [2018-01-29 22:39:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:49,864 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-01-29 22:39:49,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-29 22:39:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-01-29 22:39:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-29 22:39:49,865 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:49,865 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:49,865 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1518872934, now seen corresponding path program 2 times [2018-01-29 22:39:49,866 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:49,866 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:49,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:49,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:49,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:49,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:50,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:39:50,455 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:39:50,459 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:39:50,471 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:39:50,478 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:39:50,480 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:39:50,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:39:50,486 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:39:50,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:39:50,497 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:39:50,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:50,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:50,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:39:50,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:39:50,563 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:39:50,565 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:39:50,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,571 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:39:50,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:39:50,967 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:39:50,969 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:39:50,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:50,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:39:50,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-29 22:39:51,122 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 22 treesize of output 18 [2018-01-29 22:39:51,128 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 18 treesize of output 15 [2018-01-29 22:39:51,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:39:51,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:39:51,139 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:39:51,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:39:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:51,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:39:51,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-01-29 22:39:51,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 22:39:51,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 22:39:51,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 22:39:51,228 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 38 states. [2018-01-29 22:39:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:53,081 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-29 22:39:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 22:39:53,082 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 67 [2018-01-29 22:39:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:53,083 INFO L225 Difference]: With dead ends: 120 [2018-01-29 22:39:53,083 INFO L226 Difference]: Without dead ends: 119 [2018-01-29 22:39:53,084 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=311, Invalid=3229, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 22:39:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-29 22:39:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-01-29 22:39:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 22:39:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-01-29 22:39:53,090 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 67 [2018-01-29 22:39:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:53,091 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-01-29 22:39:53,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 22:39:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-01-29 22:39:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-29 22:39:53,092 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:53,092 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:53,092 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 159579269, now seen corresponding path program 2 times [2018-01-29 22:39:53,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:53,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:53,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:53,093 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:39:53,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:53,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:53,568 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:39:53,568 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:39:53,580 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:39:53,599 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:39:53,610 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:39:53,614 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:39:53,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:39:53,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:39:53,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:53,632 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:39:53,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:53,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:53,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:39:53,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:53,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:53,705 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:39:53,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:53,714 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:39:53,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:53,721 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:39:53,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:39:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:54,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:39:54,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-01-29 22:39:54,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 22:39:54,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 22:39:54,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 22:39:54,090 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 40 states. [2018-01-29 22:39:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:39:55,298 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-01-29 22:39:55,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 22:39:55,298 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 68 [2018-01-29 22:39:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:39:55,299 INFO L225 Difference]: With dead ends: 136 [2018-01-29 22:39:55,299 INFO L226 Difference]: Without dead ends: 135 [2018-01-29 22:39:55,301 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=522, Invalid=4308, Unknown=0, NotChecked=0, Total=4830 [2018-01-29 22:39:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-29 22:39:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2018-01-29 22:39:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-29 22:39:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-01-29 22:39:55,308 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 68 [2018-01-29 22:39:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:39:55,309 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-01-29 22:39:55,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-29 22:39:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-01-29 22:39:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 22:39:55,310 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:39:55,310 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:39:55,310 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:39:55,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1987358580, now seen corresponding path program 1 times [2018-01-29 22:39:55,311 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:39:55,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:39:55,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:55,311 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:39:55,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:39:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:55,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:39:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-29 22:39:55,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:39:55,869 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:39:55,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:39:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:39:55,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:39:55,901 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:39:55,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:55,906 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:39:55,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:55,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:39:55,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:39:55,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:55,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:39:55,957 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:39:55,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:55,963 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:39:55,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:39:55,967 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:39:55,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:39:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:39:56,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:39:56,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 55 [2018-01-29 22:39:56,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-29 22:39:56,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-29 22:39:56,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2934, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 22:39:56,803 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 56 states. [2018-01-29 22:40:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:40:01,808 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-01-29 22:40:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-29 22:40:01,809 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 76 [2018-01-29 22:40:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:40:01,809 INFO L225 Difference]: With dead ends: 141 [2018-01-29 22:40:01,809 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 22:40:01,812 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1175, Invalid=12631, Unknown=0, NotChecked=0, Total=13806 [2018-01-29 22:40:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 22:40:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-29 22:40:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:40:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-01-29 22:40:01,817 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 76 [2018-01-29 22:40:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:40:01,817 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-01-29 22:40:01,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-29 22:40:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-01-29 22:40:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 22:40:01,818 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:40:01,818 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:40:01,819 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:40:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash -450179055, now seen corresponding path program 3 times [2018-01-29 22:40:01,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:40:01,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:40:01,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:40:01,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:40:01,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:40:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:40:01,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:40:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-29 22:40:02,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:40:02,302 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:40:02,312 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:40:02,324 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:40:02,329 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:40:02,333 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:40:02,337 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:40:02,339 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:40:02,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:40:02,345 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:40:02,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:40:02,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:40:02,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:40:02,351 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:40:02,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,355 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:40:02,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:40:02,402 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:40:02,403 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:40:02,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,409 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:40:02,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:40:02,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 22:40:02,552 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:40:02,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-29 22:40:02,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 22:40:02,609 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:40:02,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:40:02,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-29 22:40:02,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-29 22:40:02,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-29 22:40:02,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:40:02,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:40:02,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:40:02,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-29 22:40:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-29 22:40:02,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:40:02,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 32 [2018-01-29 22:40:02,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 22:40:02,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 22:40:02,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 22:40:02,770 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 33 states. [2018-01-29 22:40:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:40:03,748 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-01-29 22:40:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:40:03,748 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 82 [2018-01-29 22:40:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:40:03,749 INFO L225 Difference]: With dead ends: 85 [2018-01-29 22:40:03,749 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:40:03,750 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=466, Invalid=2504, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 22:40:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:40:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:40:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:40:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:40:03,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2018-01-29 22:40:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:40:03,751 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:40:03,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 22:40:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:40:03,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:40:03,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:40:03,868 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 162 DAG size of output 160 [2018-01-29 22:40:04,066 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 121 DAG size of output 116 [2018-01-29 22:40:05,075 WARN L146 SmtUtils]: Spent 995ms on a formula simplification. DAG size of input: 182 DAG size of output 139 [2018-01-29 22:40:05,951 WARN L146 SmtUtils]: Spent 873ms on a formula simplification. DAG size of input: 150 DAG size of output 95 [2018-01-29 22:40:06,101 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-29 22:40:06,101 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:40:06,101 INFO L399 ceAbstractionStarter]: For program point L546(lines 546 555) no Hoare annotation was computed. [2018-01-29 22:40:06,101 INFO L395 ceAbstractionStarter]: At program point cstrncpyENTRY(lines 540 557) the Hoare annotation is: (let ((.cse1 (select |#length| |cstrncpy_#in~s2.base|))) (let ((.cse0 (+ .cse1 (- 1))) (.cse2 (select |#length| |cstrncpy_#in~s1.base|))) (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) .cse0) 0)) (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|))) (not (= 0 |cstrncpy_#in~s1.offset|)) (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|) (< .cse1 1) (< |cstrncpy_#in~n| .cse2) (< .cse2 |cstrncpy_#in~n|) (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) .cse0)) (not (= 0 |cstrncpy_#in~s2.offset|)) (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|))) (< .cse2 1)))) [2018-01-29 22:40:06,101 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 22:40:06,101 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L552'''(line 552) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point cstrncpyFINAL(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L548''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L548'''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L551'''''(line 551) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr3RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,102 INFO L399 ceAbstractionStarter]: For program point L551'''(line 551) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point L548''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L395 ceAbstractionStarter]: At program point L551''''''(lines 551 552) the Hoare annotation is: (let ((.cse22 (+ cstrncpy_~n 1)) (.cse5 (select |#length| cstrncpy_~dst~2.base)) (.cse4 (+ cstrncpy_~dst~2.offset cstrncpy_~n)) (.cse24 (select |#length| cstrncpy_~s1.base)) (.cse25 (+ cstrncpy_~us~2.offset cstrncpy_~n2~2)) (.cse19 (select |#length| cstrncpy_~us~2.base))) (let ((.cse0 (select |#length| |cstrncpy_#in~s2.base|)) (.cse11 (<= 0 cstrncpy_~n)) (.cse23 (select |#length| |cstrncpy_#in~s1.base|)) (.cse6 (= 0 cstrncpy_~s1.offset)) (.cse1 (<= .cse25 .cse19)) (.cse2 (<= 0 cstrncpy_~n2~2)) (.cse9 (<= 1 (select |#length| cstrncpy_~s2.base))) (.cse10 (= 1 (select |#valid| cstrncpy_~s2.base))) (.cse12 (= 1 (select |#valid| cstrncpy_~src~2.base))) (.cse7 (<= |cstrncpy_#in~n| .cse24)) (.cse8 (<= .cse24 |cstrncpy_#in~n|)) (.cse20 (<= cstrncpy_~dst~2.offset 1)) (.cse3 (<= .cse5 .cse4)) (.cse13 (= 1 (select |#valid| cstrncpy_~us~2.base))) (.cse14 (= 1 (select |#valid| cstrncpy_~s1.base))) (.cse15 (= 0 cstrncpy_~s2.offset)) (.cse21 (<= .cse22 .cse5)) (.cse16 (= 1 (select |#valid| cstrncpy_~dst~2.base))) (.cse17 (<= .cse19 .cse25)) (.cse18 (<= cstrncpy_~n .cse24))) (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ .cse0 (- 1))) 0)) (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|))) (not (= 0 |cstrncpy_#in~s1.offset|)) (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|) (and .cse1 .cse2 .cse3 (<= 1 cstrncpy_~us~2.offset) (<= .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= 2 cstrncpy_~dst~2.offset) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18) (< .cse0 1) (and .cse6 .cse9 (<= (+ cstrncpy_~n2~2 1) .cse19) .cse10 .cse12 (<= .cse19 (+ cstrncpy_~us~2.offset cstrncpy_~n)) .cse7 .cse8 .cse20 .cse3 .cse11 .cse13 .cse14 (<= cstrncpy_~us~2.offset 1) .cse15 .cse21 (<= .cse22 .cse19) .cse16 .cse17 .cse18) (< |cstrncpy_#in~n| .cse23) (< .cse23 |cstrncpy_#in~n|) (not (= 0 |cstrncpy_#in~s2.offset|)) (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|))) (< .cse23 1) (and .cse6 .cse1 .cse2 .cse9 (< 0 .cse22) .cse10 .cse12 .cse7 .cse8 .cse20 .cse3 (<= 2 cstrncpy_~us~2.offset) .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18)))) [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr5RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point L551''(lines 551 552) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point L548''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,103 INFO L399 ceAbstractionStarter]: For program point L548'''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point L548'''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr2RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 552) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point cstrncpyEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L399 ceAbstractionStarter]: For program point L548''''''''''''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,104 INFO L395 ceAbstractionStarter]: At program point L546''(lines 546 555) the Hoare annotation is: (let ((.cse1 (select |#length| |cstrncpy_#in~s2.base|)) (.cse15 (select |#length| cstrncpy_~src~2.base)) (.cse20 (select |#length| cstrncpy_~dst~2.base)) (.cse24 (+ cstrncpy_~dst~2.offset cstrncpy_~n)) (.cse26 (select |#length| cstrncpy_~s2.base)) (.cse25 (select |#length| cstrncpy_~s1.base))) (let ((.cse23 (select |#length| |cstrncpy_#in~s1.base|)) (.cse3 (not (= cstrncpy_~dst~2.base cstrncpy_~src~2.base))) (.cse13 (<= |cstrncpy_#in~n| .cse25)) (.cse14 (<= .cse25 |cstrncpy_#in~n|)) (.cse6 (<= 1 .cse26)) (.cse16 (<= .cse20 .cse24)) (.cse5 (= 0 (select (select |#memory_int| cstrncpy_~s2.base) (+ .cse26 (- 1))))) (.cse17 (<= (+ cstrncpy_~src~2.offset 1) .cse15)) (.cse9 (<= 1 cstrncpy_~src~2.offset)) (.cse2 (= 0 cstrncpy_~s1.offset)) (.cse4 (not (= cstrncpy_~s1.base cstrncpy_~s2.base))) (.cse8 (= 1 (select |#valid| cstrncpy_~s2.base))) (.cse10 (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (<= main_~nondetString~5.offset 0) (= 0 (select (select |#memory_int| cstrncpy_~src~2.base) (+ main_~nondetString~5.offset (select |#length| cstrncpy_~src~2.base) (- 1))))))) (.cse11 (not (= cstrncpy_~dst~2.base cstrncpy_~s2.base))) (.cse12 (= 1 (select |#valid| cstrncpy_~src~2.base))) (.cse18 (= 1 (select |#valid| cstrncpy_~s1.base))) (.cse0 (+ .cse1 (- 1))) (.cse19 (= 0 cstrncpy_~s2.offset)) (.cse21 (= 1 (select |#valid| cstrncpy_~dst~2.base))) (.cse22 (<= cstrncpy_~n .cse25))) (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) .cse0) 0)) (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|))) (not (= 0 |cstrncpy_#in~s1.offset|)) (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|) (< .cse1 1) (let ((.cse7 (+ cstrncpy_~n 1))) (and .cse2 .cse3 .cse4 .cse5 .cse6 (< 0 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= cstrncpy_~dst~2.offset 1) (or (<= cstrncpy_~src~2.offset 1) (<= (+ cstrncpy_~src~2.offset 2) .cse15)) .cse16 .cse17 .cse18 .cse19 (<= .cse7 .cse20) .cse21 .cse22)) (< |cstrncpy_#in~n| .cse23) (< .cse23 |cstrncpy_#in~n|) (not (= 0 |cstrncpy_#in~s2.offset|)) (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|))) (< .cse23 1) (and .cse3 .cse4 (and .cse2 .cse13 .cse14 (<= 2 cstrncpy_~dst~2.offset) .cse6 .cse16 .cse8 (<= 0 cstrncpy_~n) .cse12 .cse18 .cse19 .cse21) .cse5 .cse17 (= 0 (select (select |#memory_int| cstrncpy_~src~2.base) (+ .cse15 (- 1)))) .cse9 (<= .cse24 .cse20) .cse11 .cse22) (and .cse2 .cse4 .cse8 (= 0 cstrncpy_~dst~2.offset) .cse10 (not (= |cstrncpy_#in~s2.base| cstrncpy_~s1.base)) .cse11 .cse12 (<= .cse20 cstrncpy_~n) (not (= cstrncpy_~src~2.base cstrncpy_~dst~2.base)) (exists ((main_~length~5 Int) (v_main_~nondetString~5.offset_BEFORE_CALL_1 Int)) (and (<= (+ main_~length~5 v_main_~nondetString~5.offset_BEFORE_CALL_1) (select |#length| cstrncpy_~s2.base)) (= (select (select |#memory_int| cstrncpy_~s2.base) (+ main_~length~5 v_main_~nondetString~5.offset_BEFORE_CALL_1 (- 1))) 0) (<= 1 main_~length~5) (<= cstrncpy_~s2.offset v_main_~nondetString~5.offset_BEFORE_CALL_1))) (= 0 cstrncpy_~src~2.offset) (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= (select (select |#memory_int| cstrncpy_~s2.base) (+ (select |#length| cstrncpy_~s2.base) main_~nondetString~5.offset (- 1))) 0) (<= main_~nondetString~5.offset 0))) (<= cstrncpy_~n .cse20) (<= .cse25 cstrncpy_~n) .cse18 (= cstrncpy_~n |cstrncpy_#in~n|) (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) .cse0)) .cse19 .cse21 (<= 1 .cse15) .cse22)))) [2018-01-29 22:40:06,105 INFO L399 ceAbstractionStarter]: For program point L546'''(lines 546 555) no Hoare annotation was computed. [2018-01-29 22:40:06,105 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-29 22:40:06,105 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr4RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,105 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,105 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,105 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:40:06,105 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,105 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 572) the Hoare annotation is: true [2018-01-29 22:40:06,105 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,105 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 572) the Hoare annotation is: true [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 558 572) no Hoare annotation was computed. [2018-01-29 22:40:06,106 INFO L399 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point L568'''(line 568) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point L564'(lines 564 566) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 558 572) no Hoare annotation was computed. [2018-01-29 22:40:06,107 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-29 22:40:06,108 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 558 572) no Hoare annotation was computed. [2018-01-29 22:40:06,108 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 558 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:40:06,108 INFO L399 ceAbstractionStarter]: For program point L561''(lines 561 563) no Hoare annotation was computed. [2018-01-29 22:40:06,108 INFO L399 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-29 22:40:06,108 INFO L399 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-29 22:40:06,108 INFO L395 ceAbstractionStarter]: At program point L569'(line 569) the Hoare annotation is: (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= main_~n~5 (select |#length| |main_#t~malloc10.base|)) (<= 1 main_~n~5) (= (select |#length| main_~nondetArea~5.base) main_~n~5) (= 0 main_~nondetArea~5.offset) (= 0 |main_#t~malloc10.offset|) (= 0 |main_#t~malloc11.offset|) (= main_~nondetString~5.offset 0) (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= main_~length~5 (select |#length| |main_#t~malloc11.base|)) (= 1 (select |#valid| |main_#t~malloc11.base|)) (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= (select (select |#memory_int| main_~nondetString~5.base) (+ main_~nondetString~5.offset (select |#length| main_~nondetString~5.base) (- 1))) 0) (<= main_~nondetString~5.offset 0))) (not (= main_~nondetArea~5.base |main_#t~malloc11.base|)) (= 1 (select |#valid| main_~nondetArea~5.base)) (= main_~length~5 (select |#length| main_~nondetString~5.base)) (= 1 (select |#valid| main_~nondetString~5.base)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0)) (not (= main_~nondetArea~5.base main_~nondetString~5.base)) (exists ((main_~length~5 Int)) (and (= (select (select |#memory_int| main_~nondetString~5.base) (+ main_~nondetString~5.offset main_~length~5 (- 1))) 0) (<= (+ main_~nondetString~5.offset main_~length~5) (select |#length| main_~nondetString~5.base)) (<= 1 main_~length~5)))) [2018-01-29 22:40:06,108 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-29 22:40:06,109 INFO L399 ceAbstractionStarter]: For program point L567''(line 567) no Hoare annotation was computed. [2018-01-29 22:40:06,109 INFO L399 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-29 22:40:06,121 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,125 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,127 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,128 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,132 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,133 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,134 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,135 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,136 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,137 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,138 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,139 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,140 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,141 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,142 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,152 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,153 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,154 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,155 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,156 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,157 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,158 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,158 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,158 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,159 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,160 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,161 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,162 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,163 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,164 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,165 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,166 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,167 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,168 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,174 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,175 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,176 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,177 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,178 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,179 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,180 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,181 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,187 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,188 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,189 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,195 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:40:06 BoogieIcfgContainer [2018-01-29 22:40:06,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:40:06,198 INFO L168 Benchmark]: Toolchain (without parser) took 33757.52 ms. Allocated memory was 307.8 MB in the beginning and 697.8 MB in the end (delta: 390.1 MB). Free memory was 267.8 MB in the beginning and 485.5 MB in the end (delta: -217.7 MB). Peak memory consumption was 336.5 MB. Max. memory is 5.3 GB. [2018-01-29 22:40:06,200 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:40:06,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.73 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.5 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:40:06,200 INFO L168 Benchmark]: Boogie Preprocessor took 38.63 ms. Allocated memory is still 307.8 MB. Free memory was 256.5 MB in the beginning and 254.6 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:40:06,201 INFO L168 Benchmark]: RCFGBuilder took 313.71 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 234.0 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:40:06,201 INFO L168 Benchmark]: TraceAbstraction took 33184.06 ms. Allocated memory was 307.8 MB in the beginning and 697.8 MB in the end (delta: 390.1 MB). Free memory was 234.0 MB in the beginning and 485.5 MB in the end (delta: -251.5 MB). Peak memory consumption was 302.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:40:06,202 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.19 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.73 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.63 ms. Allocated memory is still 307.8 MB. Free memory was 256.5 MB in the beginning and 254.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 313.71 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 234.0 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33184.06 ms. Allocated memory was 307.8 MB in the beginning and 697.8 MB in the end (delta: 390.1 MB). Free memory was 234.0 MB in the beginning and 485.5 MB in the end (delta: -251.5 MB). Peak memory consumption was 302.7 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[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 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: 558]: 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 9 specifications checked. All of them hold - InvariantResult [Line: 546]: Loop Invariant [2018-01-29 22:40:06,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,210 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,211 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,212 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,213 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,214 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,215 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,215 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,220 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,227 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,228 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,228 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,229 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,229 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,229 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,230 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,230 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,230 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,230 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,231 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-29 22:40:06,231 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:40:06,231 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,231 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,232 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-29 22:40:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,233 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,234 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((!(\old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + -1] == 0) || !(1 == \valid[s2])) || !(0 == s1)) || s1 == s2) || unknown-#length-unknown[s2] < 1) || (((((((((((((((((((((0 == s1 && !(dst == src)) && !(s1 == s2)) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 1 <= unknown-#length-unknown[s2]) && 0 < n + 1) && 1 == \valid[s2]) && 1 <= src) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && main_~nondetString~5.offset <= 0) && 0 == unknown-#memory_int-unknown[src][main_~nondetString~5.offset + unknown-#length-unknown[src] + -1])) && !(dst == s2)) && 1 == \valid[src]) && \old(n) <= unknown-#length-unknown[s1]) && unknown-#length-unknown[s1] <= \old(n)) && dst <= 1) && (src <= 1 || src + 2 <= unknown-#length-unknown[src])) && unknown-#length-unknown[dst] <= dst + n) && src + 1 <= unknown-#length-unknown[src]) && 1 == \valid[s1]) && 0 == s2) && n + 1 <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && n <= unknown-#length-unknown[s1])) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) || (((((((((!(dst == src) && !(s1 == s2)) && ((((((((((0 == s1 && \old(n) <= unknown-#length-unknown[s1]) && unknown-#length-unknown[s1] <= \old(n)) && 2 <= dst) && 1 <= unknown-#length-unknown[s2]) && unknown-#length-unknown[dst] <= dst + n) && 1 == \valid[s2]) && 0 <= n) && 1 == \valid[src]) && 1 == \valid[s1]) && 0 == s2) && 1 == \valid[dst]) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && src + 1 <= unknown-#length-unknown[src]) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 1 <= src) && dst + n <= unknown-#length-unknown[dst]) && !(dst == s2)) && n <= unknown-#length-unknown[s1])) || (((((((((((((((((((((0 == s1 && !(s1 == s2)) && 1 == \valid[s2]) && 0 == dst) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && main_~nondetString~5.offset <= 0) && 0 == unknown-#memory_int-unknown[src][main_~nondetString~5.offset + unknown-#length-unknown[src] + -1])) && !(s2 == s1)) && !(dst == s2)) && 1 == \valid[src]) && unknown-#length-unknown[dst] <= n) && !(src == dst)) && (\exists main_~length~5 : int, v_main_~nondetString~5.offset_BEFORE_CALL_1 : int :: ((main_~length~5 + v_main_~nondetString~5.offset_BEFORE_CALL_1 <= unknown-#length-unknown[s2] && unknown-#memory_int-unknown[s2][main_~length~5 + v_main_~nondetString~5.offset_BEFORE_CALL_1 + -1] == 0) && 1 <= main_~length~5) && s2 <= v_main_~nondetString~5.offset_BEFORE_CALL_1)) && 0 == src) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1] == 0) && main_~nondetString~5.offset <= 0)) && n <= unknown-#length-unknown[dst]) && unknown-#length-unknown[s1] <= n) && 1 == \valid[s1]) && n == \old(n)) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && 0 == s2) && 1 == \valid[dst]) && 1 <= unknown-#length-unknown[src]) && n <= unknown-#length-unknown[s1]) - InvariantResult [Line: 551]: Loop Invariant [2018-01-29 22:40:06,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,244 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,245 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,246 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:40:06,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,258 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:40:06,259 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((!(\old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + -1] == 0) || !(1 == \valid[s2])) || !(0 == s1)) || s1 == s2) || (((((((us + n2 <= unknown-#length-unknown[us] && 0 <= n2) && unknown-#length-unknown[dst] <= dst + n) && 1 <= us) && dst + n <= unknown-#length-unknown[dst]) && ((((((((((0 == s1 && \old(n) <= unknown-#length-unknown[s1]) && unknown-#length-unknown[s1] <= \old(n)) && 2 <= dst) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s2]) && 0 <= n) && 1 == \valid[src]) && 1 == \valid[us]) && 1 == \valid[s1]) && 0 == s2) && 1 == \valid[dst]) && unknown-#length-unknown[us] <= us + n2) && n <= unknown-#length-unknown[s1])) || unknown-#length-unknown[s2] < 1) || (((((((((((((((((((0 == s1 && 1 <= unknown-#length-unknown[s2]) && n2 + 1 <= unknown-#length-unknown[us]) && 1 == \valid[s2]) && 1 == \valid[src]) && unknown-#length-unknown[us] <= us + n) && \old(n) <= unknown-#length-unknown[s1]) && unknown-#length-unknown[s1] <= \old(n)) && dst <= 1) && unknown-#length-unknown[dst] <= dst + n) && 0 <= n) && 1 == \valid[us]) && 1 == \valid[s1]) && us <= 1) && 0 == s2) && n + 1 <= unknown-#length-unknown[dst]) && n + 1 <= unknown-#length-unknown[us]) && 1 == \valid[dst]) && unknown-#length-unknown[us] <= us + n2) && n <= unknown-#length-unknown[s1])) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) || ((((((((((((((((((0 == s1 && us + n2 <= unknown-#length-unknown[us]) && 0 <= n2) && 1 <= unknown-#length-unknown[s2]) && 0 < n + 1) && 1 == \valid[s2]) && 1 == \valid[src]) && \old(n) <= unknown-#length-unknown[s1]) && unknown-#length-unknown[s1] <= \old(n)) && dst <= 1) && unknown-#length-unknown[dst] <= dst + n) && 2 <= us) && 1 == \valid[us]) && 1 == \valid[s1]) && 0 == s2) && n + 1 <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && unknown-#length-unknown[us] <= us + n2) && n <= unknown-#length-unknown[s1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 9 error locations. SAFE Result, 33.0s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 19.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1127 SDtfs, 3689 SDslu, 12524 SDs, 0 SdLazy, 8250 SolverSat, 519 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1051 GetRequests, 389 SyntacticMatches, 18 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7942 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 143 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 18 NumberOfFragments, 1006 HoareAnnotationTreeSize, 8 FomulaSimplifications, 9501 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3618 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1411 ConstructedInterpolants, 52 QuantifiedInterpolants, 935236 SizeOfPredicates, 207 NumberOfNonLiveVariables, 1559 ConjunctsInSsa, 422 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 43/418 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/cstrncpy-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-40-06-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-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-40-06-264.csv Received shutdown request...