java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:49:31,445 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:49:31,446 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:49:31,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:49:31,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:49:31,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:49:31,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:49:31,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:49:31,467 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:49:31,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:49:31,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:49:31,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:49:31,469 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:49:31,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:49:31,472 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:49:31,474 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:49:31,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:49:31,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:49:31,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:49:31,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:49:31,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:49:31,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:49:31,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:49:31,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:49:31,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:49:31,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:49:31,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:49:31,488 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:49:31,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:49:31,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:49:31,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:49:31,489 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:49:31,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:49:31,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:49:31,498 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:49:31,498 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:49:31,498 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:49:31,498 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:49:31,498 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:49:31,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:49:31,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:49:31,499 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:49:31,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:49:31,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:49:31,500 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:49:31,500 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:49:31,500 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:49:31,500 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:49:31,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:49:31,500 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:49:31,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:49:31,500 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:49:31,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:49:31,501 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:49:31,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:49:31,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:49:31,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:49:31,501 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:49:31,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:49:31,502 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:49:31,502 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:49:31,502 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:49:31,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:49:31,502 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:49:31,503 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:49:31,503 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:49:31,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:49:31,545 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:49:31,548 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:49:31,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:49:31,550 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:49:31,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:49:31,702 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:49:31,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:49:31,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:49:31,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:49:31,714 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:49:31,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba793f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31, skipping insertion in model container [2018-01-29 22:49:31,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,731 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:49:31,768 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:49:31,886 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:49:31,902 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:49:31,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31 WrapperNode [2018-01-29 22:49:31,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:49:31,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:49:31,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:49:31,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:49:31,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (1/1) ... [2018-01-29 22:49:31,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:49:31,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:49:31,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:49:31,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:49:31,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:49:31,984 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:49:31,984 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:49:31,984 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-29 22:49:31,984 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:49:31,985 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:49:31,985 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:49:31,985 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:49:31,985 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:49:31,985 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:49:31,985 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:49:31,985 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-29 22:49:31,986 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:49:31,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:49:31,986 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:49:32,213 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:49:32,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:49:32 BoogieIcfgContainer [2018-01-29 22:49:32,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:49:32,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:49:32,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:49:32,217 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:49:32,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:49:31" (1/3) ... [2018-01-29 22:49:32,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b40a304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:49:32, skipping insertion in model container [2018-01-29 22:49:32,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:49:31" (2/3) ... [2018-01-29 22:49:32,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b40a304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:49:32, skipping insertion in model container [2018-01-29 22:49:32,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:49:32" (3/3) ... [2018-01-29 22:49:32,221 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:49:32,228 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:49:32,234 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-29 22:49:32,278 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:49:32,279 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:49:32,279 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:49:32,279 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:49:32,279 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:49:32,279 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:49:32,279 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:49:32,279 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:49:32,280 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:49:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-29 22:49:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:49:32,305 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:32,306 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:32,306 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash 768156548, now seen corresponding path program 1 times [2018-01-29 22:49:32,311 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:32,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:32,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:32,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:32,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:32,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:32,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:32,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:49:32,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:49:32,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:49:32,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:49:32,517 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-01-29 22:49:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:32,696 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-29 22:49:32,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:49:32,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 22:49:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:32,707 INFO L225 Difference]: With dead ends: 93 [2018-01-29 22:49:32,707 INFO L226 Difference]: Without dead ends: 75 [2018-01-29 22:49:32,710 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:49:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-29 22:49:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-29 22:49:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-29 22:49:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-29 22:49:32,740 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 19 [2018-01-29 22:49:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:32,740 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-29 22:49:32,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:49:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-29 22:49:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:49:32,741 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:32,741 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:32,741 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:32,741 INFO L82 PathProgramCache]: Analyzing trace with hash 768156549, now seen corresponding path program 1 times [2018-01-29 22:49:32,741 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:32,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:32,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:32,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:32,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:32,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:32,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:32,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:49:32,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:49:32,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:49:32,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:49:32,924 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2018-01-29 22:49:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:32,979 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-01-29 22:49:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:49:32,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-29 22:49:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:32,981 INFO L225 Difference]: With dead ends: 75 [2018-01-29 22:49:32,981 INFO L226 Difference]: Without dead ends: 74 [2018-01-29 22:49:32,982 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:49:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-29 22:49:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-29 22:49:32,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-29 22:49:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-29 22:49:32,988 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 19 [2018-01-29 22:49:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:32,989 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-29 22:49:32,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:49:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-29 22:49:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:49:32,990 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:32,990 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:32,990 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:32,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1294330366, now seen corresponding path program 1 times [2018-01-29 22:49:32,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:32,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:32,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:32,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:32,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:33,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:33,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:33,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:49:33,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:49:33,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:49:33,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:49:33,087 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 7 states. [2018-01-29 22:49:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:33,222 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-01-29 22:49:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:49:33,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-29 22:49:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:33,225 INFO L225 Difference]: With dead ends: 77 [2018-01-29 22:49:33,225 INFO L226 Difference]: Without dead ends: 76 [2018-01-29 22:49:33,225 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:49:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-29 22:49:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-01-29 22:49:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-29 22:49:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-29 22:49:33,231 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 32 [2018-01-29 22:49:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:33,231 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-29 22:49:33,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:49:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-29 22:49:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 22:49:33,232 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:33,232 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:33,233 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1294330367, now seen corresponding path program 1 times [2018-01-29 22:49:33,233 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:33,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:33,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:33,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:33,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:33,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:33,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:33,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:49:33,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:49:33,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:49:33,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:49:33,419 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 10 states. [2018-01-29 22:49:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:33,659 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-01-29 22:49:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:49:33,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-01-29 22:49:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:33,661 INFO L225 Difference]: With dead ends: 88 [2018-01-29 22:49:33,661 INFO L226 Difference]: Without dead ends: 87 [2018-01-29 22:49:33,662 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:49:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-29 22:49:33,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-01-29 22:49:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-29 22:49:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-29 22:49:33,670 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 32 [2018-01-29 22:49:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:33,671 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-29 22:49:33,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:49:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-29 22:49:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 22:49:33,672 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:33,672 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:33,673 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1469535671, now seen corresponding path program 1 times [2018-01-29 22:49:33,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:33,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:33,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:33,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:33,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:33,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:33,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:33,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:49:33,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:49:33,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:49:33,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:49:33,810 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 10 states. [2018-01-29 22:49:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:33,985 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-01-29 22:49:33,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:49:33,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-29 22:49:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:33,986 INFO L225 Difference]: With dead ends: 90 [2018-01-29 22:49:33,986 INFO L226 Difference]: Without dead ends: 89 [2018-01-29 22:49:33,987 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:49:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-29 22:49:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-01-29 22:49:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-29 22:49:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-29 22:49:33,992 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 33 [2018-01-29 22:49:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:33,992 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-29 22:49:33,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:49:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-29 22:49:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 22:49:33,993 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:33,993 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:33,993 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:33,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1469535672, now seen corresponding path program 1 times [2018-01-29 22:49:33,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:33,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:33,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:33,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:33,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:34,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:34,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:34,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:49:34,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:49:34,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:49:34,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:49:34,114 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 10 states. [2018-01-29 22:49:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:34,325 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-29 22:49:34,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:49:34,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-29 22:49:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:34,327 INFO L225 Difference]: With dead ends: 83 [2018-01-29 22:49:34,327 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 22:49:34,328 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:49:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 22:49:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-01-29 22:49:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-29 22:49:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-29 22:49:34,336 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 33 [2018-01-29 22:49:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:34,338 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-29 22:49:34,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:49:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-29 22:49:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 22:49:34,339 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:34,339 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:34,339 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1068027822, now seen corresponding path program 1 times [2018-01-29 22:49:34,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:34,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:34,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:34,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:34,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:34,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:34,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:34,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:49:34,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:49:34,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:49:34,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:49:34,455 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-01-29 22:49:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:34,593 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-01-29 22:49:34,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:49:34,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-29 22:49:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:34,594 INFO L225 Difference]: With dead ends: 79 [2018-01-29 22:49:34,594 INFO L226 Difference]: Without dead ends: 66 [2018-01-29 22:49:34,595 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:49:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-29 22:49:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-29 22:49:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-29 22:49:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-01-29 22:49:34,631 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 34 [2018-01-29 22:49:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:34,631 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-01-29 22:49:34,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:49:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-01-29 22:49:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 22:49:34,633 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:34,633 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:34,633 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 391014051, now seen corresponding path program 1 times [2018-01-29 22:49:34,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:34,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:34,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:34,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:34,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:34,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:34,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-29 22:49:34,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:34,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:49:34,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:49:34,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:49:34,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:49:34,728 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 5 states. [2018-01-29 22:49:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:34,954 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-01-29 22:49:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:49:34,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-01-29 22:49:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:34,955 INFO L225 Difference]: With dead ends: 66 [2018-01-29 22:49:34,955 INFO L226 Difference]: Without dead ends: 65 [2018-01-29 22:49:34,955 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:49:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-29 22:49:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-29 22:49:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-29 22:49:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-01-29 22:49:34,962 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 45 [2018-01-29 22:49:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:34,962 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-01-29 22:49:34,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:49:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-01-29 22:49:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 22:49:34,964 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:34,964 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:34,964 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:34,965 INFO L82 PathProgramCache]: Analyzing trace with hash 391014052, now seen corresponding path program 1 times [2018-01-29 22:49:34,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:34,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:34,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:34,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:34,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:34,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:35,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:49:35,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-29 22:49:35,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 22:49:35,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 22:49:35,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-29 22:49:35,294 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 16 states. [2018-01-29 22:49:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:35,711 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-01-29 22:49:35,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 22:49:35,711 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-01-29 22:49:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:35,712 INFO L225 Difference]: With dead ends: 84 [2018-01-29 22:49:35,712 INFO L226 Difference]: Without dead ends: 83 [2018-01-29 22:49:35,712 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:49:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-29 22:49:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2018-01-29 22:49:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-29 22:49:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-29 22:49:35,718 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 45 [2018-01-29 22:49:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:35,718 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-29 22:49:35,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 22:49:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-29 22:49:35,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 22:49:35,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:35,719 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:35,719 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash -730540225, now seen corresponding path program 1 times [2018-01-29 22:49:35,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:35,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:35,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:35,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:35,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:35,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:35,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:49:35,963 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:49:35,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:36,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:49:36,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:49:36,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:49:36,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:36,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:36,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:49:36,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:49:36,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 22:49:36,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:49:36,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:49:36,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:49:36,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:49:36,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-29 22:49:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:36,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:49:36,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-29 22:49:36,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:49:36,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:49:36,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:49:36,444 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 21 states. [2018-01-29 22:49:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:37,276 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-29 22:49:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 22:49:37,277 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-01-29 22:49:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:37,278 INFO L225 Difference]: With dead ends: 98 [2018-01-29 22:49:37,278 INFO L226 Difference]: Without dead ends: 97 [2018-01-29 22:49:37,279 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 22:49:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-29 22:49:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2018-01-29 22:49:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 22:49:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-01-29 22:49:37,290 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 47 [2018-01-29 22:49:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:37,290 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-01-29 22:49:37,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:49:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-01-29 22:49:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-29 22:49:37,292 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:37,292 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:37,292 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1171910536, now seen corresponding path program 1 times [2018-01-29 22:49:37,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:37,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:37,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:37,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:37,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:37,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:37,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:49:37,628 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:49:37,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:37,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:49:37,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:37,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:37,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:37,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:37,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:37,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:49:37,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:37,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:37,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:49:37,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:37,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:49:37,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:37,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:37,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:49:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:38,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:49:38,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-01-29 22:49:38,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 22:49:38,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 22:49:38,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2018-01-29 22:49:38,053 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 30 states. [2018-01-29 22:49:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:38,877 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-29 22:49:38,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 22:49:38,878 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-01-29 22:49:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:38,878 INFO L225 Difference]: With dead ends: 95 [2018-01-29 22:49:38,878 INFO L226 Difference]: Without dead ends: 94 [2018-01-29 22:49:38,879 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=1730, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 22:49:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-29 22:49:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-01-29 22:49:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-29 22:49:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-29 22:49:38,886 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 48 [2018-01-29 22:49:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:38,886 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-29 22:49:38,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 22:49:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-29 22:49:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:49:38,887 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:38,887 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:38,887 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash -187950407, now seen corresponding path program 1 times [2018-01-29 22:49:38,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:38,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:38,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:38,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:38,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:38,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:39,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:49:39,241 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:49:39,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:39,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:49:39,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:39,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:39,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:39,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:39,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:39,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:49:39,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:39,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:39,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:49:39,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:39,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:49:39,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:39,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:39,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:49:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:39,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:49:39,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2018-01-29 22:49:39,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 22:49:39,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 22:49:39,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:49:39,656 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 29 states. [2018-01-29 22:49:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:41,121 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-01-29 22:49:41,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 22:49:41,122 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-01-29 22:49:41,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:41,122 INFO L225 Difference]: With dead ends: 111 [2018-01-29 22:49:41,122 INFO L226 Difference]: Without dead ends: 80 [2018-01-29 22:49:41,123 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=327, Invalid=2643, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 22:49:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-29 22:49:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-29 22:49:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-29 22:49:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-01-29 22:49:41,130 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 54 [2018-01-29 22:49:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:41,130 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-01-29 22:49:41,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 22:49:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-01-29 22:49:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 22:49:41,131 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:41,131 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:41,131 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:41,131 INFO L82 PathProgramCache]: Analyzing trace with hash 702218596, now seen corresponding path program 1 times [2018-01-29 22:49:41,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:41,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:41,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:41,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:41,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:41,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:41,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:49:41,491 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:49:41,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:41,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:49:41,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:41,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:41,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:41,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:41,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:41,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:49:41,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:41,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:49:41,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:41,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:41,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:41,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:49:41,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:41,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:41,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:49:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:41,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:49:41,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2018-01-29 22:49:41,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 22:49:41,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 22:49:41,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:49:41,959 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 29 states. [2018-01-29 22:49:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:43,472 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-29 22:49:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 22:49:43,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-01-29 22:49:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:43,473 INFO L225 Difference]: With dead ends: 108 [2018-01-29 22:49:43,473 INFO L226 Difference]: Without dead ends: 107 [2018-01-29 22:49:43,474 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=363, Invalid=3059, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 22:49:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-29 22:49:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2018-01-29 22:49:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-29 22:49:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-01-29 22:49:43,478 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 60 [2018-01-29 22:49:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:43,478 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-01-29 22:49:43,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 22:49:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-01-29 22:49:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-29 22:49:43,480 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:43,480 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:43,480 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1984283135, now seen corresponding path program 2 times [2018-01-29 22:49:43,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:43,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:43,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:43,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:43,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:43,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:44,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:49:44,081 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:49:44,086 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:49:44,100 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:49:44,106 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:49:44,109 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:49:44,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:49:44,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:44,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:49:44,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:44,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:44,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:44,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:49:44,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:49:44,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:49:44,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 13 treesize of output 12 [2018-01-29 22:49:44,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:49:44,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:49:44,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-29 22:49:44,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:49:44,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:44,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:49:44,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-29 22:49:44,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 22:49:44,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-29 22:49:44,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:49:44,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:49:44,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:49:44,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:49:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:44,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:49:44,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-01-29 22:49:44,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 22:49:44,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 22:49:44,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 22:49:44,903 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 38 states. [2018-01-29 22:49:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:46,719 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-29 22:49:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 22:49:46,720 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 62 [2018-01-29 22:49:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:46,720 INFO L225 Difference]: With dead ends: 113 [2018-01-29 22:49:46,720 INFO L226 Difference]: Without dead ends: 112 [2018-01-29 22:49:46,721 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=311, Invalid=3229, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 22:49:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-29 22:49:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-29 22:49:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-29 22:49:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-01-29 22:49:46,727 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 62 [2018-01-29 22:49:46,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:46,728 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-01-29 22:49:46,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 22:49:46,728 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-01-29 22:49:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-29 22:49:46,729 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:46,729 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:46,729 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:46,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1383235000, now seen corresponding path program 2 times [2018-01-29 22:49:46,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:46,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:46,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:46,730 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:49:46,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:46,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:47,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:49:47,201 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:49:47,206 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:49:47,220 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:49:47,228 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:49:47,235 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:49:47,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:49:47,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:47,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:47,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:47,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:47,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:47,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:49:47,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:47,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:47,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:49:47,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:47,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:49:47,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:47,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:47,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:49:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:47,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:49:47,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2018-01-29 22:49:47,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 22:49:47,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 22:49:47,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:49:47,609 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 29 states. [2018-01-29 22:49:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:48,931 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-01-29 22:49:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 22:49:48,931 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-01-29 22:49:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:48,932 INFO L225 Difference]: With dead ends: 112 [2018-01-29 22:49:48,932 INFO L226 Difference]: Without dead ends: 111 [2018-01-29 22:49:48,932 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=2737, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 22:49:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-29 22:49:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2018-01-29 22:49:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-29 22:49:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-01-29 22:49:48,938 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 63 [2018-01-29 22:49:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:48,938 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-01-29 22:49:48,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 22:49:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-01-29 22:49:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 22:49:48,939 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:48,939 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:48,939 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:48,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1692506105, now seen corresponding path program 1 times [2018-01-29 22:49:48,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:48,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:48,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:48,940 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:49:48,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:48,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-29 22:49:49,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:49:49,493 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:49:49,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:49,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:49:49,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:49,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:49,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:49,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:49,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:49,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:49:49,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:49,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:49,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:49:49,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:49,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:49:49,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:49,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:49,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:49:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:49:49,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:49:49,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 33 [2018-01-29 22:49:49,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 22:49:49,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 22:49:49,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 22:49:49,948 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 34 states. [2018-01-29 22:49:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:51,983 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-01-29 22:49:51,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-29 22:49:51,984 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 69 [2018-01-29 22:49:51,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:51,984 INFO L225 Difference]: With dead ends: 122 [2018-01-29 22:49:51,984 INFO L226 Difference]: Without dead ends: 80 [2018-01-29 22:49:51,986 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=531, Invalid=4871, Unknown=0, NotChecked=0, Total=5402 [2018-01-29 22:49:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-29 22:49:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-29 22:49:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-29 22:49:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-01-29 22:49:51,992 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 69 [2018-01-29 22:49:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:51,992 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-01-29 22:49:51,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 22:49:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-01-29 22:49:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-29 22:49:51,993 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:49:51,993 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:49:51,993 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:49:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2091515711, now seen corresponding path program 3 times [2018-01-29 22:49:51,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:49:51,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:49:51,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:51,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:49:51,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:49:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:49:52,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:49:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:49:52,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:49:52,843 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:49:52,849 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:49:52,862 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:49:52,866 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:49:52,871 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:49:52,877 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:49:52,880 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:49:52,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:49:52,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:52,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:52,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:52,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:49:52,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:52,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:49:52,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:49:52,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:52,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:49:52,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:52,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:52,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:49:52,907 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-29 22:49:52,908 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-29 22:49:52,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:52,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:52,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:52,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-29 22:49:53,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 22:49:53,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:49:53,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:53,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:53,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:53,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-29 22:49:53,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 22:49:53,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:49:53,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:49:53,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:49:53,090 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-29 22:49:53,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-01-29 22:49:53,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-29 22:49:53,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-29 22:49:53,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:49:53,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:49:53,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:49:53,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-29 22:49:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:49:53,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:49:53,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 30 [2018-01-29 22:49:53,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 22:49:53,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 22:49:53,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-01-29 22:49:53,240 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 31 states. [2018-01-29 22:49:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:49:54,291 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-01-29 22:49:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:49:54,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 77 [2018-01-29 22:49:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:49:54,292 INFO L225 Difference]: With dead ends: 80 [2018-01-29 22:49:54,292 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:49:54,293 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 15 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=2301, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 22:49:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:49:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:49:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:49:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:49:54,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-01-29 22:49:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:49:54,294 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:49:54,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 22:49:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:49:54,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:49:54,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:49:54,485 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-29 22:49:54,516 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 93 DAG size of output 89 [2018-01-29 22:49:55,588 WARN L146 SmtUtils]: Spent 1063ms on a formula simplification. DAG size of input: 207 DAG size of output 146 [2018-01-29 22:49:55,863 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 127 DAG size of output 83 [2018-01-29 22:49:55,957 INFO L399 ceAbstractionStarter]: For program point L547'''''''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,958 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-01-29 22:49:55,958 INFO L399 ceAbstractionStarter]: For program point L546(lines 546 552) no Hoare annotation was computed. [2018-01-29 22:49:55,958 INFO L395 ceAbstractionStarter]: At program point cstrncpyENTRY(lines 540 555) the Hoare annotation is: (let ((.cse0 (select |#length| |cstrncpy_#in~dst.base|))) (or (exists ((main_~nondetString~6.offset Int)) (and (= (select (select |#memory_int| |cstrncpy_#in~src.base|) (+ main_~nondetString~6.offset (select |#length| |cstrncpy_#in~src.base|) (- 1))) 0) (<= 0 main_~nondetString~6.offset) (<= main_~nondetString~6.offset 0))) (< .cse0 |cstrncpy_#in~n|) (not (= 0 |cstrncpy_#in~dst.offset|)) (< .cse0 1) (not (= 1 (select |#valid| |cstrncpy_#in~dst.base|))) (< |cstrncpy_#in~n| .cse0) (not (exists ((main_~nondetString~6.offset Int)) (and (<= 0 main_~nondetString~6.offset) (<= main_~nondetString~6.offset 0) (= (select (select |old(#memory_int)| |cstrncpy_#in~src.base|) (+ main_~nondetString~6.offset (select |#length| |cstrncpy_#in~src.base|) (- 1))) 0)))) (not (= 0 |cstrncpy_#in~src.offset|)) (= |cstrncpy_#in~src.base| |cstrncpy_#in~dst.base|) (not (= 1 (select |#valid| |cstrncpy_#in~src.base|))) (not (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~6) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |#length| |cstrncpy_#in~src.base|)) (= (select (select |old(#memory_int)| |cstrncpy_#in~src.base|) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1))) 0) (<= |cstrncpy_#in~src.offset| v_main_~nondetString~6.offset_BEFORE_CALL_1)))))) [2018-01-29 22:49:55,958 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 22:49:55,958 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 22:49:55,958 INFO L399 ceAbstractionStarter]: For program point L543(lines 543 553) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point L548(lines 548 549) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point cstrncpyFINAL(lines 540 555) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr1RequiresViolation(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point L549'''(line 549) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point L546'(lines 546 552) no Hoare annotation was computed. [2018-01-29 22:49:55,959 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr3RequiresViolation(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point L543'(lines 543 553) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr0RequiresViolation(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point L547''''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,960 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr5RequiresViolation(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,961 INFO L395 ceAbstractionStarter]: At program point L548''''''(lines 548 549) the Hoare annotation is: (let ((.cse0 (select |#length| |cstrncpy_#in~dst.base|))) (or (< .cse0 |cstrncpy_#in~n|) (not (= 0 |cstrncpy_#in~dst.offset|)) (< .cse0 1) (not (= 1 (select |#valid| |cstrncpy_#in~dst.base|))) (< |cstrncpy_#in~n| .cse0) (not (exists ((main_~nondetString~6.offset Int)) (and (<= 0 main_~nondetString~6.offset) (<= main_~nondetString~6.offset 0) (= (select (select |old(#memory_int)| |cstrncpy_#in~src.base|) (+ main_~nondetString~6.offset (select |#length| |cstrncpy_#in~src.base|) (- 1))) 0)))) (not (= 0 |cstrncpy_#in~src.offset|)) (let ((.cse2 (+ (select |#length| cstrncpy_~d~3.base) 1)) (.cse1 (+ cstrncpy_~d~3.offset cstrncpy_~n))) (and (= 1 (select |#valid| cstrncpy_~s~3.base)) (<= 1 (select |#length| cstrncpy_~src.base)) (<= .cse1 .cse2) (<= .cse2 .cse1) (<= 1 cstrncpy_~d~3.offset) (= 1 (select |#valid| cstrncpy_~d~3.base)) (<= 1 cstrncpy_~n) (= |cstrncpy_#in~n| (select |#length| cstrncpy_~dst.base)) (= 1 (select |#valid| cstrncpy_~src.base)) (= 1 (select |#valid| cstrncpy_~dst.base)) (= 0 cstrncpy_~src.offset) (= 0 cstrncpy_~dst.offset))) (= |cstrncpy_#in~src.base| |cstrncpy_#in~dst.base|) (not (= 1 (select |#valid| |cstrncpy_#in~src.base|))) (not (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~6) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |#length| |cstrncpy_#in~src.base|)) (= (select (select |old(#memory_int)| |cstrncpy_#in~src.base|) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1))) 0) (<= |cstrncpy_#in~src.offset| v_main_~nondetString~6.offset_BEFORE_CALL_1)))))) [2018-01-29 22:49:55,961 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,961 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-29 22:49:55,961 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr2RequiresViolation(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,961 INFO L399 ceAbstractionStarter]: For program point L547'''''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,961 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 555) no Hoare annotation was computed. [2018-01-29 22:49:55,961 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-29 22:49:55,962 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-29 22:49:55,962 INFO L399 ceAbstractionStarter]: For program point cstrncpyEXIT(lines 540 555) no Hoare annotation was computed. [2018-01-29 22:49:55,962 INFO L399 ceAbstractionStarter]: For program point L547'''''''''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,962 INFO L399 ceAbstractionStarter]: For program point L547''''''''''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,962 INFO L399 ceAbstractionStarter]: For program point L547''''''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,963 INFO L395 ceAbstractionStarter]: At program point L546'''(lines 546 552) the Hoare annotation is: (let ((.cse11 (select |#length| cstrncpy_~dst.base)) (.cse21 (select |#length| cstrncpy_~src.base)) (.cse14 (select |#length| cstrncpy_~s~3.base))) (let ((.cse0 (select |#length| |cstrncpy_#in~dst.base|)) (.cse6 (exists ((main_~nondetString~6.offset Int)) (and (= (select (select |#memory_int| cstrncpy_~s~3.base) (+ main_~nondetString~6.offset (select |#length| cstrncpy_~s~3.base) (- 1))) 0) (<= 0 main_~nondetString~6.offset) (<= main_~nondetString~6.offset 0)))) (.cse15 (<= (+ cstrncpy_~s~3.offset 1) .cse14)) (.cse16 (not (= cstrncpy_~dst.base cstrncpy_~src.base))) (.cse1 (= 1 (select |#valid| cstrncpy_~s~3.base))) (.cse17 (<= 1 .cse21)) (.cse2 (= 1 (select |#valid| cstrncpy_~d~3.base))) (.cse5 (= |cstrncpy_#in~n| .cse11)) (.cse7 (not (= cstrncpy_~d~3.base cstrncpy_~s~3.base))) (.cse8 (= 1 (select |#valid| cstrncpy_~src.base))) (.cse3 (not (= cstrncpy_~d~3.base cstrncpy_~src.base))) (.cse9 (= 1 (select |#valid| cstrncpy_~dst.base))) (.cse19 (<= 1 cstrncpy_~s~3.offset)) (.cse10 (select |#length| cstrncpy_~d~3.base)) (.cse12 (= 0 cstrncpy_~src.offset)) (.cse13 (= 0 (select (select |#memory_int| cstrncpy_~src.base) (+ .cse21 (- 1))))) (.cse4 (= 0 cstrncpy_~dst.offset))) (or (< .cse0 |cstrncpy_#in~n|) (not (= 0 |cstrncpy_#in~dst.offset|)) (< .cse0 1) (not (= 1 (select |#valid| |cstrncpy_#in~dst.base|))) (< |cstrncpy_#in~n| .cse0) (not (exists ((main_~nondetString~6.offset Int)) (and (<= 0 main_~nondetString~6.offset) (<= main_~nondetString~6.offset 0) (= (select (select |old(#memory_int)| |cstrncpy_#in~src.base|) (+ main_~nondetString~6.offset (select |#length| |cstrncpy_#in~src.base|) (- 1))) 0)))) (not (= 0 |cstrncpy_#in~src.offset|)) (and .cse1 (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= cstrncpy_~src.offset v_main_~nondetString~6.offset_BEFORE_CALL_1) (<= 1 main_~length~6) (= 0 (select (select |#memory_int| cstrncpy_~src.base) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1)))) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |#length| cstrncpy_~src.base)))) .cse2 .cse3 (= 0 cstrncpy_~s~3.offset) (= 0 cstrncpy_~d~3.offset) .cse4 (not (= |cstrncpy_#in~src.base| cstrncpy_~dst.base)) (not (= cstrncpy_~src.base cstrncpy_~dst.base)) (exists ((main_~nondetString~6.offset Int)) (and (= (select (select |#memory_int| |cstrncpy_#in~src.base|) (+ main_~nondetString~6.offset (select |#length| |cstrncpy_#in~src.base|) (- 1))) 0) (<= 0 main_~nondetString~6.offset) (<= main_~nondetString~6.offset 0))) .cse5 .cse6 .cse7 .cse8 .cse9 (= cstrncpy_~n .cse10) (= .cse11 cstrncpy_~n) .cse12 .cse13 (<= 1 .cse14)) (let ((.cse18 (+ cstrncpy_~n 1))) (and .cse15 (not (= (mod (+ .cse10 4294967295) 4294967296) 0)) .cse16 .cse1 .cse17 .cse2 (or (<= cstrncpy_~s~3.offset 1) (<= (+ cstrncpy_~s~3.offset 2) .cse14)) (<= .cse10 .cse18) .cse5 (= cstrncpy_~d~3.offset 1) .cse6 (<= 1 .cse10) .cse7 .cse8 .cse3 .cse9 (<= .cse18 .cse10) .cse19 .cse12 .cse13 .cse4)) (= |cstrncpy_#in~src.base| |cstrncpy_#in~dst.base|) (let ((.cse20 (+ cstrncpy_~d~3.offset cstrncpy_~n))) (and .cse15 (<= .cse10 .cse20) (<= 2 cstrncpy_~d~3.offset) .cse16 .cse1 .cse17 .cse2 (= 0 (select (select |#memory_int| cstrncpy_~s~3.base) (+ .cse14 (- 1)))) .cse5 (<= (+ cstrncpy_~d~3.offset 1) .cse10) .cse7 .cse8 .cse3 .cse9 .cse19 (<= .cse20 .cse10) .cse12 .cse13 .cse4)) (not (= 1 (select |#valid| |cstrncpy_#in~src.base|))) (not (exists ((main_~length~6 Int) (v_main_~nondetString~6.offset_BEFORE_CALL_1 Int)) (and (<= 1 main_~length~6) (<= (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1) (select |#length| |cstrncpy_#in~src.base|)) (= (select (select |old(#memory_int)| |cstrncpy_#in~src.base|) (+ main_~length~6 v_main_~nondetString~6.offset_BEFORE_CALL_1 (- 1))) 0) (<= |cstrncpy_#in~src.offset| v_main_~nondetString~6.offset_BEFORE_CALL_1))))))) [2018-01-29 22:49:55,963 INFO L399 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,963 INFO L399 ceAbstractionStarter]: For program point L548''(lines 548 549) no Hoare annotation was computed. [2018-01-29 22:49:55,963 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-29 22:49:55,963 INFO L399 ceAbstractionStarter]: For program point cstrncpyErr4RequiresViolation(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,963 INFO L399 ceAbstractionStarter]: For program point L547''''''''''(line 547) no Hoare annotation was computed. [2018-01-29 22:49:55,963 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,963 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,963 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 570) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:49:55,963 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,964 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 570) the Hoare annotation is: true [2018-01-29 22:49:55,964 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,964 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 570) the Hoare annotation is: true [2018-01-29 22:49:55,964 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,964 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-29 22:49:55,964 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,964 INFO L399 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-29 22:49:55,964 INFO L399 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-29 22:49:55,964 INFO L399 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 556 570) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 570) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point L559''(lines 559 561) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point L566'(line 566) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-29 22:49:55,965 INFO L399 ceAbstractionStarter]: For program point L566'''(line 566) no Hoare annotation was computed. [2018-01-29 22:49:55,966 INFO L399 ceAbstractionStarter]: For program point L562'(lines 562 564) no Hoare annotation was computed. [2018-01-29 22:49:55,966 INFO L399 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-29 22:49:55,966 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 556 570) no Hoare annotation was computed. [2018-01-29 22:49:55,966 INFO L399 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2018-01-29 22:49:55,966 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-29 22:49:55,966 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 556 570) no Hoare annotation was computed. [2018-01-29 22:49:55,966 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 556 570) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:49:55,966 INFO L399 ceAbstractionStarter]: For program point L565'(line 565) no Hoare annotation was computed. [2018-01-29 22:49:55,967 INFO L395 ceAbstractionStarter]: At program point L567'(line 567) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString~6.base))) (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc10.offset|) (= main_~length~6 .cse0) (= 0 |main_#t~malloc11.offset|) (exists ((main_~length~6 Int)) (and (<= (+ main_~nondetString~6.offset main_~length~6) (select |#length| main_~nondetString~6.base)) (<= 1 main_~length~6) (= 0 (select (select |#memory_int| main_~nondetString~6.base) (+ main_~nondetString~6.offset main_~length~6 (- 1)))))) (<= 1 main_~n~6) (not (= |main_#t~malloc11.base| |main_#t~malloc10.base|)) (= (store (store |#valid| |main_#t~malloc10.base| (select (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc10.base|)) |main_#t~malloc11.base| 0) |old(#valid)|) (= 0 main_~nondetArea~6.offset) (= 1 (select |#valid| main_~nondetArea~6.base)) (not (= |main_#t~malloc11.base| main_~nondetArea~6.base)) (= main_~length~6 (select |#length| |main_#t~malloc11.base|)) (= main_~n~6 (select |#length| |main_#t~malloc10.base|)) (= 0 main_~nondetString~6.offset) (= 1 (select |#valid| |main_#t~malloc11.base|)) (not (= main_~nondetArea~6.base main_~nondetString~6.base)) (= 0 (select (select |#memory_int| main_~nondetString~6.base) (+ main_~nondetString~6.offset (+ .cse0 (- 1))))) (= 1 (select |#valid| main_~nondetString~6.base)) (= (select |#length| main_~nondetArea~6.base) main_~n~6))) [2018-01-29 22:49:55,967 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-29 22:49:55,967 INFO L399 ceAbstractionStarter]: For program point L565''(line 565) no Hoare annotation was computed. [2018-01-29 22:49:55,967 INFO L399 ceAbstractionStarter]: For program point L566''(line 566) no Hoare annotation was computed. [2018-01-29 22:49:55,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:55,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:55,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:55,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:55,981 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:55,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:55,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,982 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,983 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,983 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,983 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:55,986 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:55,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:55,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:55,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:55,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:55,988 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:55,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,991 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,993 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,995 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,995 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,995 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,996 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,996 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,996 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,996 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,997 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,998 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:55,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:55,999 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,000 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,013 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,014 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,014 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,015 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,016 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,017 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,017 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,018 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,019 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,019 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,019 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,020 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,021 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,022 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,023 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,024 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,025 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,025 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,025 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,025 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,025 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,025 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,025 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,026 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,026 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,026 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,026 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,026 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,026 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,029 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,030 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,031 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,032 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,033 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,034 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,036 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,037 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,038 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,038 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,039 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,040 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,041 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:49:56 BoogieIcfgContainer [2018-01-29 22:49:56,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:49:56,044 INFO L168 Benchmark]: Toolchain (without parser) took 24341.22 ms. Allocated memory was 304.1 MB in the beginning and 679.5 MB in the end (delta: 375.4 MB). Free memory was 260.8 MB in the beginning and 570.2 MB in the end (delta: -309.3 MB). Peak memory consumption was 332.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:56,045 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 304.1 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:49:56,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.57 ms. Allocated memory is still 304.1 MB. Free memory was 260.8 MB in the beginning and 250.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:56,046 INFO L168 Benchmark]: Boogie Preprocessor took 28.12 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:56,046 INFO L168 Benchmark]: RCFGBuilder took 275.65 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 227.9 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:56,047 INFO L168 Benchmark]: TraceAbstraction took 23828.39 ms. Allocated memory was 304.1 MB in the beginning and 679.5 MB in the end (delta: 375.4 MB). Free memory was 225.9 MB in the beginning and 570.2 MB in the end (delta: -344.2 MB). Peak memory consumption was 297.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:56,048 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.12 ms. Allocated memory is still 304.1 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.57 ms. Allocated memory is still 304.1 MB. Free memory was 260.8 MB in the beginning and 250.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.12 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 248.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.65 ms. Allocated memory is still 304.1 MB. Free memory was 248.9 MB in the beginning and 227.9 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 23828.39 ms. Allocated memory was 304.1 MB in the beginning and 679.5 MB in the end (delta: 375.4 MB). Free memory was 225.9 MB in the beginning and 570.2 MB in the end (delta: -344.2 MB). Peak memory consumption was 297.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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 #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 #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #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: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 546]: Loop Invariant [2018-01-29 22:49:56,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,060 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,061 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,062 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,063 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,065 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,067 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,068 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,069 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,070 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,071 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,072 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,073 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,074 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,074 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,074 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,074 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,074 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,080 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,082 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,083 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,083 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,084 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,084 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,084 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,085 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,088 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,089 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,089 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,089 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,089 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,089 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,090 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,090 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,090 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,090 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,091 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,092 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,093 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((((unknown-#length-unknown[dst] < \old(n) || !(0 == dst)) || unknown-#length-unknown[dst] < 1) || !(1 == \valid[dst])) || \old(n) < unknown-#length-unknown[dst]) || !(\exists main_~nondetString~6.offset : int :: (0 <= main_~nondetString~6.offset && main_~nondetString~6.offset <= 0) && \old(unknown-#memory_int-unknown)[src][main_~nondetString~6.offset + unknown-#length-unknown[src] + -1] == 0)) || !(0 == src)) || (((((((((((((((((((1 == \valid[s] && (\exists main_~length~6 : int, v_main_~nondetString~6.offset_BEFORE_CALL_1 : int :: ((src <= v_main_~nondetString~6.offset_BEFORE_CALL_1 && 1 <= main_~length~6) && 0 == unknown-#memory_int-unknown[src][main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 + -1]) && main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 <= unknown-#length-unknown[src])) && 1 == \valid[d]) && !(d == src)) && 0 == s) && 0 == d) && 0 == dst) && !(src == dst)) && !(src == dst)) && (\exists main_~nondetString~6.offset : int :: (unknown-#memory_int-unknown[src][main_~nondetString~6.offset + unknown-#length-unknown[src] + -1] == 0 && 0 <= main_~nondetString~6.offset) && main_~nondetString~6.offset <= 0)) && \old(n) == unknown-#length-unknown[dst]) && (\exists main_~nondetString~6.offset : int :: (unknown-#memory_int-unknown[s][main_~nondetString~6.offset + unknown-#length-unknown[s] + -1] == 0 && 0 <= main_~nondetString~6.offset) && main_~nondetString~6.offset <= 0)) && !(d == s)) && 1 == \valid[src]) && 1 == \valid[dst]) && n == unknown-#length-unknown[d]) && unknown-#length-unknown[dst] == n) && 0 == src) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 1 <= unknown-#length-unknown[s])) || ((((((((((((((((((((s + 1 <= unknown-#length-unknown[s] && !((unknown-#length-unknown[d] + 4294967295) % 4294967296 == 0)) && !(dst == src)) && 1 == \valid[s]) && 1 <= unknown-#length-unknown[src]) && 1 == \valid[d]) && (s <= 1 || s + 2 <= unknown-#length-unknown[s])) && unknown-#length-unknown[d] <= n + 1) && \old(n) == unknown-#length-unknown[dst]) && d == 1) && (\exists main_~nondetString~6.offset : int :: (unknown-#memory_int-unknown[s][main_~nondetString~6.offset + unknown-#length-unknown[s] + -1] == 0 && 0 <= main_~nondetString~6.offset) && main_~nondetString~6.offset <= 0)) && 1 <= unknown-#length-unknown[d]) && !(d == s)) && 1 == \valid[src]) && !(d == src)) && 1 == \valid[dst]) && n + 1 <= unknown-#length-unknown[d]) && 1 <= s) && 0 == src) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 0 == dst)) || src == dst) || ((((((((((((((((((s + 1 <= unknown-#length-unknown[s] && unknown-#length-unknown[d] <= d + n) && 2 <= d) && !(dst == src)) && 1 == \valid[s]) && 1 <= unknown-#length-unknown[src]) && 1 == \valid[d]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && \old(n) == unknown-#length-unknown[dst]) && d + 1 <= unknown-#length-unknown[d]) && !(d == s)) && 1 == \valid[src]) && !(d == src)) && 1 == \valid[dst]) && 1 <= s) && d + n <= unknown-#length-unknown[d]) && 0 == src) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1]) && 0 == dst)) || !(1 == \valid[src])) || !(\exists main_~length~6 : int, v_main_~nondetString~6.offset_BEFORE_CALL_1 : int :: ((1 <= main_~length~6 && main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 <= unknown-#length-unknown[src]) && \old(unknown-#memory_int-unknown)[src][main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 + -1] == 0) && src <= v_main_~nondetString~6.offset_BEFORE_CALL_1) - InvariantResult [Line: 548]: Loop Invariant [2018-01-29 22:49:56,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,096 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,097 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,098 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,098 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,099 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,100 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,101 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString~6.offset,QUANTIFIED] [2018-01-29 22:49:56,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-29 22:49:56,102 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,103 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~6.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-29 22:49:56,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,103 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:49:56,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,104 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:49:56,105 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((((unknown-#length-unknown[dst] < \old(n) || !(0 == dst)) || unknown-#length-unknown[dst] < 1) || !(1 == \valid[dst])) || \old(n) < unknown-#length-unknown[dst]) || !(\exists main_~nondetString~6.offset : int :: (0 <= main_~nondetString~6.offset && main_~nondetString~6.offset <= 0) && \old(unknown-#memory_int-unknown)[src][main_~nondetString~6.offset + unknown-#length-unknown[src] + -1] == 0)) || !(0 == src)) || (((((((((((1 == \valid[s] && 1 <= unknown-#length-unknown[src]) && d + n <= unknown-#length-unknown[d] + 1) && unknown-#length-unknown[d] + 1 <= d + n) && 1 <= d) && 1 == \valid[d]) && 1 <= n) && \old(n) == unknown-#length-unknown[dst]) && 1 == \valid[src]) && 1 == \valid[dst]) && 0 == src) && 0 == dst)) || src == dst) || !(1 == \valid[src])) || !(\exists main_~length~6 : int, v_main_~nondetString~6.offset_BEFORE_CALL_1 : int :: ((1 <= main_~length~6 && main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 <= unknown-#length-unknown[src]) && \old(unknown-#memory_int-unknown)[src][main_~length~6 + v_main_~nondetString~6.offset_BEFORE_CALL_1 + -1] == 0) && src <= v_main_~nondetString~6.offset_BEFORE_CALL_1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 9 error locations. SAFE Result, 23.6s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 12.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 961 SDtfs, 2613 SDslu, 9004 SDs, 0 SdLazy, 5877 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 365 SyntacticMatches, 49 SemanticMatches, 510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4825 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 80 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 17 NumberOfFragments, 856 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1525 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1760 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1252 NumberOfCodeBlocks, 1252 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1227 ConstructedInterpolants, 61 QuantifiedInterpolants, 823600 SizeOfPredicates, 179 NumberOfNonLiveVariables, 1485 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 25 InterpolantComputations, 9 PerfectInterpolantSequences, 7/328 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-49-56-110.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-49-56-110.csv Received shutdown request...