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-acfac67 [2018-01-28 21:04:12,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:04:12,317 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:04:12,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:04:12,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:04:12,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:04:12,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:04:12,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:04:12,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:04:12,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:04:12,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:04:12,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:04:12,341 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:04:12,342 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:04:12,343 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:04:12,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:04:12,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:04:12,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:04:12,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:04:12,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:04:12,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:04:12,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:04:12,355 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:04:12,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:04:12,357 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:04:12,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:04:12,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:04:12,359 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:04:12,359 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:04:12,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:04:12,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:04:12,360 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-28 21:04:12,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:04:12,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:04:12,370 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:04:12,370 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:04:12,370 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:04:12,371 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:04:12,371 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:04:12,371 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:04:12,371 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:04:12,371 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:04:12,371 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:04:12,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:04:12,372 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:04:12,372 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:04:12,372 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:04:12,372 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:04:12,372 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:04:12,372 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:04:12,373 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:04:12,373 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:04:12,373 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:04:12,373 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:04:12,373 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:04:12,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:04:12,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:04:12,374 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:04:12,374 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:04:12,374 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:04:12,374 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:04:12,374 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:04:12,374 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:04:12,375 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:04:12,375 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:04:12,375 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:04:12,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:04:12,418 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:04:12,421 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:04:12,423 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:04:12,423 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:04:12,424 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-28 21:04:12,614 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:04:12,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:04:12,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:04:12,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:04:12,626 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:04:12,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fea89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12, skipping insertion in model container [2018-01-28 21:04:12,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,645 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:04:12,683 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:04:12,802 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:04:12,819 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:04:12,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12 WrapperNode [2018-01-28 21:04:12,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:04:12,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:04:12,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:04:12,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:04:12,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (1/1) ... [2018-01-28 21:04:12,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:04:12,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:04:12,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:04:12,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:04:12,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (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-28 21:04:12,913 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:04:12,913 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:04:12,913 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-28 21:04:12,913 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:04:12,913 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:04:12,913 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:04:12,913 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:04:12,913 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:04:12,914 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:04:12,914 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:04:12,914 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-28 21:04:12,914 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:04:12,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:04:12,914 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:04:13,194 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:04:13,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:04:13 BoogieIcfgContainer [2018-01-28 21:04:13,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:04:13,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:04:13,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:04:13,198 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:04:13,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:04:12" (1/3) ... [2018-01-28 21:04:13,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcddf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:04:13, skipping insertion in model container [2018-01-28 21:04:13,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:12" (2/3) ... [2018-01-28 21:04:13,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bcddf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:04:13, skipping insertion in model container [2018-01-28 21:04:13,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:04:13" (3/3) ... [2018-01-28 21:04:13,201 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:04:13,207 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:04:13,213 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-28 21:04:13,259 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:04:13,260 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:04:13,260 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:04:13,260 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:04:13,260 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:04:13,260 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:04:13,260 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:04:13,261 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:04:13,262 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:04:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-28 21:04:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:04:13,289 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:13,290 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:04:13,290 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 379542241, now seen corresponding path program 1 times [2018-01-28 21:04:13,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:13,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:13,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:13,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:13,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:13,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:13,513 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-28 21:04:13,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:13,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:04:13,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:04:13,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:04:13,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:04:13,537 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 4 states. [2018-01-28 21:04:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:13,741 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-28 21:04:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:04:13,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:04:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:13,755 INFO L225 Difference]: With dead ends: 95 [2018-01-28 21:04:13,755 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 21:04:13,759 INFO L533 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-28 21:04:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 21:04:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-28 21:04:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 21:04:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-28 21:04:13,792 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 19 [2018-01-28 21:04:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:13,792 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-28 21:04:13,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:04:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-28 21:04:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:04:13,793 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:13,793 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:04:13,793 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:13,793 INFO L82 PathProgramCache]: Analyzing trace with hash 379542242, now seen corresponding path program 1 times [2018-01-28 21:04:13,793 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:13,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:13,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:13,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:13,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:13,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:13,916 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-28 21:04:13,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:13,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:04:13,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:04:13,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:04:13,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:04:13,919 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 5 states. [2018-01-28 21:04:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:13,980 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-28 21:04:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:04:13,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-28 21:04:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:13,982 INFO L225 Difference]: With dead ends: 77 [2018-01-28 21:04:13,983 INFO L226 Difference]: Without dead ends: 76 [2018-01-28 21:04:13,984 INFO L533 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-28 21:04:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-28 21:04:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-28 21:04:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-28 21:04:13,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-28 21:04:13,993 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 19 [2018-01-28 21:04:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:13,994 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-28 21:04:13,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:04:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-28 21:04:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:04:13,996 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:13,996 INFO L330 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-28 21:04:13,996 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:13,996 INFO L82 PathProgramCache]: Analyzing trace with hash 647666553, now seen corresponding path program 1 times [2018-01-28 21:04:13,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:13,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:13,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:13,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:13,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:14,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:14,143 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-28 21:04:14,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:14,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:04:14,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:04:14,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:04:14,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:04:14,144 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 7 states. [2018-01-28 21:04:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:14,293 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-01-28 21:04:14,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:04:14,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-28 21:04:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:14,295 INFO L225 Difference]: With dead ends: 76 [2018-01-28 21:04:14,295 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 21:04:14,296 INFO L533 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-28 21:04:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 21:04:14,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-28 21:04:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 21:04:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-28 21:04:14,304 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 37 [2018-01-28 21:04:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:14,304 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-28 21:04:14,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:04:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-28 21:04:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:04:14,306 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:14,306 INFO L330 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-28 21:04:14,306 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash 647666554, now seen corresponding path program 1 times [2018-01-28 21:04:14,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:14,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:14,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:14,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:14,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:14,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:14,505 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-28 21:04:14,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:14,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:04:14,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:04:14,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:04:14,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:04:14,507 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 10 states. [2018-01-28 21:04:14,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:14,695 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-28 21:04:14,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:04:14,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-28 21:04:14,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:14,699 INFO L225 Difference]: With dead ends: 97 [2018-01-28 21:04:14,700 INFO L226 Difference]: Without dead ends: 96 [2018-01-28 21:04:14,700 INFO L533 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-28 21:04:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-28 21:04:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2018-01-28 21:04:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:04:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-28 21:04:14,709 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 37 [2018-01-28 21:04:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:14,710 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-28 21:04:14,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:04:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-28 21:04:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:04:14,711 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:14,711 INFO L330 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-28 21:04:14,711 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1397173340, now seen corresponding path program 1 times [2018-01-28 21:04:14,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:14,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:14,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:14,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:14,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:14,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:14,877 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-28 21:04:14,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:14,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:04:14,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:04:14,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:04:14,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:04:14,878 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 10 states. [2018-01-28 21:04:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:15,083 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-01-28 21:04:15,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:04:15,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-28 21:04:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:15,085 INFO L225 Difference]: With dead ends: 85 [2018-01-28 21:04:15,085 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 21:04:15,085 INFO L533 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-28 21:04:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 21:04:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-28 21:04:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:04:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-28 21:04:15,091 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2018-01-28 21:04:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:15,091 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-28 21:04:15,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:04:15,092 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-28 21:04:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:04:15,093 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:15,093 INFO L330 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-28 21:04:15,093 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1397173339, now seen corresponding path program 1 times [2018-01-28 21:04:15,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:15,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:15,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:15,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:15,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:15,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:15,308 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-28 21:04:15,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:15,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:04:15,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:04:15,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:04:15,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:04:15,310 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 10 states. [2018-01-28 21:04:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:15,479 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-28 21:04:15,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:04:15,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-28 21:04:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:15,481 INFO L225 Difference]: With dead ends: 92 [2018-01-28 21:04:15,481 INFO L226 Difference]: Without dead ends: 91 [2018-01-28 21:04:15,481 INFO L533 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-28 21:04:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-28 21:04:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2018-01-28 21:04:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:04:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-28 21:04:15,490 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 38 [2018-01-28 21:04:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:15,490 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-28 21:04:15,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:04:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-28 21:04:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:04:15,492 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:15,492 INFO L330 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-28 21:04:15,492 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash -808357814, now seen corresponding path program 1 times [2018-01-28 21:04:15,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:15,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:15,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:15,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:15,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:15,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:15,561 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-28 21:04:15,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:15,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:04:15,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:04:15,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:04:15,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:04:15,562 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 5 states. [2018-01-28 21:04:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:15,589 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-01-28 21:04:15,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:04:15,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-28 21:04:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:15,591 INFO L225 Difference]: With dead ends: 96 [2018-01-28 21:04:15,591 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:04:15,591 INFO L533 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-28 21:04:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:04:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-28 21:04:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:04:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-28 21:04:15,600 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 39 [2018-01-28 21:04:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:15,601 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-28 21:04:15,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:04:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-28 21:04:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-28 21:04:15,602 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:15,602 INFO L330 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-28 21:04:15,603 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash 291212881, now seen corresponding path program 1 times [2018-01-28 21:04:15,603 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:15,603 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:15,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:15,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:15,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:15,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:15,687 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-28 21:04:15,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:15,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:04:15,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:04:15,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:04:15,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:04:15,689 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 6 states. [2018-01-28 21:04:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:15,812 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-01-28 21:04:15,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:04:15,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-01-28 21:04:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:15,814 INFO L225 Difference]: With dead ends: 88 [2018-01-28 21:04:15,814 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 21:04:15,815 INFO L533 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-28 21:04:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 21:04:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-28 21:04:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:04:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-28 21:04:15,822 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 52 [2018-01-28 21:04:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:15,823 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-28 21:04:15,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:04:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-28 21:04:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-28 21:04:15,824 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:15,825 INFO L330 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-28 21:04:15,825 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash 291212882, now seen corresponding path program 1 times [2018-01-28 21:04:15,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:15,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:15,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:15,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:15,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:15,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:16,232 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-28 21:04:16,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:16,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-01-28 21:04:16,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 21:04:16,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 21:04:16,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:04:16,233 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 19 states. [2018-01-28 21:04:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:17,191 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-28 21:04:17,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 21:04:17,192 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-01-28 21:04:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:17,192 INFO L225 Difference]: With dead ends: 125 [2018-01-28 21:04:17,193 INFO L226 Difference]: Without dead ends: 124 [2018-01-28 21:04:17,193 INFO L533 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-28 21:04:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-28 21:04:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2018-01-28 21:04:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 21:04:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-28 21:04:17,200 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 52 [2018-01-28 21:04:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:17,200 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-28 21:04:17,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 21:04:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-28 21:04:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-28 21:04:17,202 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:17,202 INFO L330 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-28 21:04:17,202 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash -917917903, now seen corresponding path program 1 times [2018-01-28 21:04:17,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:17,203 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:17,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:17,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:17,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:17,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:17,416 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-28 21:04:17,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:17,417 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-28 21:04:17,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:17,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:17,526 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-28 21:04:17,528 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-28 21:04:17,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:17,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:17,535 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-28 21:04:17,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:04:17,850 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-28 21:04:17,856 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-28 21:04:17,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:04:17,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:04:17,871 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-28 21:04:17,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-28 21:04:17,920 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-28 21:04:17,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:17,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-28 21:04:17,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 21:04:17,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 21:04:17,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-28 21:04:17,942 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 21 states. [2018-01-28 21:04:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:19,460 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-28 21:04:19,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:04:19,460 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-01-28 21:04:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:19,461 INFO L225 Difference]: With dead ends: 122 [2018-01-28 21:04:19,461 INFO L226 Difference]: Without dead ends: 121 [2018-01-28 21:04:19,461 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:04:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-28 21:04:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-01-28 21:04:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-28 21:04:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-01-28 21:04:19,470 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 52 [2018-01-28 21:04:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:19,470 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-01-28 21:04:19,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 21:04:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-01-28 21:04:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:04:19,471 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:19,471 INFO L330 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-28 21:04:19,471 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1609316046, now seen corresponding path program 1 times [2018-01-28 21:04:19,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:19,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:19,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:19,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:19,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:19,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:19,787 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-28 21:04:19,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:19,788 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-28 21:04:19,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:19,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:19,832 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-28 21:04:19,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:19,838 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-28 21:04:19,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:19,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:19,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:04:19,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:19,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:19,881 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-28 21:04:19,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:19,887 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-28 21:04:19,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:19,892 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-28 21:04:19,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:04:20,191 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-28 21:04:20,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:20,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2018-01-28 21:04:20,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 21:04:20,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 21:04:20,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2018-01-28 21:04:20,213 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 31 states. [2018-01-28 21:04:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:20,819 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-01-28 21:04:20,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:04:20,837 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-01-28 21:04:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:20,837 INFO L225 Difference]: With dead ends: 130 [2018-01-28 21:04:20,837 INFO L226 Difference]: Without dead ends: 129 [2018-01-28 21:04:20,838 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=1908, Unknown=0, NotChecked=0, Total=2162 [2018-01-28 21:04:20,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-28 21:04:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2018-01-28 21:04:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 21:04:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2018-01-28 21:04:20,844 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 53 [2018-01-28 21:04:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:20,844 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2018-01-28 21:04:20,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 21:04:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2018-01-28 21:04:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 21:04:20,845 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:20,845 INFO L330 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-28 21:04:20,845 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:20,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2096467391, now seen corresponding path program 1 times [2018-01-28 21:04:20,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:20,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:20,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:20,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:20,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:20,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:20,975 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-28 21:04:20,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:20,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:04:20,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:04:20,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:04:20,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:04:20,976 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 6 states. [2018-01-28 21:04:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:21,099 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-01-28 21:04:21,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:04:21,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-28 21:04:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:21,100 INFO L225 Difference]: With dead ends: 112 [2018-01-28 21:04:21,100 INFO L226 Difference]: Without dead ends: 100 [2018-01-28 21:04:21,100 INFO L533 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-28 21:04:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-28 21:04:21,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-28 21:04:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-28 21:04:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-01-28 21:04:21,107 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 54 [2018-01-28 21:04:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:21,107 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-01-28 21:04:21,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:04:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-01-28 21:04:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 21:04:21,109 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:21,109 INFO L330 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-28 21:04:21,109 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash 798896597, now seen corresponding path program 1 times [2018-01-28 21:04:21,109 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:21,110 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:21,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:21,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:21,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:21,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:21,620 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-28 21:04:21,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:21,620 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-28 21:04:21,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:21,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:21,652 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-28 21:04:21,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:21,657 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-28 21:04:21,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:21,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:21,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:04:21,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:21,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:21,709 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-28 21:04:21,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:21,715 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-28 21:04:21,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:21,719 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-28 21:04:21,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:04:22,409 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-28 21:04:22,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:22,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2018-01-28 21:04:22,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-28 21:04:22,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-28 21:04:22,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=2142, Unknown=0, NotChecked=0, Total=2256 [2018-01-28 21:04:22,431 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 48 states. [2018-01-28 21:04:23,577 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 54 DAG size of output 45 [2018-01-28 21:04:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:25,541 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-28 21:04:25,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-28 21:04:25,542 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 61 [2018-01-28 21:04:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:25,542 INFO L225 Difference]: With dead ends: 120 [2018-01-28 21:04:25,542 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 21:04:25,544 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=642, Invalid=6000, Unknown=0, NotChecked=0, Total=6642 [2018-01-28 21:04:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 21:04:25,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-28 21:04:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-28 21:04:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-01-28 21:04:25,550 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 61 [2018-01-28 21:04:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:25,551 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-01-28 21:04:25,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-28 21:04:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-01-28 21:04:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 21:04:25,552 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:25,552 INFO L330 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-28 21:04:25,552 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash -309742149, now seen corresponding path program 1 times [2018-01-28 21:04:25,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:25,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:25,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:25,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:25,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:25,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:26,025 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-28 21:04:26,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:26,110 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-28 21:04:26,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:26,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:26,144 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-28 21:04:26,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:26,151 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-28 21:04:26,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:26,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:26,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:04:26,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:26,234 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-28 21:04:26,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:26,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:26,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:26,245 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-28 21:04:26,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:26,250 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-28 21:04:26,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:04:26,854 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-28 21:04:26,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:26,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2018-01-28 21:04:26,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-28 21:04:26,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-28 21:04:26,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2045, Unknown=0, NotChecked=0, Total=2162 [2018-01-28 21:04:26,874 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 47 states. [2018-01-28 21:04:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:29,653 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-01-28 21:04:29,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-28 21:04:29,653 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 67 [2018-01-28 21:04:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:29,654 INFO L225 Difference]: With dead ends: 129 [2018-01-28 21:04:29,654 INFO L226 Difference]: Without dead ends: 128 [2018-01-28 21:04:29,655 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=722, Invalid=7110, Unknown=0, NotChecked=0, Total=7832 [2018-01-28 21:04:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-28 21:04:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2018-01-28 21:04:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-28 21:04:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-01-28 21:04:29,661 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 67 [2018-01-28 21:04:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:29,661 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-01-28 21:04:29,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-28 21:04:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-01-28 21:04:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-28 21:04:29,662 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:29,662 INFO L330 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-28 21:04:29,662 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1518872934, now seen corresponding path program 2 times [2018-01-28 21:04:29,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:29,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:29,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:29,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:29,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:29,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:30,220 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-28 21:04:30,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:30,220 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-28 21:04:30,225 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:04:30,238 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:04:30,245 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:04:30,247 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:04:30,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:30,254 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-28 21:04:30,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:04:30,266 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-28 21:04:30,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:30,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:30,274 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-28 21:04:30,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:04:30,331 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-28 21:04:30,333 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-28 21:04:30,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,340 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-28 21:04:30,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:04:30,760 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-28 21:04:30,763 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-28 21:04:30,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:30,774 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-28 21:04:30,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-28 21:04:30,919 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-28 21:04:30,925 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-28 21:04:30,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:04:30,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:04:30,935 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-28 21:04:30,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-28 21:04:31,005 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-28 21:04:31,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:31,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-01-28 21:04:31,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-28 21:04:31,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-28 21:04:31,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 21:04:31,025 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 38 states. [2018-01-28 21:04:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:33,006 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-28 21:04:33,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-28 21:04:33,006 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 67 [2018-01-28 21:04:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:33,007 INFO L225 Difference]: With dead ends: 120 [2018-01-28 21:04:33,007 INFO L226 Difference]: Without dead ends: 119 [2018-01-28 21:04:33,008 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=311, Invalid=3229, Unknown=0, NotChecked=0, Total=3540 [2018-01-28 21:04:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-28 21:04:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-01-28 21:04:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-28 21:04:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-01-28 21:04:33,017 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 67 [2018-01-28 21:04:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:33,017 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-01-28 21:04:33,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-28 21:04:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-01-28 21:04:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 21:04:33,017 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:33,018 INFO L330 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-28 21:04:33,018 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash 159579269, now seen corresponding path program 2 times [2018-01-28 21:04:33,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:33,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:33,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:33,019 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:04:33,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:33,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:33,742 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-28 21:04:33,743 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:33,743 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-28 21:04:33,752 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:04:33,768 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:04:33,778 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:04:33,782 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:04:33,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:33,794 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-28 21:04:33,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:33,800 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-28 21:04:33,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:33,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:33,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:04:33,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:33,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:33,865 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-28 21:04:33,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:33,873 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-28 21:04:33,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:33,878 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-28 21:04:33,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:04:34,241 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-28 21:04:34,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:34,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-01-28 21:04:34,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-28 21:04:34,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-28 21:04:34,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 21:04:34,264 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 40 states. [2018-01-28 21:04:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:35,547 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-01-28 21:04:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-28 21:04:35,547 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 68 [2018-01-28 21:04:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:35,548 INFO L225 Difference]: With dead ends: 136 [2018-01-28 21:04:35,548 INFO L226 Difference]: Without dead ends: 135 [2018-01-28 21:04:35,549 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=522, Invalid=4308, Unknown=0, NotChecked=0, Total=4830 [2018-01-28 21:04:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-28 21:04:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 108. [2018-01-28 21:04:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-28 21:04:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-01-28 21:04:35,556 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 68 [2018-01-28 21:04:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:35,556 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-01-28 21:04:35,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-28 21:04:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-01-28 21:04:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-28 21:04:35,557 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:35,557 INFO L330 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-28 21:04:35,557 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:35,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1987358580, now seen corresponding path program 1 times [2018-01-28 21:04:35,557 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:35,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:35,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:35,558 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:04:35,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:35,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:36,171 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-28 21:04:36,171 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:36,237 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-28 21:04:36,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:36,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:36,272 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-28 21:04:36,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:36,277 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-28 21:04:36,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:36,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:36,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:04:36,332 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:36,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:36,334 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-28 21:04:36,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:36,340 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-28 21:04:36,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:36,344 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-28 21:04:36,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:04:37,212 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-28 21:04:37,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:37,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 55 [2018-01-28 21:04:37,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-28 21:04:37,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-28 21:04:37,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2934, Unknown=0, NotChecked=0, Total=3080 [2018-01-28 21:04:37,235 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 56 states. [2018-01-28 21:04:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:42,356 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2018-01-28 21:04:42,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-28 21:04:42,356 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 76 [2018-01-28 21:04:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:42,357 INFO L225 Difference]: With dead ends: 141 [2018-01-28 21:04:42,357 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:04:42,360 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1175, Invalid=12631, Unknown=0, NotChecked=0, Total=13806 [2018-01-28 21:04:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:04:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-28 21:04:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:04:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-01-28 21:04:42,364 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 76 [2018-01-28 21:04:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:42,364 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-01-28 21:04:42,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-28 21:04:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-01-28 21:04:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-28 21:04:42,365 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:42,365 INFO L330 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-28 21:04:42,365 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 21:04:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash -450179055, now seen corresponding path program 3 times [2018-01-28 21:04:42,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:42,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:42,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:42,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:42,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:42,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:42,925 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-28 21:04:42,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:42,926 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-28 21:04:42,931 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:04:42,942 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:04:42,947 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:04:42,951 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:04:42,955 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:04:42,957 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:04:42,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:42,963 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-28 21:04:42,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:42,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:42,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:04:42,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:42,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:42,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-28 21:04:42,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:42,973 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-28 21:04:42,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:42,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:42,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:04:43,018 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-28 21:04:43,020 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-28 21:04:43,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,026 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-28 21:04:43,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:04:43,176 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-28 21:04:43,177 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-28 21:04:43,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,186 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-28 21:04:43,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-28 21:04:43,232 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-28 21:04:43,234 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-28 21:04:43,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,241 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-28 21:04:43,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-28 21:04:43,299 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-28 21:04:43,304 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-28 21:04:43,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:04:43,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:04:43,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:04:43,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-28 21:04:43,380 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-28 21:04:43,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:43,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 32 [2018-01-28 21:04:43,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 21:04:43,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 21:04:43,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:04:43,402 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 33 states. [2018-01-28 21:04:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:44,324 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-01-28 21:04:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 21:04:44,324 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 82 [2018-01-28 21:04:44,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:44,325 INFO L225 Difference]: With dead ends: 85 [2018-01-28 21:04:44,325 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:04:44,326 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=466, Invalid=2504, Unknown=0, NotChecked=0, Total=2970 [2018-01-28 21:04:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:04:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:04:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:04:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:04:44,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2018-01-28 21:04:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:44,326 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:04:44,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 21:04:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:04:44,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:04:44,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:04:44,649 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 121 DAG size of output 116 [2018-01-28 21:04:45,572 WARN L146 SmtUtils]: Spent 905ms on a formula simplification. DAG size of input: 182 DAG size of output 139 [2018-01-28 21:04:46,279 WARN L146 SmtUtils]: Spent 705ms on a formula simplification. DAG size of input: 150 DAG size of output 95 [2018-01-28 21:04:46,473 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-28 21:04:46,473 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 557) no Hoare annotation was computed. [2018-01-28 21:04:46,473 INFO L399 ceAbstractionStarter]: For program point L546(lines 546 555) no Hoare annotation was computed. [2018-01-28 21:04:46,474 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-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L552'''(line 552) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point cstrncpyFINAL(lines 540 557) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,474 INFO L399 ceAbstractionStarter]: For program point L548''''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L548'''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L551'''''(line 551) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr3RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L551'''(line 551) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L548''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-28 21:04:46,475 INFO L399 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-28 21:04:46,475 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-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr5RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L551''(lines 551 552) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L548''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L548'''''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L548'''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr2RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 557) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 552) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point cstrncpyEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-28 21:04:46,476 INFO L399 ceAbstractionStarter]: For program point L548''''''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,477 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-28 21:04:46,477 INFO L399 ceAbstractionStarter]: For program point L546'''(lines 546 555) no Hoare annotation was computed. [2018-01-28 21:04:46,477 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-28 21:04:46,477 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr4RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,477 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,477 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,477 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:04:46,477 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,477 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 572) the Hoare annotation is: true [2018-01-28 21:04:46,477 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,477 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 572) the Hoare annotation is: true [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 558 572) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-28 21:04:46,478 INFO L399 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point L568'''(line 568) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point L564'(lines 564 566) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 558 572) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 558 572) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 558 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point L561''(lines 561 563) no Hoare annotation was computed. [2018-01-28 21:04:46,479 INFO L399 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-28 21:04:46,480 INFO L399 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-28 21:04:46,480 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-28 21:04:46,480 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-28 21:04:46,480 INFO L399 ceAbstractionStarter]: For program point L567''(line 567) no Hoare annotation was computed. [2018-01-28 21:04:46,480 INFO L399 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-28 21:04:46,494 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,495 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,495 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,497 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,498 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,499 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,500 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,503 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,504 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,505 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,506 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,507 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,508 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,509 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,510 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,519 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,520 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,520 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,520 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,521 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,522 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,522 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,522 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,522 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,522 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,523 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,524 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,525 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,526 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,527 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,527 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,527 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,527 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,527 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,527 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,528 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,529 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,529 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,540 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,541 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,541 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,541 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,541 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,542 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,547 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,548 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,549 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,550 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,551 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,552 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,553 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,554 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:04:46 BoogieIcfgContainer [2018-01-28 21:04:46,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:04:46,558 INFO L168 Benchmark]: Toolchain (without parser) took 33942.90 ms. Allocated memory was 307.8 MB in the beginning and 701.0 MB in the end (delta: 393.2 MB). Free memory was 267.8 MB in the beginning and 623.7 MB in the end (delta: -355.9 MB). Peak memory consumption was 344.4 MB. Max. memory is 5.3 GB. [2018-01-28 21:04:46,559 INFO L168 Benchmark]: CDTParser took 0.11 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-28 21:04:46,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.44 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:04:46,560 INFO L168 Benchmark]: Boogie Preprocessor took 38.02 ms. Allocated memory is still 307.8 MB. Free memory was 256.8 MB in the beginning and 254.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:04:46,560 INFO L168 Benchmark]: RCFGBuilder took 329.21 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 234.1 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-28 21:04:46,560 INFO L168 Benchmark]: TraceAbstraction took 33361.49 ms. Allocated memory was 307.8 MB in the beginning and 701.0 MB in the end (delta: 393.2 MB). Free memory was 233.1 MB in the beginning and 623.7 MB in the end (delta: -390.7 MB). Peak memory consumption was 309.7 MB. Max. memory is 5.3 GB. [2018-01-28 21:04:46,562 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.11 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 206.44 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.02 ms. Allocated memory is still 307.8 MB. Free memory was 256.8 MB in the beginning and 254.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 329.21 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 234.1 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33361.49 ms. Allocated memory was 307.8 MB in the beginning and 701.0 MB in the end (delta: 393.2 MB). Free memory was 233.1 MB in the beginning and 623.7 MB in the end (delta: -390.7 MB). Peak memory consumption was 309.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-28 21:04:46,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,577 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,577 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,577 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,589 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,590 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,591 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,592 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-28 21:04:46,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-28 21:04:46,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,593 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-28 21:04:46,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,594 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,595 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,599 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,600 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,602 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-28 21:04:46,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,608 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,609 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,610 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,611 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,612 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:04:46,614 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,615 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,616 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,617 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,618 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,618 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,618 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,618 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,618 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,619 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,620 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:04:46,620 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.2s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 19.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1127 SDtfs, 3689 SDslu, 12524 SDs, 0 SdLazy, 8250 SolverSat, 519 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1051 GetRequests, 389 SyntacticMatches, 18 SemanticMatches, 644 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7942 ImplicationChecksByTransitivity, 21.9s 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, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.1s 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-28_21-04-46-626.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-28_21-04-46-626.csv Received shutdown request...