java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:18:41,242 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:18:41,244 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:18:41,257 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:18:41,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:18:41,258 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:18:41,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:18:41,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:18:41,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:18:41,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:18:41,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:18:41,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:18:41,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:18:41,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:18:41,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:18:41,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:18:41,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:18:41,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:18:41,277 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:18:41,278 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:18:41,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:18:41,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:18:41,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:18:41,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:18:41,282 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:18:41,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:18:41,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:18:41,284 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:18:41,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:18:41,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:18:41,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:18:41,286 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:18:41,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:18:41,297 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:18:41,297 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:18:41,298 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:18:41,298 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:18:41,298 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:18:41,298 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:18:41,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:18:41,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:18:41,300 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:18:41,300 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:18:41,300 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:18:41,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:18:41,300 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:18:41,301 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:18:41,301 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:18:41,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:18:41,301 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:18:41,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:18:41,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:18:41,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:18:41,302 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:18:41,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:18:41,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:18:41,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:18:41,303 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:18:41,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:18:41,303 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:18:41,304 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:18:41,304 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:18:41,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:18:41,304 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:18:41,304 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:18:41,305 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:18:41,306 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:18:41,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:18:41,354 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:18:41,359 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:18:41,360 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:18:41,361 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:18:41,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:18:41,569 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:18:41,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:18:41,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:18:41,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:18:41,579 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:18:41,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d63a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41, skipping insertion in model container [2018-01-24 15:18:41,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,597 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:18:41,635 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:18:41,758 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:18:41,777 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:18:41,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41 WrapperNode [2018-01-24 15:18:41,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:18:41,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:18:41,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:18:41,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:18:41,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (1/1) ... [2018-01-24 15:18:41,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:18:41,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:18:41,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:18:41,817 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:18:41,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (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-24 15:18:41,866 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:18:41,866 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:18:41,866 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 15:18:41,866 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:18:41,866 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:18:41,866 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:18:41,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:18:41,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:18:41,867 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:18:41,867 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:18:41,867 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 15:18:41,867 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:18:41,867 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:18:41,867 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:18:42,065 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:18:42,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:18:42 BoogieIcfgContainer [2018-01-24 15:18:42,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:18:42,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:18:42,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:18:42,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:18:42,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:18:41" (1/3) ... [2018-01-24 15:18:42,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479745a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:18:42, skipping insertion in model container [2018-01-24 15:18:42,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:18:41" (2/3) ... [2018-01-24 15:18:42,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479745a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:18:42, skipping insertion in model container [2018-01-24 15:18:42,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:18:42" (3/3) ... [2018-01-24 15:18:42,071 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:18:42,078 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:18:42,087 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 15:18:42,126 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:18:42,126 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:18:42,126 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:18:42,126 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:18:42,127 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:18:42,127 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:18:42,127 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:18:42,127 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:18:42,128 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:18:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 15:18:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 15:18:42,155 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:42,155 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:42,156 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 15:18:42,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:42,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:42,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:42,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:42,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:42,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:42,319 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-24 15:18:42,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:42,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:18:42,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:42,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:18:42,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:18:42,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:18:42,343 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 15:18:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:42,446 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 15:18:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:18:42,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 15:18:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:42,518 INFO L225 Difference]: With dead ends: 57 [2018-01-24 15:18:42,519 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 15:18:42,522 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 15:18:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 15:18:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 15:18:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 15:18:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 15:18:42,554 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 15:18:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:42,554 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 15:18:42,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:18:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 15:18:42,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 15:18:42,555 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:42,555 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:42,555 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 15:18:42,556 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:42,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:42,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:42,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:42,557 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:42,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:42,603 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-24 15:18:42,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:42,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:18:42,604 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:42,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:18:42,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:18:42,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:18:42,606 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 15:18:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:42,666 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 15:18:42,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:18:42,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 15:18:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:42,667 INFO L225 Difference]: With dead ends: 40 [2018-01-24 15:18:42,667 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 15:18:42,668 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:18:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 15:18:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 15:18:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 15:18:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 15:18:42,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 15:18:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:42,675 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 15:18:42,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:18:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 15:18:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:18:42,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:42,677 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:42,677 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 15:18:42,677 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:42,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:42,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:42,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:42,679 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:42,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:42,749 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-24 15:18:42,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:42,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:18:42,750 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:42,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:18:42,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:18:42,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:18:42,751 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 15:18:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:42,862 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 15:18:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:18:42,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:18:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:42,864 INFO L225 Difference]: With dead ends: 37 [2018-01-24 15:18:42,864 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 15:18:42,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:18:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 15:18:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 15:18:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 15:18:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 15:18:42,871 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 15:18:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:42,871 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 15:18:42,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:18:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 15:18:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:18:42,872 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:42,873 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:42,873 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 15:18:42,873 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:42,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:42,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:42,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:42,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:42,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:42,986 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-24 15:18:42,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:42,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:18:42,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:42,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:18:42,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:18:42,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:18:42,987 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 15:18:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:43,030 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 15:18:43,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:18:43,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:18:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:43,031 INFO L225 Difference]: With dead ends: 36 [2018-01-24 15:18:43,032 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 15:18:43,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:18:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 15:18:43,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 15:18:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 15:18:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 15:18:43,036 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 15:18:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:43,036 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 15:18:43,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:18:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 15:18:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:18:43,037 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:43,037 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:43,037 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times [2018-01-24 15:18:43,037 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:43,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:43,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,038 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:43,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:43,078 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-24 15:18:43,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:43,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:18:43,079 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:43,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:18:43,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:18:43,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:18:43,080 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 15:18:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:43,171 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 15:18:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:18:43,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 15:18:43,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:43,172 INFO L225 Difference]: With dead ends: 35 [2018-01-24 15:18:43,173 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 15:18:43,173 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:18:43,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 15:18:43,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 15:18:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 15:18:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 15:18:43,178 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-24 15:18:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:43,179 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 15:18:43,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:18:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 15:18:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:18:43,180 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:43,180 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:43,180 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:43,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times [2018-01-24 15:18:43,180 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:43,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:43,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,182 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:43,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:43,286 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-24 15:18:43,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:43,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:18:43,287 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:43,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:18:43,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:18:43,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:18:43,287 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-24 15:18:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:43,383 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 15:18:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:18:43,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 15:18:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:43,388 INFO L225 Difference]: With dead ends: 45 [2018-01-24 15:18:43,388 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 15:18:43,389 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:18:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 15:18:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-24 15:18:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 15:18:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 15:18:43,394 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-24 15:18:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:43,394 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 15:18:43,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:18:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 15:18:43,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:18:43,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:43,395 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:43,395 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times [2018-01-24 15:18:43,395 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:43,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:43,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,397 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:43,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:43,509 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-24 15:18:43,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:43,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:18:43,509 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:43,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:18:43,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:18:43,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:18:43,510 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-24 15:18:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:43,609 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 15:18:43,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:18:43,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 15:18:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:43,611 INFO L225 Difference]: With dead ends: 36 [2018-01-24 15:18:43,611 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 15:18:43,611 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:18:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 15:18:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 15:18:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 15:18:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 15:18:43,617 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-24 15:18:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:43,618 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 15:18:43,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:18:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 15:18:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:18:43,619 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:43,619 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:43,619 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:43,619 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times [2018-01-24 15:18:43,619 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:43,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:43,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:43,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:43,729 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-24 15:18:43,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:43,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:18:43,729 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:43,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:18:43,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:18:43,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:18:43,731 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-24 15:18:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:43,900 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 15:18:43,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:18:43,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 15:18:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:43,901 INFO L225 Difference]: With dead ends: 42 [2018-01-24 15:18:43,901 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 15:18:43,901 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:18:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 15:18:43,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-24 15:18:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 15:18:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 15:18:43,906 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-24 15:18:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:43,906 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 15:18:43,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:18:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 15:18:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:18:43,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:43,908 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:43,908 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:43,908 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times [2018-01-24 15:18:43,909 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:43,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:43,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:43,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:43,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:44,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:44,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 15:18:44,048 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:44,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:18:44,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:18:44,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:18:44,050 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-01-24 15:18:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:44,149 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-01-24 15:18:44,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:18:44,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 15:18:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:44,150 INFO L225 Difference]: With dead ends: 75 [2018-01-24 15:18:44,150 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 15:18:44,151 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:18:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 15:18:44,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-01-24 15:18:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:18:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-24 15:18:44,156 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-01-24 15:18:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:44,157 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-24 15:18:44,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:18:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-24 15:18:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 15:18:44,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:44,158 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:44,158 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:44,158 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times [2018-01-24 15:18:44,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:44,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:44,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:44,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:44,159 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:44,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:44,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:44,409 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:44,410 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 15:18:44,411 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [7], [8], [15], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-24 15:18:44,459 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:18:44,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:18:47,555 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:18:47,557 INFO L268 AbstractInterpreter]: Visited 22 different actions 38 times. Merged at 6 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-24 15:18:47,578 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:18:47,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:47,579 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:18:47,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:47,591 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:47,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:47,679 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-24 15:18:47,682 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-24 15:18:47,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:47,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:47,704 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-24 15:18:47,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:18:47,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 15:18:47,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 15:18:47,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:47,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:47,866 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-24 15:18:47,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 15:18:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:47,937 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:48,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 15:18:48,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:18:48,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:18:48,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,164 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 15:18:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:48,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:48,194 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:18:48,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:48,204 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:48,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:48,260 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-24 15:18:48,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:18:48,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:18:48,305 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-24 15:18:48,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:18:48,386 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-24 15:18:48,393 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 17 [2018-01-24 15:18:48,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:48,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:48,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:48,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-24 15:18:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:48,473 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:48,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:18:48,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:18:48,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:48,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 15:18:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:48,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:48,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8, 10, 10] total 33 [2018-01-24 15:18:48,671 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:48,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 15:18:48,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 15:18:48,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 15:18:48,672 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 17 states. [2018-01-24 15:18:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:49,284 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-24 15:18:49,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:18:49,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-01-24 15:18:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:49,285 INFO L225 Difference]: With dead ends: 66 [2018-01-24 15:18:49,286 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 15:18:49,286 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 15:18:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 15:18:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-01-24 15:18:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 15:18:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 15:18:49,296 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-01-24 15:18:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:49,297 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 15:18:49,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 15:18:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 15:18:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:18:49,298 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:49,298 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:49,298 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times [2018-01-24 15:18:49,298 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:49,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:49,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:49,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:49,300 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:49,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:49,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:49,523 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:49,524 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 15:18:49,524 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [8], [10], [15], [17], [23], [24], [28], [33], [39], [44], [45], [46], [47], [48], [49], [60], [61], [62], [64] [2018-01-24 15:18:49,525 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:18:49,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:18:52,223 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:18:52,224 INFO L268 AbstractInterpreter]: Visited 22 different actions 38 times. Merged at 6 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-01-24 15:18:52,232 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:18:52,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:52,232 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:18:52,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:52,252 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:52,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:52,311 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-24 15:18:52,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:52,352 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-24 15:18:52,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:52,373 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-24 15:18:52,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 15:18:52,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:52,590 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-24 15:18:52,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:52,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:52,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:52,640 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-24 15:18:52,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:52,660 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-24 15:18:52,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 15:18:53,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:53,085 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:53,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 15:18:53,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,430 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 15:18:53,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 15:18:53,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,440 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 15:18:53,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 15:18:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:53,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:53,522 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:18:53,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:53,525 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:53,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:53,578 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-24 15:18:53,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,590 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-24 15:18:53,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,597 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-24 15:18:53,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 15:18:53,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:53,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:53,617 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-24 15:18:53,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,632 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-24 15:18:53,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:53,648 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-24 15:18:53,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-24 15:18:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:53,818 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:54,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 15:18:54,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:54,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 15:18:54,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 15:18:54,058 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:54,061 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 15:18:54,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:54,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:54,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:54,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 15:18:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:54,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:54,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 10, 11] total 42 [2018-01-24 15:18:54,074 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:54,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 15:18:54,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 15:18:54,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 15:18:54,075 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 22 states. [2018-01-24 15:18:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:54,616 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 15:18:54,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:18:54,616 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-24 15:18:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:54,617 INFO L225 Difference]: With dead ends: 64 [2018-01-24 15:18:54,618 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 15:18:54,619 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2018-01-24 15:18:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 15:18:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-01-24 15:18:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 15:18:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-24 15:18:54,627 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2018-01-24 15:18:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:54,628 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-24 15:18:54,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 15:18:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-24 15:18:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:18:54,629 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:54,629 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:54,629 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:54,630 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times [2018-01-24 15:18:54,630 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:54,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:54,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:54,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:54,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:54,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:55,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:55,005 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:55,005 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:18:55,005 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:18:55,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:55,006 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:18:55,013 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:18:55,014 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:18:55,025 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:55,032 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:55,034 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:18:55,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:55,040 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-24 15:18:55,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 15:18:55,050 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-24 15:18:55,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,060 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:55,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:55,062 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-24 15:18:55,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 15:18:55,104 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-24 15:18:55,106 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-24 15:18:55,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-24 15:18:55,196 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-24 15:18:55,199 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-24 15:18:55,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:18:55,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-24 15:18:55,245 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-24 15:18:55,252 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-24 15:18:55,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:55,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:55,264 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-24 15:18:55,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 15:18:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:55,313 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:55,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-01-24 15:18:55,636 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-24 15:18:55,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 15:18:55,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 15:18:55,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 15:18:55,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 15:18:55,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,667 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:18:55,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-01-24 15:18:55,740 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-24 15:18:55,741 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 15:18:55,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 15:18:55,759 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,760 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 15:18:55,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 15:18:55,763 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,766 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:55,779 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:18:55,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 15:18:55,836 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-01-24 15:18:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:56,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:56,041 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:18:56,044 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:18:56,045 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:18:56,058 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:56,077 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:56,110 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:18:56,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:56,117 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-24 15:18:56,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 15:18:56,125 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-24 15:18:56,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:56,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:56,131 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-24 15:18:56,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 15:18:56,163 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-24 15:18:56,165 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-24 15:18:56,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-24 15:18:56,246 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-24 15:18:56,248 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-24 15:18:56,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,259 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-24 15:18:56,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:19 [2018-01-24 15:18:56,329 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-24 15:18:56,335 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-24 15:18:56,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:56,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:56,346 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-24 15:18:56,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 15:18:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:56,349 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:56,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 15:18:56,578 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-24 15:18:56,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 15:18:56,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 15:18:56,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 15:18:56,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 15:18:56,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,611 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:56,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:18:56,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:18:56,639 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:60, output treesize:125 [2018-01-24 15:18:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:56,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:56,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13, 13, 13] total 45 [2018-01-24 15:18:56,849 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:56,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:18:56,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:18:56,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 15:18:56,850 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 21 states. [2018-01-24 15:18:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:57,613 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-24 15:18:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 15:18:57,614 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-24 15:18:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:57,614 INFO L225 Difference]: With dead ends: 63 [2018-01-24 15:18:57,614 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 15:18:57,615 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=360, Invalid=2946, Unknown=0, NotChecked=0, Total=3306 [2018-01-24 15:18:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 15:18:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-01-24 15:18:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:18:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-01-24 15:18:57,622 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2018-01-24 15:18:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:57,622 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-01-24 15:18:57,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:18:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-01-24 15:18:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:18:57,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:57,623 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:57,623 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:18:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times [2018-01-24 15:18:57,623 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:57,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:57,624 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:18:57,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:57,624 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:57,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:57,719 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-24 15:18:57,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:57,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:18:57,719 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:57,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:18:57,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:18:57,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:18:57,720 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2018-01-24 15:18:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:57,778 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-24 15:18:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:18:57,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 15:18:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:57,779 INFO L225 Difference]: With dead ends: 46 [2018-01-24 15:18:57,779 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:18:57,780 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:18:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:18:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:18:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:18:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:18:57,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 15:18:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:57,781 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:18:57,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:18:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:18:57,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:18:57,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 15:18:58,116 WARN L146 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 72 DAG size of output 55 [2018-01-24 15:18:58,589 WARN L146 SmtUtils]: Spent 470ms on a formula simplification. DAG size of input: 135 DAG size of output 110 [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-24 15:18:58,660 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 15:18:58,661 INFO L397 ceAbstractionStarter]: At program point L544'''''(line 544) the Hoare annotation is: (let ((.cse18 (select |old(#memory_int)| |cstrcpy_#in~from.base|)) (.cse19 (select |#length| |cstrcpy_#in~from.base|))) (let ((.cse0 (< (select |#length| |cstrcpy_#in~to.base|) .cse19)) (.cse1 (not (= (select .cse18 (+ |cstrcpy_#in~from.offset| .cse19 (- 1))) 0))) (.cse2 (not (= (select |#valid| |cstrcpy_#in~to.base|) 1))) (.cse3 (not (= 1 (select |#valid| |cstrcpy_#in~from.base|)))) (.cse4 (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|)) (.cse15 (not (= 0 |cstrcpy_#in~to.offset|))) (.cse16 (not (exists ((main_~length2~4 Int) (v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= |cstrcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2) (select |#length| |cstrcpy_#in~from.base|)) (<= 1 main_~length2~4) (= (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1))) 0))))) (.cse12 (<= cstrcpy_~to.offset 0)) (.cse17 (not (= 0 |cstrcpy_#in~from.offset|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse13 (select |#length| cstrcpy_~from.base)) (.cse14 (select |#length| cstrcpy_~to.base))) (let ((.cse6 (<= .cse13 .cse14)) (.cse5 (= 1 (select |#valid| cstrcpy_~from.base))) (.cse7 (= (select |#valid| cstrcpy_~to.base) 1)) (.cse8 (not (= cstrcpy_~to.base cstrcpy_~from.base))) (.cse9 (<= (+ cstrcpy_~from.offset 1) .cse13)) (.cse10 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (= (select (select |#memory_int| cstrcpy_~from.base) (+ (select |#length| cstrcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6) (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_6 1) cstrcpy_~from.offset)))) (.cse11 (<= 1 cstrcpy_~to.offset))) (or (and .cse5 (<= cstrcpy_~to.offset 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (= (select (select |#memory_int| cstrcpy_~from.base) (+ (select |#length| cstrcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 cstrcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6))) .cse5 .cse6 .cse7 (<= 0 cstrcpy_~to.offset) .cse8 (exists ((main_~length2~4 Int) (v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2) (select |#length| cstrcpy_~from.base)) (<= 1 main_~length2~4) (<= cstrcpy_~from.offset v_main_~nondetString~4.offset_BEFORE_CALL_2) (= (select (select |#memory_int| cstrcpy_~from.base) (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1))) 0))) (= cstrcpy_~from.offset 0) .cse12 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_6 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 0) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_6) (<= v_main_~nondetString~4.offset_BEFORE_CALL_6 |cstrcpy_#in~from.offset|) (= (select (select |#memory_int| |cstrcpy_#in~from.base|) (+ (select |#length| |cstrcpy_#in~from.base|) v_main_~nondetString~4.offset_BEFORE_CALL_6 (- 1))) 0)))) (and (<= (+ cstrcpy_~to.offset .cse13) (+ .cse14 cstrcpy_~from.offset)) .cse5 .cse7 .cse8 .cse9 (<= 2 cstrcpy_~from.offset) .cse10 .cse11)))) .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 (select .cse18 |cstrcpy_#in~from.offset|))) .cse15 .cse16 (and (= 0 (select (select |#memory_int| |cstrcpy_#in~from.base|) |cstrcpy_#in~from.offset|)) (= 0 (select (select |#memory_int| cstrcpy_~from.base) cstrcpy_~from.offset)) .cse12) .cse17)))) [2018-01-24 15:18:58,661 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 15:18:58,661 INFO L397 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 546) the Hoare annotation is: (let ((.cse5 (select |old(#memory_int)| |cstrcpy_#in~from.base|)) (.cse10 (select |#length| |cstrcpy_#in~from.base|))) (let ((.cse0 (< (select |#length| |cstrcpy_#in~to.base|) .cse10)) (.cse1 (not (= (select .cse5 (+ |cstrcpy_#in~from.offset| .cse10 (- 1))) 0))) (.cse2 (not (= (select |#valid| |cstrcpy_#in~to.base|) 1))) (.cse3 (not (= 1 (select |#valid| |cstrcpy_#in~from.base|)))) (.cse4 (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|)) (.cse6 (not (= 0 |cstrcpy_#in~to.offset|))) (.cse7 (not (exists ((main_~length2~4 Int) (v_main_~nondetString~4.offset_BEFORE_CALL_2 Int)) (and (<= |cstrcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_2) (<= (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2) (select |#length| |cstrcpy_#in~from.base|)) (<= 1 main_~length2~4) (= (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ main_~length2~4 v_main_~nondetString~4.offset_BEFORE_CALL_2 (- 1))) 0))))) (.cse9 (not (= 0 |cstrcpy_#in~from.offset|))) (.cse8 (select |#memory_int| |cstrcpy_#in~from.base|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 (select .cse5 |cstrcpy_#in~from.offset|))) .cse6 .cse7 (= 0 (select .cse8 |cstrcpy_#in~from.offset|)) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 (= (select .cse8 (+ .cse10 |cstrcpy_#in~from.offset| (- 1))) 0))))) [2018-01-24 15:18:58,661 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,661 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:18:58,661 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,661 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-24 15:18:58,661 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 562) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 15:18:58,662 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 562) no Hoare annotation was computed. [2018-01-24 15:18:58,663 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 15:18:58,663 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 15:18:58,663 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 562) no Hoare annotation was computed. [2018-01-24 15:18:58,663 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 15:18:58,663 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-24 15:18:58,663 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 15:18:58,663 INFO L397 ceAbstractionStarter]: At program point L559'(line 559) the Hoare annotation is: (let ((.cse1 (select |#length| |main_#t~malloc7.base|)) (.cse0 (select |#length| main_~nondetString~4.base))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= 1 (select |#valid| main_~nondetString~4.base)) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= .cse0 main_~length2~4) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ main_~nondetString~4.offset .cse0 (- 1)))) (= (select |#valid| |main_#t~malloc6.base|) 1))) [2018-01-24 15:18:58,674 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,675 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,675 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,676 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,676 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,676 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,676 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,680 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,681 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,681 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,681 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,688 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,689 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,689 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,689 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,689 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,704 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,704 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,704 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,704 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,705 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,705 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,705 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,705 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,706 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,706 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,706 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,707 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,707 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,707 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,707 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,708 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,709 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,710 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,711 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,713 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,717 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,718 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,719 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:18:58 BoogieIcfgContainer [2018-01-24 15:18:58,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:18:58,724 INFO L168 Benchmark]: Toolchain (without parser) took 17155.03 ms. Allocated memory was 302.0 MB in the beginning and 882.4 MB in the end (delta: 580.4 MB). Free memory was 259.9 MB in the beginning and 671.9 MB in the end (delta: -412.0 MB). Peak memory consumption was 168.4 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:58,725 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:18:58,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.89 ms. Allocated memory is still 302.0 MB. Free memory was 258.9 MB in the beginning and 248.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:58,726 INFO L168 Benchmark]: Boogie Preprocessor took 30.73 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:58,726 INFO L168 Benchmark]: RCFGBuilder took 249.15 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 230.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:58,726 INFO L168 Benchmark]: TraceAbstraction took 16656.90 ms. Allocated memory was 302.0 MB in the beginning and 882.4 MB in the end (delta: 580.4 MB). Free memory was 230.7 MB in the beginning and 671.9 MB in the end (delta: -441.2 MB). Peak memory consumption was 139.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:58,728 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.89 ms. Allocated memory is still 302.0 MB. Free memory was 258.9 MB in the beginning and 248.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.73 ms. Allocated memory is still 302.0 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 249.15 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 230.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 16656.90 ms. Allocated memory was 302.0 MB in the beginning and 882.4 MB in the end (delta: 580.4 MB). Free memory was 230.7 MB in the beginning and 671.9 MB in the end (delta: -441.2 MB). Peak memory consumption was 139.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 225 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 15.791189 RENAME_VARIABLES(MILLISECONDS) : 0.923283 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 15.705601 PROJECTAWAY(MILLISECONDS) : 20.229159 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.122385 DISJOIN(MILLISECONDS) : 1.216689 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.972467 ADD_EQUALITY(MILLISECONDS) : 0.025679 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015926 #CONJOIN_DISJUNCTIVE : 68 #RENAME_VARIABLES : 120 #UNFREEZE : 0 #CONJOIN : 116 #PROJECTAWAY : 92 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 113 #ADD_EQUALITY : 58 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 233 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 10.314125 RENAME_VARIABLES(MILLISECONDS) : 0.738374 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.969821 PROJECTAWAY(MILLISECONDS) : 0.081647 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.067826 DISJOIN(MILLISECONDS) : 0.754536 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.796737 ADD_EQUALITY(MILLISECONDS) : 0.020453 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012601 #CONJOIN_DISJUNCTIVE : 67 #RENAME_VARIABLES : 117 #UNFREEZE : 0 #CONJOIN : 114 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 111 #ADD_EQUALITY : 58 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 15:18:58,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,739 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,740 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,740 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,740 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,741 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,741 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,741 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,741 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,742 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,743 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,744 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,745 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,745 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,745 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,745 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,746 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,746 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,746 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,746 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,746 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,746 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,747 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,747 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,747 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,747 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,748 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,755 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,758 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,759 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,759 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,759 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,759 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,760 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,760 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,760 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,760 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_6,QUANTIFIED] [2018-01-24 15:18:58,760 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,761 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,762 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,762 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,762 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,762 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,762 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 15:18:58,763 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 15:18:58,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,763 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,764 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,765 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,766 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,767 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,768 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 15:18:58,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 15:18:58,769 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((unknown-#length-unknown[to] < unknown-#length-unknown[from] || !(\old(unknown-#memory_int-unknown)[from][from + unknown-#length-unknown[from] + -1] == 0)) || !(\valid[to] == 1)) || !(1 == \valid[from])) || from == to) || ((((((((1 == \valid[from] && to <= 1) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && v_main_~nondetString~4.offset_BEFORE_CALL_6 + 1 <= from)) && 1 <= to) || ((((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= from) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && 1 == \valid[from]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && 0 <= to) && !(to == from)) && (\exists main_~length2~4 : int, v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 <= unknown-#length-unknown[from] && 1 <= main_~length2~4) && from <= v_main_~nondetString~4.offset_BEFORE_CALL_2) && unknown-#memory_int-unknown[from][main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] == 0)) && from == 0) && to <= 0) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0 && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= from) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0))) || (((((((to + unknown-#length-unknown[from] <= unknown-#length-unknown[to] + from && 1 == \valid[from]) && \valid[to] == 1) && !(to == from)) && from + 1 <= unknown-#length-unknown[from]) && 2 <= from) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_6 : int :: ((unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_6 + -1] == 0 && v_main_~nondetString~4.offset_BEFORE_CALL_6 <= 0) && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_6) && v_main_~nondetString~4.offset_BEFORE_CALL_6 + 1 <= from)) && 1 <= to)) || !(0 == to)) || !(\exists main_~length2~4 : int, v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((from <= v_main_~nondetString~4.offset_BEFORE_CALL_2 && main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 <= unknown-#length-unknown[from]) && 1 <= main_~length2~4) && \old(unknown-#memory_int-unknown)[from][main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] == 0)) || !(0 == from)) && (((((((((unknown-#length-unknown[to] < unknown-#length-unknown[from] || !(\old(unknown-#memory_int-unknown)[from][from + unknown-#length-unknown[from] + -1] == 0)) || !(\valid[to] == 1)) || !(1 == \valid[from])) || from == to) || !(0 == \old(unknown-#memory_int-unknown)[from][from])) || !(0 == to)) || !(\exists main_~length2~4 : int, v_main_~nondetString~4.offset_BEFORE_CALL_2 : int :: ((from <= v_main_~nondetString~4.offset_BEFORE_CALL_2 && main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 <= unknown-#length-unknown[from]) && 1 <= main_~length2~4) && \old(unknown-#memory_int-unknown)[from][main_~length2~4 + v_main_~nondetString~4.offset_BEFORE_CALL_2 + -1] == 0)) || ((0 == unknown-#memory_int-unknown[from][from] && 0 == unknown-#memory_int-unknown[from][from]) && to <= 0)) || !(0 == from)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 16.5s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 369 SDtfs, 488 SDslu, 1590 SDs, 0 SdLazy, 1317 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 210 SyntacticMatches, 21 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 58 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 673 HoareAnnotationTreeSize, 9 FomulaSimplifications, 176 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 641 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 524 ConstructedInterpolants, 36 QuantifiedInterpolants, 127790 SizeOfPredicates, 81 NumberOfNonLiveVariables, 714 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 2/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-18-58-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-18-58-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-18-58-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-18-58-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-18-58-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-18-58-774.csv Received shutdown request...