java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:22:51,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:22:51,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:22:51,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:22:51,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:22:51,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:22:51,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:22:51,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:22:51,429 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:22:51,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:22:51,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:22:51,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:22:51,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:22:51,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:22:51,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:22:51,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:22:51,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:22:51,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:22:51,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:22:51,445 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:22:51,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:22:51,448 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:22:51,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:22:51,449 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:22:51,450 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:22:51,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:22:51,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:22:51,452 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:22:51,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:22:51,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:22:51,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:22:51,454 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:22:51,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:22:51,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:22:51,465 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:22:51,465 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:22:51,466 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:22:51,466 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:22:51,466 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:22:51,466 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:22:51,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:22:51,467 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:22:51,467 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:22:51,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:22:51,468 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:22:51,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:22:51,468 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:22:51,468 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:22:51,469 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:22:51,469 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:22:51,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:22:51,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:22:51,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:22:51,470 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:22:51,470 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:22:51,470 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:22:51,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:22:51,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:22:51,471 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:22:51,471 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:22:51,471 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:22:51,471 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:22:51,471 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:22:51,471 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:22:51,472 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:22:51,472 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:22:51,473 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:22:51,473 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:22:51,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:22:51,524 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:22:51,528 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:22:51,530 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:22:51,530 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:22:51,531 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-25 05:22:51,702 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:22:51,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:22:51,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:22:51,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:22:51,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:22:51,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647aa831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51, skipping insertion in model container [2018-01-25 05:22:51,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,734 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:22:51,772 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:22:51,888 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:22:51,903 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:22:51,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51 WrapperNode [2018-01-25 05:22:51,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:22:51,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:22:51,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:22:51,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:22:51,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (1/1) ... [2018-01-25 05:22:51,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:22:51,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:22:51,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:22:51,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:22:51,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:22:51,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:22:51,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:22:51,997 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-25 05:22:51,997 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:22:51,997 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:22:51,997 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:22:51,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:22:51,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:22:51,998 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:22:51,998 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:22:51,998 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-25 05:22:51,998 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:22:51,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:22:51,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:22:52,211 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:22:52,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:22:52 BoogieIcfgContainer [2018-01-25 05:22:52,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:22:52,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:22:52,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:22:52,214 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:22:52,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:22:51" (1/3) ... [2018-01-25 05:22:52,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9147db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:22:52, skipping insertion in model container [2018-01-25 05:22:52,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:22:51" (2/3) ... [2018-01-25 05:22:52,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9147db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:22:52, skipping insertion in model container [2018-01-25 05:22:52,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:22:52" (3/3) ... [2018-01-25 05:22:52,218 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:22:52,224 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:22:52,230 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 05:22:52,278 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:22:52,278 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:22:52,278 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:22:52,278 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:22:52,279 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:22:52,279 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:22:52,279 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:22:52,279 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:22:52,280 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:22:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 05:22:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:22:52,308 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:52,309 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:52,309 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash 118579097, now seen corresponding path program 1 times [2018-01-25 05:22:52,317 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:52,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:52,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:52,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:52,366 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:52,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:52,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:52,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:22:52,501 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:52,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:22:52,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:22:52,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:22:52,525 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-01-25 05:22:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:52,714 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-01-25 05:22:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:22:52,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:22:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:52,727 INFO L225 Difference]: With dead ends: 59 [2018-01-25 05:22:52,727 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 05:22:52,731 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:22:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 05:22:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 05:22:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:22:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-25 05:22:52,772 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-01-25 05:22:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:52,772 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-25 05:22:52,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:22:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-25 05:22:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:22:52,773 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:52,774 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:52,774 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:52,774 INFO L82 PathProgramCache]: Analyzing trace with hash 118579098, now seen corresponding path program 1 times [2018-01-25 05:22:52,774 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:52,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:52,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:52,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:52,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:52,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:52,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:52,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:22:52,918 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:52,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:22:52,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:22:52,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:22:52,921 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-01-25 05:22:52,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:52,987 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-01-25 05:22:52,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:22:52,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 05:22:52,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:52,989 INFO L225 Difference]: With dead ends: 42 [2018-01-25 05:22:52,989 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 05:22:52,990 INFO L525 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-25 05:22:52,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 05:22:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 05:22:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:22:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 05:22:52,997 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2018-01-25 05:22:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:52,997 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 05:22:52,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:22:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 05:22:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:22:52,998 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:52,998 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:52,999 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -539609344, now seen corresponding path program 1 times [2018-01-25 05:22:52,999 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:53,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:53,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:53,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:53,001 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:53,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:53,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:53,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:22:53,108 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:53,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:22:53,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:22:53,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:22:53,109 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-01-25 05:22:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:53,234 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-01-25 05:22:53,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:22:53,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 05:22:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:53,235 INFO L225 Difference]: With dead ends: 41 [2018-01-25 05:22:53,235 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 05:22:53,236 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:22:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 05:22:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-25 05:22:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 05:22:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-01-25 05:22:53,242 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-01-25 05:22:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:53,242 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-01-25 05:22:53,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:22:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-01-25 05:22:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:22:53,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:53,243 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:53,243 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash -539609343, now seen corresponding path program 1 times [2018-01-25 05:22:53,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:53,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:53,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:53,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:53,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:53,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:53,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:53,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:53,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:22:53,392 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:53,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:22:53,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:22:53,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:22:53,393 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2018-01-25 05:22:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:53,553 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-01-25 05:22:53,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:22:53,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-25 05:22:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:53,557 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:22:53,557 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:22:53,557 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:22:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:22:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-25 05:22:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 05:22:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 05:22:53,565 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2018-01-25 05:22:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:53,565 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 05:22:53,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:22:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 05:22:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:22:53,566 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:53,566 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:53,567 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:53,567 INFO L82 PathProgramCache]: Analyzing trace with hash 451979505, now seen corresponding path program 1 times [2018-01-25 05:22:53,567 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:53,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:53,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:53,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:53,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:53,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:53,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:53,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:22:53,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:53,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:22:53,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:22:53,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:22:53,729 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 9 states. [2018-01-25 05:22:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:53,837 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-25 05:22:53,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:22:53,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 05:22:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:53,838 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:22:53,838 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:22:53,838 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:22:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:22:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-01-25 05:22:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 05:22:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-01-25 05:22:53,843 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2018-01-25 05:22:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:53,843 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-01-25 05:22:53,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:22:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-01-25 05:22:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:22:53,844 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:53,844 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:53,845 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:53,845 INFO L82 PathProgramCache]: Analyzing trace with hash 451979504, now seen corresponding path program 1 times [2018-01-25 05:22:53,845 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:53,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:53,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:53,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:53,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:53,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:53,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:53,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:22:53,966 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:53,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:22:53,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:22:53,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:22:53,967 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 9 states. [2018-01-25 05:22:54,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:54,073 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-01-25 05:22:54,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:22:54,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 05:22:54,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:54,074 INFO L225 Difference]: With dead ends: 44 [2018-01-25 05:22:54,074 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 05:22:54,075 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:22:54,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 05:22:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-25 05:22:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 05:22:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-25 05:22:54,081 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-01-25 05:22:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:54,082 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-25 05:22:54,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:22:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-25 05:22:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:22:54,083 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:54,083 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:54,083 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1872127023, now seen corresponding path program 1 times [2018-01-25 05:22:54,084 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:54,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:54,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:54,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:54,085 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:54,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:54,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:54,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:22:54,149 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:54,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:22:54,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:22:54,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:22:54,150 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-01-25 05:22:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:54,221 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-25 05:22:54,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:22:54,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 05:22:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:54,226 INFO L225 Difference]: With dead ends: 101 [2018-01-25 05:22:54,226 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 05:22:54,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:22:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 05:22:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-01-25 05:22:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-25 05:22:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-01-25 05:22:54,237 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 23 [2018-01-25 05:22:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:54,237 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-01-25 05:22:54,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:22:54,237 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-01-25 05:22:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:22:54,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:54,238 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:54,239 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 851058669, now seen corresponding path program 1 times [2018-01-25 05:22:54,239 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:54,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:54,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:54,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:54,240 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:54,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:54,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:22:54,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:22:54,399 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:22:54,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:22:54,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:22:54,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:22:54,400 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 10 states. [2018-01-25 05:22:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:22:54,577 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-01-25 05:22:54,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:22:54,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-25 05:22:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:22:54,579 INFO L225 Difference]: With dead ends: 150 [2018-01-25 05:22:54,579 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 05:22:54,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:22:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 05:22:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-01-25 05:22:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 05:22:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-01-25 05:22:54,591 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 23 [2018-01-25 05:22:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:22:54,592 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-01-25 05:22:54,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:22:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-01-25 05:22:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:22:54,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:22:54,593 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:22:54,593 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:22:54,593 INFO L82 PathProgramCache]: Analyzing trace with hash -737289233, now seen corresponding path program 1 times [2018-01-25 05:22:54,593 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:22:54,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:54,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:54,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:22:54,594 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:22:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:54,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:22:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:54,760 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:54,760 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:22:54,761 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 05:22:54,763 INFO L201 CegarAbsIntRunner]: [0], [4], [10], [11], [13], [14], [39], [45], [46], [50], [55], [61], [63], [64], [65], [66], [67], [78], [79], [80], [82] [2018-01-25 05:22:54,807 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:22:54,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:22:57,601 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:22:57,602 INFO L268 AbstractInterpreter]: Visited 21 different actions 38 times. Merged at 6 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-01-25 05:22:57,615 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:22:57,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:57,615 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:22:57,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:57,627 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:22:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:57,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:22:57,713 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-25 05:22:57,718 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-25 05:22:57,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:57,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:57,765 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-25 05:22:57,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:22:58,022 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-25 05:22:58,048 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-25 05:22:58,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:22:58,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:22:58,077 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-25 05:22:58,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-25 05:22:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:58,236 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:22:58,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-25 05:22:58,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-25 05:22:59,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-25 05:22:59,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,102 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,137 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-25 05:22:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:22:59,187 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:22:59,187 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:22:59,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:22:59,201 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:22:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:22:59,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:22:59,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-25 05:22:59,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:22:59,605 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 16 treesize of output 13 [2018-01-25 05:22:59,607 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-25 05:22:59,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:22:59,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:22:59,901 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 19 treesize of output 15 [2018-01-25 05:22:59,940 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 15 treesize of output 12 [2018-01-25 05:22:59,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:22:59,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:22:59,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:22:59,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-25 05:23:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:00,219 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:00,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 05:23:00,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 05:23:00,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:00,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:00,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:00,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-25 05:23:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:00,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:23:00,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 11, 11] total 37 [2018-01-25 05:23:00,459 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:23:00,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:23:00,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:23:00,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 05:23:00,460 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 17 states. [2018-01-25 05:23:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:03,072 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2018-01-25 05:23:03,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:23:03,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-01-25 05:23:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:03,075 INFO L225 Difference]: With dead ends: 116 [2018-01-25 05:23:03,075 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 05:23:03,076 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=230, Invalid=1932, Unknown=0, NotChecked=0, Total=2162 [2018-01-25 05:23:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 05:23:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-01-25 05:23:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-25 05:23:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-01-25 05:23:03,091 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 23 [2018-01-25 05:23:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:03,091 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2018-01-25 05:23:03,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:23:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-01-25 05:23:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:23:03,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:03,092 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:23:03,093 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:23:03,093 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493848, now seen corresponding path program 1 times [2018-01-25 05:23:03,093 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:03,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:03,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:03,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:03,094 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:03,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:03,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:23:03,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:23:03,149 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:23:03,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:23:03,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:23:03,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:23:03,149 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 6 states. [2018-01-25 05:23:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:03,208 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2018-01-25 05:23:03,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:23:03,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 05:23:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:03,209 INFO L225 Difference]: With dead ends: 105 [2018-01-25 05:23:03,209 INFO L226 Difference]: Without dead ends: 104 [2018-01-25 05:23:03,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-25 05:23:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-25 05:23:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-01-25 05:23:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-25 05:23:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-01-25 05:23:03,222 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 24 [2018-01-25 05:23:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:03,222 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-01-25 05:23:03,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:23:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-01-25 05:23:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:23:03,223 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:03,223 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:23:03,224 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:23:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493847, now seen corresponding path program 1 times [2018-01-25 05:23:03,224 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:03,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:03,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:03,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:03,225 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:03,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:03,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:23:03,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:23:03,330 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:23:03,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:23:03,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:23:03,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:23:03,331 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 8 states. [2018-01-25 05:23:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:03,436 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-01-25 05:23:03,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:23:03,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-25 05:23:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:03,438 INFO L225 Difference]: With dead ends: 136 [2018-01-25 05:23:03,438 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:23:03,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:23:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:23:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-01-25 05:23:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 05:23:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-25 05:23:03,452 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2018-01-25 05:23:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:03,452 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-25 05:23:03,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:23:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-25 05:23:03,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:23:03,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:03,454 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:23:03,454 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:23:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash 595125547, now seen corresponding path program 1 times [2018-01-25 05:23:03,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:03,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:03,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:03,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:03,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:03,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:03,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:23:03,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 05:23:03,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:23:03,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:23:03,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:23:03,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:23:03,720 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 12 states. [2018-01-25 05:23:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:04,014 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2018-01-25 05:23:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:23:04,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-01-25 05:23:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:04,015 INFO L225 Difference]: With dead ends: 122 [2018-01-25 05:23:04,015 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 05:23:04,016 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:23:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 05:23:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2018-01-25 05:23:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 05:23:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-01-25 05:23:04,028 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 24 [2018-01-25 05:23:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:04,028 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-01-25 05:23:04,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:23:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-01-25 05:23:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:23:04,029 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:04,029 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:23:04,029 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:23:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1381129789, now seen corresponding path program 1 times [2018-01-25 05:23:04,030 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:04,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:04,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:04,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:04,030 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:04,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:04,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:04,435 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:23:04,436 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:23:04,436 INFO L201 CegarAbsIntRunner]: [0], [4], [10], [11], [14], [16], [39], [45], [46], [50], [55], [61], [63], [64], [65], [66], [67], [78], [79], [80], [82] [2018-01-25 05:23:04,437 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:23:04,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:23:06,730 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:23:06,731 INFO L268 AbstractInterpreter]: Visited 21 different actions 39 times. Merged at 6 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-01-25 05:23:06,742 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:23:06,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:06,742 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:23:06,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:06,756 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:23:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:06,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:06,803 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-25 05:23:06,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:06,884 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-25 05:23:06,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:06,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:06,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:23:07,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:07,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:07,090 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-25 05:23:07,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:07,134 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-25 05:23:07,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:07,177 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-25 05:23:07,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:23:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:07,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:08,139 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:08,139 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:23:08,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:08,143 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:23:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:08,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:08,189 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-25 05:23:08,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:08,198 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-25 05:23:08,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:08,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:08,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:23:08,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:08,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:08,230 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-25 05:23:08,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:08,280 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-25 05:23:08,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:08,288 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-25 05:23:08,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:23:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:08,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:08,523 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:08,523 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:24, output treesize:1 [2018-01-25 05:23:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:08,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:23:08,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 10, 9] total 31 [2018-01-25 05:23:08,544 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:23:08,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 05:23:08,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 05:23:08,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2018-01-25 05:23:08,545 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 19 states. [2018-01-25 05:23:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:09,037 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2018-01-25 05:23:09,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:23:09,038 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-01-25 05:23:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:09,039 INFO L225 Difference]: With dead ends: 134 [2018-01-25 05:23:09,039 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 05:23:09,039 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2018-01-25 05:23:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 05:23:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2018-01-25 05:23:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 05:23:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-01-25 05:23:09,051 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2018-01-25 05:23:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:09,052 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-01-25 05:23:09,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 05:23:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-01-25 05:23:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:23:09,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:09,053 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:23:09,053 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:23:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2091617170, now seen corresponding path program 1 times [2018-01-25 05:23:09,054 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:09,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:09,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:09,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:09,055 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:09,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:09,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:23:09,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:23:09,093 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:23:09,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:23:09,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:23:09,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:23:09,094 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 5 states. [2018-01-25 05:23:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:09,130 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-01-25 05:23:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:23:09,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 05:23:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:09,131 INFO L225 Difference]: With dead ends: 125 [2018-01-25 05:23:09,131 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:23:09,132 INFO L525 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-25 05:23:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:23:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-25 05:23:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 05:23:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-01-25 05:23:09,141 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 26 [2018-01-25 05:23:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:09,141 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-01-25 05:23:09,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:23:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-01-25 05:23:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:23:09,142 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:09,142 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:23:09,142 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:23:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash -156851199, now seen corresponding path program 2 times [2018-01-25 05:23:09,142 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:09,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:09,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:09,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:09,143 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:09,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:09,525 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-25 05:23:09,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:09,525 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:23:09,525 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:23:09,525 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:23:09,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:09,525 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:23:09,530 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:23:09,530 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:23:09,543 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:09,550 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:09,552 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:23:09,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:09,575 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-25 05:23:09,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:23:09,581 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-25 05:23:09,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:09,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:09,589 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-25 05:23:09,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:23:09,627 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-25 05:23:09,629 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-25 05:23:09,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,638 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-25 05:23:09,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-25 05:23:09,817 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-25 05:23:09,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:23:09,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:09,829 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-25 05:23:09,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-25 05:23:09,897 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-25 05:23:09,903 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-25 05:23:09,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:23:09,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:23:09,913 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-25 05:23:09,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-25 05:23:09,963 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-25 05:23:09,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:10,466 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-25 05:23:10,478 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 12 treesize of output 11 [2018-01-25 05:23:10,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,490 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 18 [2018-01-25 05:23:10,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-25 05:23:10,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,496 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 19 treesize of output 15 [2018-01-25 05:23:10,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-25 05:23:10,499 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,502 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-25 05:23:10,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:23:10,537 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-25 05:23:10,703 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-25 05:23:10,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:10,724 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:23:10,727 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:23:10,727 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:23:10,743 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:10,767 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:23:10,803 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:23:10,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:10,811 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-25 05:23:10,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-25 05:23:10,816 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-25 05:23:10,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:10,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:10,822 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-25 05:23:10,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-25 05:23:10,860 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 15 treesize of output 12 [2018-01-25 05:23:10,861 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 12 treesize of output 11 [2018-01-25 05:23:10,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:10,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 05:23:11,043 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-25 05:23:11,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:23:11,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-25 05:23:11,129 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-25 05:23:11,134 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-25 05:23:11,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:23:11,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:23:11,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:23:11,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-25 05:23:11,174 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-25 05:23:11,174 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:11,313 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-25 05:23:11,327 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 12 treesize of output 11 [2018-01-25 05:23:11,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,339 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 19 treesize of output 15 [2018-01-25 05:23:11,342 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-25 05:23:11,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,346 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 18 [2018-01-25 05:23:11,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-25 05:23:11,348 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,351 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:11,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-25 05:23:11,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-25 05:23:11,381 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-25 05:23:11,578 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-25 05:23:11,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:23:11,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15] total 51 [2018-01-25 05:23:11,580 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:23:11,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-25 05:23:11,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-25 05:23:11,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2475, Unknown=0, NotChecked=0, Total=2652 [2018-01-25 05:23:11,581 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 26 states. [2018-01-25 05:23:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:12,934 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-01-25 05:23:12,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:23:12,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 28 [2018-01-25 05:23:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:12,960 INFO L225 Difference]: With dead ends: 130 [2018-01-25 05:23:12,960 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 05:23:12,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-01-25 05:23:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 05:23:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2018-01-25 05:23:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 05:23:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-01-25 05:23:12,973 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 28 [2018-01-25 05:23:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:12,973 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-01-25 05:23:12,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-25 05:23:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-01-25 05:23:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:23:12,974 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:12,974 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-25 05:23:12,974 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:23:12,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1429135806, now seen corresponding path program 1 times [2018-01-25 05:23:12,974 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:12,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:12,975 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:23:12,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:12,975 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:12,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:13,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:13,305 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:23:13,305 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:23:13,305 INFO L201 CegarAbsIntRunner]: [0], [4], [10], [11], [14], [19], [23], [25], [30], [31], [33], [34], [45], [46], [50], [53], [61], [63], [64], [65], [66], [67], [78], [79], [80], [82] [2018-01-25 05:23:13,306 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:23:13,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:23:18,428 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:23:18,429 INFO L268 AbstractInterpreter]: Visited 26 different actions 43 times. Merged at 6 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-01-25 05:23:18,463 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:23:18,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:18,463 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 05:23:18,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:18,468 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:23:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:18,489 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:18,495 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-25 05:23:18,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:18,501 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-25 05:23:18,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:18,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:18,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:23:18,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:18,539 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-25 05:23:18,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:18,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:18,547 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:18,548 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-25 05:23:18,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:18,553 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-25 05:23:18,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:23:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:18,788 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:19,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:23:19,215 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:23:19,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:19,222 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:23:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:19,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:23:19,295 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-25 05:23:19,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:19,302 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-25 05:23:19,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:19,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:23:19,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:23:19,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:19,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:23:19,315 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-25 05:23:19,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:19,322 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-25 05:23:19,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:19,327 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-25 05:23:19,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-25 05:23:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:19,522 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:23:19,696 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-25 05:23:19,697 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:24, output treesize:1 [2018-01-25 05:23:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:23:19,701 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:23:19,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13, 14, 13] total 44 [2018-01-25 05:23:19,702 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:23:19,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-25 05:23:19,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-25 05:23:19,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2018-01-25 05:23:19,703 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 28 states. [2018-01-25 05:23:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:21,233 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-01-25 05:23:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-25 05:23:21,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2018-01-25 05:23:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:21,234 INFO L225 Difference]: With dead ends: 144 [2018-01-25 05:23:21,234 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 05:23:21,235 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=508, Invalid=4048, Unknown=0, NotChecked=0, Total=4556 [2018-01-25 05:23:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 05:23:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 96. [2018-01-25 05:23:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 05:23:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-25 05:23:21,246 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 29 [2018-01-25 05:23:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:21,247 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-25 05:23:21,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-25 05:23:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-25 05:23:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:23:21,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:23:21,248 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:23:21,248 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:23:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1810852380, now seen corresponding path program 1 times [2018-01-25 05:23:21,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:23:21,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:21,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:23:21,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:23:21,249 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:23:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:23:21,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:23:21,325 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-25 05:23:21,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:23:21,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:23:21,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:23:21,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:23:21,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:23:21,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:23:21,326 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 6 states. [2018-01-25 05:23:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:23:21,400 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-01-25 05:23:21,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:23:21,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 05:23:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:23:21,401 INFO L225 Difference]: With dead ends: 96 [2018-01-25 05:23:21,401 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:23:21,402 INFO L525 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-25 05:23:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:23:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:23:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:23:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:23:21,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-25 05:23:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:23:21,402 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:23:21,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:23:21,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:23:21,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:23:21,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:23:21,504 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 05:23:21,540 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 05:23:21,601 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 05:23:21,605 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 05:23:23,149 WARN L146 SmtUtils]: Spent 1529ms on a formula simplification. DAG size of input: 153 DAG size of output 125 [2018-01-25 05:23:23,626 WARN L146 SmtUtils]: Spent 474ms on a formula simplification. DAG size of input: 147 DAG size of output 117 [2018-01-25 05:23:23,888 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 88 DAG size of output 70 [2018-01-25 05:23:23,891 INFO L401 ceAbstractionStarter]: For program point L551'(lines 551 552) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 555) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L397 ceAbstractionStarter]: At program point cstrncpyENTRY(lines 540 557) the Hoare annotation is: (let ((.cse9 (select |#length| |cstrncpy_#in~s1.base|))) (let ((.cse0 (not (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= 0 (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ (select |#length| |cstrncpy_#in~s2.base|) main_~nondetString~5.offset (- 1)))) (<= main_~nondetString~5.offset 0))))) (.cse4 (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|)))) (.cse5 (not (= 0 |cstrncpy_#in~s1.offset|))) (.cse1 (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|)) (.cse2 (< |cstrncpy_#in~n| .cse9)) (.cse3 (< .cse9 |cstrncpy_#in~n|)) (.cse8 (not (= 0 |cstrncpy_#in~s2.offset|))) (.cse6 (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|)))) (.cse7 (< .cse9 1))) (and (or .cse0 (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|)) .cse1 .cse2 .cse3 (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|) 0)) .cse4 .cse5 .cse6 .cse7) .cse8 (not (exists ((v_main_~nondetString~5.offset_BEFORE_CALL_2 Int) (main_~length~5 Int)) (and (<= |cstrncpy_#in~s2.offset| v_main_~nondetString~5.offset_BEFORE_CALL_2) (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5 (- 1))) 0) (<= 1 main_~length~5) (<= (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5) (select |#length| |cstrncpy_#in~s2.base|)))))) (or .cse0 .cse4 .cse5 .cse1 .cse2 (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (<= main_~nondetString~5.offset 0) (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) (+ main_~nondetString~5.offset (select |#length| |cstrncpy_#in~s2.base|) (- 1)))))) .cse3 .cse8 .cse6 .cse7 (< (select |#length| |cstrncpy_#in~s2.base|) 1))))) [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr5RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point cstrncpyFINAL(lines 540 557) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr2RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 552) no Hoare annotation was computed. [2018-01-25 05:23:23,892 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-25 05:23:23,893 INFO L401 ceAbstractionStarter]: For program point cstrncpyEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-25 05:23:23,893 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr3RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,893 INFO L397 ceAbstractionStarter]: At program point L551'''(lines 551 552) the Hoare annotation is: (let ((.cse17 (select |#length| |cstrncpy_#in~s1.base|))) (let ((.cse6 (< (select |#length| |cstrncpy_#in~s2.base|) 1)) (.cse2 (not (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= 0 (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ (select |#length| |cstrncpy_#in~s2.base|) main_~nondetString~5.offset (- 1)))) (<= main_~nondetString~5.offset 0))))) (.cse5 (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|)) (.cse7 (< |cstrncpy_#in~n| .cse17)) (.cse15 (< .cse17 |cstrncpy_#in~n|)) (.cse4 (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|)))) (.cse3 (not (= 0 |cstrncpy_#in~s1.offset|))) (.cse9 (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|)))) (.cse10 (< .cse17 1)) (.cse8 (not (= 0 |cstrncpy_#in~s2.offset|))) (.cse0 (<= cstrncpy_~dst~2.offset 1)) (.cse1 (let ((.cse16 (select |#length| cstrncpy_~src~2.base))) (or (<= .cse16 cstrncpy_~src~2.offset) (<= cstrncpy_~src~2.offset 1) (<= (+ cstrncpy_~src~2.offset 2) .cse16))))) (and (or (and (<= cstrncpy_~n2~2 0) (<= cstrncpy_~n 0) .cse0 .cse1 (<= cstrncpy_~us~2.offset 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 |cstrncpy_#in~n|) .cse8 .cse9 .cse10) (or .cse2 (let ((.cse14 (+ cstrncpy_~dst~2.offset cstrncpy_~n)) (.cse13 (select |#length| cstrncpy_~dst~2.base)) (.cse12 (select |#length| cstrncpy_~us~2.base)) (.cse11 (+ cstrncpy_~us~2.offset cstrncpy_~n2~2))) (and (<= .cse11 .cse12) (<= 1 cstrncpy_~dst~2.offset) (<= .cse13 .cse14) (<= 1 cstrncpy_~src~2.offset) (<= 1 cstrncpy_~us~2.offset) (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)))))) (= 1 (select |#valid| cstrncpy_~src~2.base)) (= 1 (select |#valid| cstrncpy_~us~2.base)) (not (= cstrncpy_~src~2.base cstrncpy_~dst~2.base)) (<= .cse14 .cse13) (= 1 (select |#valid| cstrncpy_~dst~2.base)) (<= cstrncpy_~us~2.offset .cse12) (<= cstrncpy_~dst~2.offset .cse13) (<= .cse12 .cse11))) .cse4 .cse3 .cse5 .cse7 .cse15 .cse8 .cse9 .cse10 .cse6) (or .cse2 .cse5 .cse7 .cse15 (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|) 0)) .cse4 .cse3 .cse9 .cse10) .cse8 (not (exists ((v_main_~nondetString~5.offset_BEFORE_CALL_2 Int) (main_~length~5 Int)) (and (<= |cstrncpy_#in~s2.offset| v_main_~nondetString~5.offset_BEFORE_CALL_2) (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5 (- 1))) 0) (<= 1 main_~length~5) (<= (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5) (select |#length| |cstrncpy_#in~s2.base|))))) (and .cse0 .cse1 (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|))))))) [2018-01-25 05:23:23,893 INFO L397 ceAbstractionStarter]: At program point L546''(lines 546 555) the Hoare annotation is: (let ((.cse21 (select |#length| |cstrncpy_#in~s1.base|))) (let ((.cse0 (not (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (= 0 (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ (select |#length| |cstrncpy_#in~s2.base|) main_~nondetString~5.offset (- 1)))) (<= main_~nondetString~5.offset 0))))) (.cse4 (not (= 1 (select |#valid| |cstrncpy_#in~s2.base|)))) (.cse5 (not (= 0 |cstrncpy_#in~s1.offset|))) (.cse1 (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|)) (.cse12 (< (select |#length| |cstrncpy_#in~s2.base|) 1)) (.cse9 (= 0 cstrncpy_~src~2.offset)) (.cse10 (<= cstrncpy_~dst~2.offset 1)) (.cse11 (select |#length| cstrncpy_~src~2.base)) (.cse2 (< |cstrncpy_#in~n| .cse21)) (.cse3 (< .cse21 |cstrncpy_#in~n|)) (.cse8 (not (= 0 |cstrncpy_#in~s2.offset|))) (.cse6 (not (= 1 (select |#valid| |cstrncpy_#in~s1.base|)))) (.cse7 (< .cse21 1))) (and (or .cse0 .cse1 .cse2 .cse3 (or (not (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|) 0)) .cse4 .cse5 .cse6 .cse7) .cse8 (not (exists ((v_main_~nondetString~5.offset_BEFORE_CALL_2 Int) (main_~length~5 Int)) (and (<= |cstrncpy_#in~s2.offset| v_main_~nondetString~5.offset_BEFORE_CALL_2) (= (select (select |old(#memory_int)| |cstrncpy_#in~s2.base|) (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5 (- 1))) 0) (<= 1 main_~length~5) (<= (+ v_main_~nondetString~5.offset_BEFORE_CALL_2 main_~length~5) (select |#length| |cstrncpy_#in~s2.base|))))) (and (= 0 (select (select |#memory_int| cstrncpy_~src~2.base) cstrncpy_~src~2.offset)) .cse9 (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|)))) (or .cse0 .cse5 .cse4 (and (<= cstrncpy_~n 0) .cse10 (or (<= cstrncpy_~src~2.offset 1) (<= (+ cstrncpy_~src~2.offset 2) .cse11))) .cse1 .cse9 .cse12 .cse2 (< 1 |cstrncpy_#in~n|) .cse8 .cse6 .cse7) (let ((.cse14 (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))))))) (.cse15 (= 1 (select |#valid| cstrncpy_~src~2.base))) (.cse16 (not (= cstrncpy_~src~2.base cstrncpy_~dst~2.base))) (.cse17 (= 1 (select |#valid| cstrncpy_~dst~2.base))) (.cse13 (select |#length| cstrncpy_~dst~2.base))) (or .cse0 .cse4 .cse5 .cse1 .cse12 (and (<= cstrncpy_~n .cse13) (= 0 cstrncpy_~dst~2.offset) .cse14 .cse15 (<= .cse13 cstrncpy_~n) (exists ((main_~nondetString~5.offset Int)) (and (<= 0 main_~nondetString~5.offset) (<= main_~nondetString~5.offset 0) (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) (+ main_~nondetString~5.offset (select |#length| |cstrncpy_#in~s2.base|) (- 1)))))) (= cstrncpy_~n |cstrncpy_#in~n|) .cse16 .cse9 .cse17 (<= 1 .cse11)) (let ((.cse19 (+ cstrncpy_~dst~2.offset cstrncpy_~n))) (and (let ((.cse18 (<= (+ cstrncpy_~src~2.offset 1) .cse11)) (.cse20 (<= cstrncpy_~dst~2.offset .cse13))) (or (and (<= 1 cstrncpy_~dst~2.offset) .cse18 .cse14 .cse15 (<= 2 cstrncpy_~src~2.offset) .cse16 (<= .cse19 .cse13) .cse17 .cse20) (and .cse10 .cse18 (<= 1 cstrncpy_~src~2.offset) .cse14 .cse15 .cse16 (<= (+ cstrncpy_~n 1) .cse13) .cse17 .cse20))) (<= .cse13 .cse19))) .cse2 .cse3 .cse8 .cse6 .cse7))))) [2018-01-25 05:23:23,893 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,893 INFO L401 ceAbstractionStarter]: For program point L546'''(lines 546 555) no Hoare annotation was computed. [2018-01-25 05:23:23,893 INFO L401 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-25 05:23:23,893 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr4RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 572) the Hoare annotation is: true [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 572) the Hoare annotation is: true [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 558 572) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-25 05:23:23,894 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-25 05:23:23,895 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-25 05:23:23,895 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-25 05:23:23,895 INFO L401 ceAbstractionStarter]: For program point L568'''(line 568) no Hoare annotation was computed. [2018-01-25 05:23:23,895 INFO L401 ceAbstractionStarter]: For program point L564'(lines 564 566) no Hoare annotation was computed. [2018-01-25 05:23:23,895 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 558 572) no Hoare annotation was computed. [2018-01-25 05:23:23,895 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 558 572) no Hoare annotation was computed. [2018-01-25 05:23:23,895 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 558 572) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 05:23:23,895 INFO L401 ceAbstractionStarter]: For program point L561''(lines 561 563) no Hoare annotation was computed. [2018-01-25 05:23:23,895 INFO L401 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-25 05:23:23,896 INFO L397 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-25 05:23:23,896 INFO L401 ceAbstractionStarter]: For program point L567''(line 567) no Hoare annotation was computed. [2018-01-25 05:23:23,896 INFO L401 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-25 05:23:23,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,917 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,918 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,919 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,920 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,920 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,920 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,920 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,921 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,921 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,921 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,921 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,922 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,923 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,924 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,924 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,924 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,924 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,935 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,936 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,937 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,938 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,939 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,940 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,941 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,942 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,942 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,942 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,943 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,944 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,944 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,945 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,946 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,947 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,948 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,949 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,950 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,951 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,952 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,963 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,964 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,965 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,970 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,974 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,975 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:23,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:23,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:23,979 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:23,984 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:23,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:23:23 BoogieIcfgContainer [2018-01-25 05:23:23,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:23:23,987 INFO L168 Benchmark]: Toolchain (without parser) took 32284.69 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 913.8 MB). Free memory was 262.9 MB in the beginning and 996.4 MB in the end (delta: -733.5 MB). Peak memory consumption was 841.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:23,988 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:23:23,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.22 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 251.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:23,989 INFO L168 Benchmark]: Boogie Preprocessor took 35.98 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:23,989 INFO L168 Benchmark]: RCFGBuilder took 263.73 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 231.6 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:23,989 INFO L168 Benchmark]: TraceAbstraction took 31774.50 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 913.8 MB). Free memory was 231.6 MB in the beginning and 996.4 MB in the end (delta: -764.8 MB). Peak memory consumption was 810.4 MB. Max. memory is 5.3 GB. [2018-01-25 05:23:23,990 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.20 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.22 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 251.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.98 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 263.73 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 231.6 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 31774.50 ms. Allocated memory was 303.0 MB in the beginning and 1.2 GB in the end (delta: 913.8 MB). Free memory was 231.6 MB in the beginning and 996.4 MB in the end (delta: -764.8 MB). Peak memory consumption was 810.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 248 LocStat_NO_SUPPORTING_DISEQUALITIES : 37 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 15.100313 RENAME_VARIABLES(MILLISECONDS) : 0.806210 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 15.032610 PROJECTAWAY(MILLISECONDS) : 22.864859 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.117196 DISJOIN(MILLISECONDS) : 1.036270 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.832475 ADD_EQUALITY(MILLISECONDS) : 0.048675 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014496 #CONJOIN_DISJUNCTIVE : 70 #RENAME_VARIABLES : 124 #UNFREEZE : 0 #CONJOIN : 128 #PROJECTAWAY : 93 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 117 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 258 LocStat_NO_SUPPORTING_DISEQUALITIES : 37 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 27 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 28 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 13.026885 RENAME_VARIABLES(MILLISECONDS) : 2.919710 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 12.947010 PROJECTAWAY(MILLISECONDS) : 49.851006 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.083018 DISJOIN(MILLISECONDS) : 0.903584 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.969201 ADD_EQUALITY(MILLISECONDS) : 0.041405 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011177 #CONJOIN_DISJUNCTIVE : 73 #RENAME_VARIABLES : 130 #UNFREEZE : 0 #CONJOIN : 131 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 381 LocStat_NO_SUPPORTING_DISEQUALITIES : 58 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 16.503930 RENAME_VARIABLES(MILLISECONDS) : 3.623183 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 16.422264 PROJECTAWAY(MILLISECONDS) : 18.326541 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.029882 DISJOIN(MILLISECONDS) : 1.091406 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.659518 ADD_EQUALITY(MILLISECONDS) : 0.016265 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006962 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 124 #UNFREEZE : 0 #CONJOIN : 140 #PROJECTAWAY : 97 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 119 #ADD_EQUALITY : 79 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * 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[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,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[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,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[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_~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_~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[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,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[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,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[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_~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_~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_~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[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,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[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,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[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_~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[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,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[main_~length~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #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 #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 #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 #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 * 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-25 05:23:24,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,004 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,004 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,004 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,004 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,005 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,005 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,005 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,005 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,005 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,006 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,007 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,008 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,009 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,010 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,011 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,018 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,019 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,019 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,019 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || s1 == s2) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || (((!(\old(unknown-#memory_int-unknown)[s2][s2] == 0) || !(1 == \valid[s2])) || !(0 == s1)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) || !(0 == s2)) || !(\exists v_main_~nondetString~5.offset_BEFORE_CALL_2 : int, main_~length~5 : int :: ((s2 <= v_main_~nondetString~5.offset_BEFORE_CALL_2 && \old(unknown-#memory_int-unknown)[s2][v_main_~nondetString~5.offset_BEFORE_CALL_2 + main_~length~5 + -1] == 0) && 1 <= main_~length~5) && v_main_~nondetString~5.offset_BEFORE_CALL_2 + main_~length~5 <= unknown-#length-unknown[s2])) || ((0 == unknown-#memory_int-unknown[src][src] && 0 == src) && 0 == unknown-#memory_int-unknown[s2][s2])) && (((((((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || !(0 == s1)) || !(1 == \valid[s2])) || ((n <= 0 && dst <= 1) && (src <= 1 || src + 2 <= unknown-#length-unknown[src]))) || s1 == s2) || 0 == src) || unknown-#length-unknown[s2] < 1) || \old(n) < unknown-#length-unknown[s1]) || 1 < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1)) && (((((((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || !(1 == \valid[s2])) || !(0 == s1)) || s1 == s2) || unknown-#length-unknown[s2] < 1) || ((((((((((n <= unknown-#length-unknown[dst] && 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])) && 1 == \valid[src]) && unknown-#length-unknown[dst] <= n) && (\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && main_~nondetString~5.offset <= 0) && 0 == unknown-#memory_int-unknown[s2][main_~nondetString~5.offset + unknown-#length-unknown[s2] + -1])) && n == \old(n)) && !(src == dst)) && 0 == src) && 1 == \valid[dst]) && 1 <= unknown-#length-unknown[src])) || ((((((((((1 <= dst && src + 1 <= unknown-#length-unknown[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])) && 1 == \valid[src]) && 2 <= src) && !(src == dst)) && dst + n <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && dst <= unknown-#length-unknown[dst]) || ((((((((dst <= 1 && src + 1 <= unknown-#length-unknown[src]) && 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])) && 1 == \valid[src]) && !(src == dst)) && n + 1 <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && dst <= unknown-#length-unknown[dst])) && unknown-#length-unknown[dst] <= dst + n)) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) - InvariantResult [Line: 551]: Loop Invariant [2018-01-25 05:23:24,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,027 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,028 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,029 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,030 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,031 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,035 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~5.offset,QUANTIFIED] [2018-01-25 05:23:24,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~5.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 05:23:24,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~5,QUANTIFIED] [2018-01-25 05:23:24,037 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-25 05:23:24,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 05:23:24,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((((((n2 <= 0 && n <= 0) && dst <= 1) && ((unknown-#length-unknown[src] <= src || src <= 1) || src + 2 <= unknown-#length-unknown[src])) && us <= 1) || !(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0)) || !(0 == s1)) || !(1 == \valid[s2])) || s1 == s2) || unknown-#length-unknown[s2] < 1) || \old(n) < unknown-#length-unknown[s1]) || 1 < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) && ((((((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || (((((((((((((us + n2 <= unknown-#length-unknown[us] && 1 <= dst) && unknown-#length-unknown[dst] <= dst + n) && 1 <= src) && 1 <= us) && (\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])) && 1 == \valid[src]) && 1 == \valid[us]) && !(src == dst)) && dst + n <= unknown-#length-unknown[dst]) && 1 == \valid[dst]) && us <= unknown-#length-unknown[us]) && dst <= unknown-#length-unknown[dst]) && unknown-#length-unknown[us] <= us + n2)) || !(1 == \valid[s2])) || !(0 == s1)) || s1 == s2) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || !(0 == s2)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) || unknown-#length-unknown[s2] < 1)) && (((((((!(\exists main_~nondetString~5.offset : int :: (0 <= main_~nondetString~5.offset && 0 == \old(unknown-#memory_int-unknown)[s2][unknown-#length-unknown[s2] + main_~nondetString~5.offset + -1]) && main_~nondetString~5.offset <= 0) || s1 == s2) || \old(n) < unknown-#length-unknown[s1]) || unknown-#length-unknown[s1] < \old(n)) || (((!(\old(unknown-#memory_int-unknown)[s2][s2] == 0) || !(1 == \valid[s2])) || !(0 == s1)) || !(1 == \valid[s1])) || unknown-#length-unknown[s1] < 1) || !(0 == s2)) || !(\exists v_main_~nondetString~5.offset_BEFORE_CALL_2 : int, main_~length~5 : int :: ((s2 <= v_main_~nondetString~5.offset_BEFORE_CALL_2 && \old(unknown-#memory_int-unknown)[s2][v_main_~nondetString~5.offset_BEFORE_CALL_2 + main_~length~5 + -1] == 0) && 1 <= main_~length~5) && v_main_~nondetString~5.offset_BEFORE_CALL_2 + main_~length~5 <= unknown-#length-unknown[s2])) || ((dst <= 1 && ((unknown-#length-unknown[src] <= src || src <= 1) || src + 2 <= unknown-#length-unknown[src])) && 0 == unknown-#memory_int-unknown[s2][s2])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 9 error locations. SAFE Result, 31.6s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 588 SDtfs, 925 SDslu, 3215 SDs, 0 SdLazy, 2449 SolverSat, 279 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 297 SyntacticMatches, 23 SemanticMatches, 322 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 2899 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.3s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 206 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 17 PreInvPairs, 28 NumberOfFragments, 1182 HoareAnnotationTreeSize, 17 FomulaSimplifications, 3189 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3717 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 762 ConstructedInterpolants, 45 QuantifiedInterpolants, 188094 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 405 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 8/118 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-23-24-046.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-23-24-046.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-23-24-046.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-23-24-046.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-23-24-046.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-23-24-046.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-23-24-046.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_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-23-24-046.csv Received shutdown request...