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_RubberTaipan+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 12:52:10,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:52:10,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:52:10,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:52:10,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:52:10,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:52:10,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:52:10,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:52:10,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:52:10,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:52:10,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:52:10,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:52:10,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:52:10,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:52:10,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:52:10,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:52:10,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:52:10,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:52:10,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:52:10,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:52:10,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:52:10,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:52:10,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:52:10,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:52:10,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:52:10,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:52:10,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:52:10,119 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:52:10,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:52:10,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:52:10,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:52:10,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:52:10,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:52:10,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:52:10,130 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:52:10,130 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:52:10,130 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:52:10,130 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:52:10,131 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:52:10,131 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:52:10,131 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:52:10,131 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:52:10,131 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:52:10,131 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:52:10,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:52:10,132 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:52:10,132 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:52:10,132 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:52:10,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:52:10,132 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:52:10,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:52:10,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:52:10,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:52:10,133 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:52:10,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:52:10,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:52:10,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:52:10,134 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:52:10,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:52:10,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:52:10,134 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:52:10,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:52:10,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:52:10,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:52:10,135 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:52:10,135 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:52:10,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:52:10,178 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:52:10,182 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:52:10,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:52:10,184 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:52:10,184 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 12:52:10,360 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:52:10,365 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:52:10,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:52:10,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:52:10,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:52:10,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b86bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10, skipping insertion in model container [2018-01-24 12:52:10,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,388 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:52:10,424 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:52:10,543 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:52:10,561 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:52:10,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10 WrapperNode [2018-01-24 12:52:10,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:52:10,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:52:10,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:52:10,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:52:10,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (1/1) ... [2018-01-24 12:52:10,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:52:10,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:52:10,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:52:10,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:52:10,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (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 12:52:10,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:52:10,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:52:10,649 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-01-24 12:52:10,649 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:52:10,649 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:52:10,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:52:10,850 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:52:10,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:52:10 BoogieIcfgContainer [2018-01-24 12:52:10,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:52:10,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:52:10,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:52:10,854 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:52:10,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:52:10" (1/3) ... [2018-01-24 12:52:10,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3039f51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:52:10, skipping insertion in model container [2018-01-24 12:52:10,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:10" (2/3) ... [2018-01-24 12:52:10,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3039f51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:52:10, skipping insertion in model container [2018-01-24 12:52:10,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:52:10" (3/3) ... [2018-01-24 12:52:10,858 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:52:10,867 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:52:10,874 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 12:52:10,922 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:52:10,922 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:52:10,922 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:52:10,922 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:52:10,922 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:52:10,922 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:52:10,922 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:52:10,922 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:52:10,923 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:52:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 12:52:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:52:10,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:10,945 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:10,946 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-01-24 12:52:10,951 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:10,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:10,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:10,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:10,994 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:11,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:11,116 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 12:52:11,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:11,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:52:11,118 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:11,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:52:11,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:52:11,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:52:11,135 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 12:52:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:11,287 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-24 12:52:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:52:11,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 12:52:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:11,296 INFO L225 Difference]: With dead ends: 57 [2018-01-24 12:52:11,296 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 12:52:11,298 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 12:52:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 12:52:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 12:52:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 12:52:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 12:52:11,326 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-01-24 12:52:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:11,326 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 12:52:11,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:52:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 12:52:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:52:11,327 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:11,327 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:11,327 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-01-24 12:52:11,327 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:11,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:11,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,328 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:11,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:11,362 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 12:52:11,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:11,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:52:11,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:11,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:52:11,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:52:11,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:52:11,365 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-01-24 12:52:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:11,423 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 12:52:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:52:11,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 12:52:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:11,425 INFO L225 Difference]: With dead ends: 40 [2018-01-24 12:52:11,425 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 12:52:11,426 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 12:52:11,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 12:52:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 12:52:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:52:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 12:52:11,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 12:52:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:11,433 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 12:52:11,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:52:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 12:52:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:52:11,434 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:11,434 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:11,434 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-01-24 12:52:11,434 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:11,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:11,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,436 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:11,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:11,501 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 12:52:11,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:11,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:52:11,501 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:11,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:52:11,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:52:11,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:52:11,503 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 12:52:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:11,562 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 12:52:11,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:52:11,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:52:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:11,565 INFO L225 Difference]: With dead ends: 37 [2018-01-24 12:52:11,565 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:52:11,565 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 12:52:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:52:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 12:52:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:52:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:52:11,573 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 12:52:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:11,573 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:52:11,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:52:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:52:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:52:11,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:11,574 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:11,574 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-01-24 12:52:11,575 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:11,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:11,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,576 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:11,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:11,703 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 12:52:11,703 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:11,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:52:11,703 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:11,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:52:11,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:52:11,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:52:11,705 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 12:52:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:11,765 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 12:52:11,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:52:11,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:52:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:11,767 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:52:11,767 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 12:52:11,767 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 12:52:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 12:52:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 12:52:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:52:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 12:52:11,773 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 12:52:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:11,773 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 12:52:11,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:52:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 12:52:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:52:11,774 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:11,774 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 12:52:11,774 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108344, now seen corresponding path program 1 times [2018-01-24 12:52:11,775 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:11,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:11,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:11,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:11,842 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 12:52:11,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:11,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:52:11,843 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:11,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:52:11,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:52:11,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:52:11,844 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 12:52:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:11,944 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 12:52:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:52:11,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 12:52:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:11,946 INFO L225 Difference]: With dead ends: 35 [2018-01-24 12:52:11,946 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 12:52:11,946 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 12:52:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 12:52:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 12:52:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 12:52:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 12:52:11,952 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-24 12:52:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:11,952 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 12:52:11,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:52:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 12:52:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:52:11,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:11,953 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 12:52:11,953 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:11,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1121108343, now seen corresponding path program 1 times [2018-01-24 12:52:11,954 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:11,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:11,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:11,956 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:11,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:12,065 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 12:52:12,065 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:12,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:52:12,065 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:12,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:52:12,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:52:12,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:52:12,066 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-24 12:52:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:12,181 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 12:52:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:52:12,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 12:52:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:12,186 INFO L225 Difference]: With dead ends: 45 [2018-01-24 12:52:12,186 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 12:52:12,187 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 12:52:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 12:52:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-24 12:52:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:52:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:52:12,194 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-24 12:52:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:12,194 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:52:12,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:52:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:52:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:52:12,196 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:12,196 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 12:52:12,196 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash -394620318, now seen corresponding path program 1 times [2018-01-24 12:52:12,197 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:12,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:12,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,198 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:12,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:12,320 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 12:52:12,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:12,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:52:12,321 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:12,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:52:12,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:52:12,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:52:12,322 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-24 12:52:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:12,412 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 12:52:12,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:52:12,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 12:52:12,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:12,413 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:52:12,413 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 12:52:12,414 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 12:52:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 12:52:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 12:52:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:52:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 12:52:12,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-24 12:52:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:12,418 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 12:52:12,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:52:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 12:52:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:52:12,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:12,419 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 12:52:12,419 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash -394620317, now seen corresponding path program 1 times [2018-01-24 12:52:12,419 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:12,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:12,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,420 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:12,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:12,535 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 12:52:12,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:12,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:52:12,536 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:12,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:52:12,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:52:12,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:52:12,537 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-24 12:52:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:12,697 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 12:52:12,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:52:12,698 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 12:52:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:12,699 INFO L225 Difference]: With dead ends: 42 [2018-01-24 12:52:12,700 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 12:52:12,700 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 12:52:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 12:52:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-24 12:52:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:52:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:52:12,709 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-24 12:52:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:12,710 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:52:12,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:52:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:52:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:52:12,711 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:12,711 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 12:52:12,712 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash 708807622, now seen corresponding path program 1 times [2018-01-24 12:52:12,713 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:12,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:12,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,714 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:12,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:12,871 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 12:52:12,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:12,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:52:12,872 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:12,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:52:12,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:52:12,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:52:12,873 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-01-24 12:52:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:12,970 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-01-24 12:52:12,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:52:12,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 12:52:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:12,971 INFO L225 Difference]: With dead ends: 75 [2018-01-24 12:52:12,971 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 12:52:12,972 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 12:52:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 12:52:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-01-24 12:52:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 12:52:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-01-24 12:52:12,978 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-01-24 12:52:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:12,978 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-01-24 12:52:12,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:52:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-01-24 12:52:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:52:12,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:12,979 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 12:52:12,979 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -312260732, now seen corresponding path program 1 times [2018-01-24 12:52:12,980 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:12,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:12,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,981 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:12,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:13,267 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 12:52:13,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:13,267 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 12:52:13,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:13,279 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:13,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:13,377 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 12:52:13,381 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 12:52:13,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,390 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 12:52:13,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:52:13,531 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 12:52:13,559 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 12:52:13,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:13,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:13,581 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 12:52:13,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:52:13,681 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 12:52:13,681 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:13,891 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 12:52:13,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,899 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 12:52:13,910 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 12:52:13,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,918 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 12:52:13,918 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:52:13,926 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 12:52:13,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:13,947 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 12:52:13,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:13,952 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:13,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:14,002 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 12:52:14,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:52:14,066 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 12:52:14,069 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 12:52:14,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:52:14,162 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 12:52:14,174 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 12:52:14,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:14,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:14,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:14,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:31 [2018-01-24 12:52:14,239 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 12:52:14,239 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:14,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 12:52:14,307 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 12:52:14,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:52:14,366 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 12:52:14,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:52:14,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8, 10, 10] total 33 [2018-01-24 12:52:14,368 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:52:14,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:52:14,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:52:14,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 12:52:14,370 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 17 states. [2018-01-24 12:52:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:14,884 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-24 12:52:14,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:52:14,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-01-24 12:52:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:14,886 INFO L225 Difference]: With dead ends: 66 [2018-01-24 12:52:14,886 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 12:52:14,886 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 12:52:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 12:52:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-01-24 12:52:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 12:52:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 12:52:14,893 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-01-24 12:52:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:14,894 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 12:52:14,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:52:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 12:52:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:52:14,894 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:14,895 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 12:52:14,895 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1090148152, now seen corresponding path program 1 times [2018-01-24 12:52:14,895 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:14,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:14,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:14,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:14,896 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:14,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:15,183 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 12:52:15,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:15,184 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 12:52:15,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:15,191 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:15,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:15,238 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 12:52:15,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,308 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 12:52:15,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,318 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 12:52:15,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 12:52:15,364 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:15,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:15,366 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 12:52:15,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,375 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 12:52:15,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,395 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 12:52:15,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 12:52:15,535 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 12:52:15,535 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:15,813 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 12:52:15,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,819 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 12:52:15,838 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 12:52:15,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,845 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:52:15,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,861 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 12:52:15,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 12:52:15,892 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 12:52:15,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:15,912 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 12:52:15,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:15,915 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:15,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:15,952 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 12:52:15,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,974 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 12:52:15,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:15,980 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 12:52:15,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 12:52:16,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:16,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:16,035 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 12:52:16,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,048 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 12:52:16,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,057 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 12:52:16,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-24 12:52:16,242 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 12:52:16,242 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:16,478 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 12:52:16,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,482 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 12:52:16,491 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 12:52:16,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,493 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:52:16,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,500 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 12:52:16,500 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 12:52:16,505 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 12:52:16,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:52:16,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 10, 11] total 42 [2018-01-24 12:52:16,507 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:52:16,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:52:16,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:52:16,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 12:52:16,508 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 22 states. [2018-01-24 12:52:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:17,085 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 12:52:17,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:52:17,085 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-24 12:52:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:17,086 INFO L225 Difference]: With dead ends: 64 [2018-01-24 12:52:17,086 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 12:52:17,087 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2018-01-24 12:52:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 12:52:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-01-24 12:52:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:52:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-24 12:52:17,095 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 24 [2018-01-24 12:52:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:17,096 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-24 12:52:17,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:52:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-24 12:52:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:52:17,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:17,097 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 12:52:17,097 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:17,097 INFO L82 PathProgramCache]: Analyzing trace with hash -18946133, now seen corresponding path program 2 times [2018-01-24 12:52:17,097 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:17,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:17,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:17,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:17,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:17,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:17,425 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 12:52:17,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:17,426 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 12:52:17,437 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:52:17,438 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:52:17,448 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:17,452 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:17,454 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:52:17,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:17,459 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 12:52:17,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:52:17,467 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:17,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:17,468 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 12:52:17,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:52:17,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 12:52:17,507 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 12:52:17,509 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 12:52:17,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-24 12:52:17,610 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 12:52:17,617 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 12:52:17,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,631 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 12:52:17,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-24 12:52:17,667 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 12:52:17,674 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 12:52:17,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:17,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:17,687 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 12:52:17,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 12:52:17,738 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 12:52:17,738 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:18,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-01-24 12:52:18,100 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 12:52:18,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,119 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 12:52:18,122 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 12:52:18,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,126 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 12:52:18,129 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 12:52:18,129 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,133 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,147 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 12:52:18,197 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 12:52:18,217 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 12:52:18,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,234 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 12:52:18,236 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 12:52:18,236 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,238 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,239 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 12:52:18,241 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 12:52:18,242 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,244 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,259 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 12:52:18,317 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 12:52:18,317 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-01-24 12:52:18,502 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 12:52:18,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:18,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 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 12:52:18,527 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:52:18,527 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:52:18,539 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:18,558 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:18,592 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:52:18,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:18,600 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 12:52:18,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:52:18,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:52:18,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:18,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:18,613 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 12:52:18,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 12:52:18,646 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 12:52:18,647 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 12:52:18,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-24 12:52:18,730 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 12:52:18,732 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 12:52:18,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,744 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 12:52:18,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:19 [2018-01-24 12:52:18,832 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 12:52:18,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 12:52:18,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:18,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:18,941 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 12:52:18,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 12:52:18,945 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 12:52:18,945 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:19,186 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 12:52:19,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 12 treesize of output 11 [2018-01-24 12:52:19,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,212 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 12:52:19,214 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 12:52:19,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,217 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 12:52:19,219 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 12:52:19,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,222 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,232 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 12:52:19,251 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 12:52:19,251 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:60, output treesize:125 [2018-01-24 12:52:19,461 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 12:52:19,462 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:52:19,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13, 13, 13] total 45 [2018-01-24 12:52:19,462 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:52:19,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:52:19,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:52:19,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 12:52:19,464 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 21 states. [2018-01-24 12:52:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:20,196 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-24 12:52:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:52:20,197 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-24 12:52:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:20,197 INFO L225 Difference]: With dead ends: 63 [2018-01-24 12:52:20,198 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 12:52:20,198 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 12:52:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 12:52:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2018-01-24 12:52:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:52:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-01-24 12:52:20,204 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2018-01-24 12:52:20,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:20,204 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-01-24 12:52:20,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:52:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-01-24 12:52:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:52:20,205 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:20,205 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 12:52:20,205 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:52:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash 993932632, now seen corresponding path program 1 times [2018-01-24 12:52:20,205 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:20,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:20,206 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:52:20,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:20,206 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:20,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:20,288 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 12:52:20,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:20,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:52:20,288 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:20,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:52:20,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:52:20,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:52:20,289 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2018-01-24 12:52:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:20,341 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-24 12:52:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:52:20,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 12:52:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:20,341 INFO L225 Difference]: With dead ends: 46 [2018-01-24 12:52:20,341 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:52:20,342 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 12:52:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:52:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:52:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:52:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:52:20,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 12:52:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:20,343 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:52:20,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:52:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:52:20,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:52:20,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:52:20,754 WARN L146 SmtUtils]: Spent 348ms on a formula simplification. DAG size of input: 72 DAG size of output 55 [2018-01-24 12:52:21,141 WARN L146 SmtUtils]: Spent 384ms on a formula simplification. DAG size of input: 135 DAG size of output 110 [2018-01-24 12:52:21,222 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,222 INFO L401 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-24 12:52:21,222 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,222 INFO L401 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-24 12:52:21,222 INFO L401 ceAbstractionStarter]: For program point cstrcpyFINAL(lines 540 546) no Hoare annotation was computed. [2018-01-24 12:52:21,222 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,222 INFO L401 ceAbstractionStarter]: For program point cstrcpyEXIT(lines 540 546) no Hoare annotation was computed. [2018-01-24 12:52:21,222 INFO L401 ceAbstractionStarter]: For program point cstrcpyErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,223 INFO L401 ceAbstractionStarter]: For program point L544''''''(line 544) no Hoare annotation was computed. [2018-01-24 12:52:21,223 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 12:52:21,223 INFO L397 ceAbstractionStarter]: At program point L544'''''(line 544) the Hoare annotation is: (let ((.cse6 (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 .cse6 (+ |cstrcpy_#in~from.offset| .cse19 (- 1))) 0))) (.cse2 (not (= (select |#valid| |cstrcpy_#in~to.base|) 1))) (.cse5 (<= cstrcpy_~to.offset 0)) (.cse3 (not (= 1 (select |#valid| |cstrcpy_#in~from.base|)))) (.cse4 (= |cstrcpy_#in~from.base| |cstrcpy_#in~to.base|)) (.cse7 (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_1 Int) (main_~length2~4 Int)) (and (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4) (select |#length| |cstrcpy_#in~from.base|)) (<= |cstrcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_1) (= (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4 (- 1))) 0) (<= 1 main_~length2~4))))) (.cse8 (not (= 0 |cstrcpy_#in~to.offset|))) (.cse9 (not (= 0 |cstrcpy_#in~from.offset|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (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)) .cse5) (not (= 0 (select .cse6 |cstrcpy_#in~from.offset|))) .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 (let ((.cse18 (select |#length| cstrcpy_~to.base)) (.cse17 (select |#length| cstrcpy_~from.base))) (let ((.cse14 (<= (+ cstrcpy_~from.offset 1) .cse17)) (.cse15 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_4 Int)) (and (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_4 1) cstrcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_4) (= (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_4 (select |#length| cstrcpy_~from.base) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 0)))) (.cse16 (<= 1 cstrcpy_~to.offset)) (.cse10 (= 1 (select |#valid| cstrcpy_~from.base))) (.cse11 (<= .cse17 .cse18)) (.cse12 (= (select |#valid| cstrcpy_~to.base) 1)) (.cse13 (not (= cstrcpy_~to.base cstrcpy_~from.base)))) (or (and .cse10 (<= cstrcpy_~to.offset 1) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (<= (+ cstrcpy_~to.offset .cse17) (+ .cse18 cstrcpy_~from.offset)) .cse10 .cse12 .cse13 .cse14 (<= 2 cstrcpy_~from.offset) .cse15 .cse16) (and .cse10 .cse11 .cse12 (<= 0 cstrcpy_~to.offset) .cse13 (= cstrcpy_~from.offset 0) .cse5 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_4 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 cstrcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_4) (= (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_4 (select |#length| cstrcpy_~from.base) (- 1))) 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 0))) (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_1 Int) (main_~length2~4 Int)) (and (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4) (select |#length| cstrcpy_~from.base)) (<= 1 main_~length2~4) (= 0 (select (select |#memory_int| cstrcpy_~from.base) (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4 (- 1)))) (<= cstrcpy_~from.offset v_main_~nondetString~4.offset_BEFORE_CALL_1))) (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_4 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 |cstrcpy_#in~from.offset|) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_4) (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 0) (= (select (select |#memory_int| |cstrcpy_#in~from.base|) (+ (select |#length| |cstrcpy_#in~from.base|) v_main_~nondetString~4.offset_BEFORE_CALL_4 (- 1))) 0))))))) .cse3 .cse4 .cse7 .cse8 .cse9)))) [2018-01-24 12:52:21,223 INFO L401 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-24 12:52:21,224 INFO L397 ceAbstractionStarter]: At program point cstrcpyENTRY(lines 540 546) the Hoare annotation is: (let ((.cse10 (select |old(#memory_int)| |cstrcpy_#in~from.base|)) (.cse8 (select |#length| |cstrcpy_#in~from.base|))) (let ((.cse0 (< (select |#length| |cstrcpy_#in~to.base|) .cse8)) (.cse1 (not (= (select .cse10 (+ |cstrcpy_#in~from.offset| .cse8 (- 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|)) (.cse5 (not (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_1 Int) (main_~length2~4 Int)) (and (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4) (select |#length| |cstrcpy_#in~from.base|)) (<= |cstrcpy_#in~from.offset| v_main_~nondetString~4.offset_BEFORE_CALL_1) (= (select (select |old(#memory_int)| |cstrcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_1 main_~length2~4 (- 1))) 0) (<= 1 main_~length2~4))))) (.cse6 (not (= 0 |cstrcpy_#in~to.offset|))) (.cse7 (select |#memory_int| |cstrcpy_#in~from.base|)) (.cse9 (not (= 0 |cstrcpy_#in~from.offset|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (select .cse7 (+ .cse8 |cstrcpy_#in~from.offset| (- 1))) 0) .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 (select .cse10 |cstrcpy_#in~from.offset|))) .cse5 .cse6 (= 0 (select .cse7 |cstrcpy_#in~from.offset|)) .cse9)))) [2018-01-24 12:52:21,224 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,224 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:52:21,224 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,224 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-24 12:52:21,224 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,224 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-24 12:52:21,224 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,224 INFO L401 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-24 12:52:21,224 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,224 INFO L401 ceAbstractionStarter]: For program point L553'(lines 553 555) no Hoare annotation was computed. [2018-01-24 12:52:21,224 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 547 562) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point L557'''(line 557) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point L550''(lines 550 552) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point L550(lines 550 552) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 547 562) no Hoare annotation was computed. [2018-01-24 12:52:21,225 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 12:52:21,226 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 12:52:21,226 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 547 562) no Hoare annotation was computed. [2018-01-24 12:52:21,226 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 547 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:52:21,226 INFO L401 ceAbstractionStarter]: For program point L558'''(line 558) no Hoare annotation was computed. [2018-01-24 12:52:21,226 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 12:52:21,226 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 12:52:21,238 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,240 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,241 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,242 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,243 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,244 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,245 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,246 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,247 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,248 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,249 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,252 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,265 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,265 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,265 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,266 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,266 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,266 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,270 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,273 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,274 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,275 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,276 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,277 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,280 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,281 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,281 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,281 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,281 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,282 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:52:21 BoogieIcfgContainer [2018-01-24 12:52:21,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:52:21,287 INFO L168 Benchmark]: Toolchain (without parser) took 10926.74 ms. Allocated memory was 304.1 MB in the beginning and 586.2 MB in the end (delta: 282.1 MB). Free memory was 262.0 MB in the beginning and 430.9 MB in the end (delta: -168.9 MB). Peak memory consumption was 218.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:52:21,289 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:52:21,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.56 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 250.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:52:21,289 INFO L168 Benchmark]: Boogie Preprocessor took 30.27 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 249.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:52:21,290 INFO L168 Benchmark]: RCFGBuilder took 250.72 ms. Allocated memory is still 304.1 MB. Free memory was 249.8 MB in the beginning and 232.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:52:21,290 INFO L168 Benchmark]: TraceAbstraction took 10434.54 ms. Allocated memory was 304.1 MB in the beginning and 586.2 MB in the end (delta: 282.1 MB). Free memory was 232.8 MB in the beginning and 430.9 MB in the end (delta: -198.1 MB). Peak memory consumption was 189.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:52:21,292 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 304.1 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.56 ms. Allocated memory is still 304.1 MB. Free memory was 261.0 MB in the beginning and 250.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.27 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 249.8 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 250.72 ms. Allocated memory is still 304.1 MB. Free memory was 249.8 MB in the beginning and 232.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10434.54 ms. Allocated memory was 304.1 MB in the beginning and 586.2 MB in the end (delta: 282.1 MB). Free memory was 232.8 MB in the beginning and 430.9 MB in the end (delta: -198.1 MB). Peak memory consumption was 189.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,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] * 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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 * 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 12:52:21,302 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,302 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,303 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,304 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,305 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,309 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,310 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,313 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,314 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,314 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,314 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,314 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,314 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,315 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,315 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,315 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,315 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,316 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,322 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,322 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,322 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,323 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,323 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,323 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,323 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,324 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,324 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,324 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,324 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:52:21,328 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,328 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,328 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,328 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:52:21,328 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,328 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length2~4,QUANTIFIED] [2018-01-24 12:52:21,329 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,329 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,329 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,329 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,330 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,331 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,331 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,331 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,331 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,331 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,332 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,332 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,332 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,332 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,332 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,333 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,334 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:52:21,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,335 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:52:21,336 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) || ((0 == unknown-#memory_int-unknown[from][from] && 0 == unknown-#memory_int-unknown[from][from]) && to <= 0)) || !(0 == \old(unknown-#memory_int-unknown)[from][from])) || !(\exists v_main_~nondetString~4.offset_BEFORE_CALL_1 : int, main_~length2~4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 <= unknown-#length-unknown[from] && from <= v_main_~nondetString~4.offset_BEFORE_CALL_1) && \old(unknown-#memory_int-unknown)[from][v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 + -1] == 0) && 1 <= main_~length2~4)) || !(0 == to)) || !(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] && 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_4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_4 + 1 <= from && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_4) && unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_4 + unknown-#length-unknown[from] + -1] == 0) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= 0)) && 1 <= to) || (((((((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_4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_4 + 1 <= from && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_4) && unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_4 + unknown-#length-unknown[from] + -1] == 0) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= 0)) && 1 <= to)) || (((((((((1 == \valid[from] && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && \valid[to] == 1) && 0 <= to) && !(to == from)) && from == 0) && to <= 0) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_4 <= from && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_4) && unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_4 + unknown-#length-unknown[from] + -1] == 0) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= 0)) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_1 : int, main_~length2~4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 <= unknown-#length-unknown[from] && 1 <= main_~length2~4) && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 + -1]) && from <= v_main_~nondetString~4.offset_BEFORE_CALL_1)) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_4 <= from && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_4) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= 0) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_4 + -1] == 0))) || !(1 == \valid[from])) || from == to) || !(\exists v_main_~nondetString~4.offset_BEFORE_CALL_1 : int, main_~length2~4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 <= unknown-#length-unknown[from] && from <= v_main_~nondetString~4.offset_BEFORE_CALL_1) && \old(unknown-#memory_int-unknown)[from][v_main_~nondetString~4.offset_BEFORE_CALL_1 + main_~length2~4 + -1] == 0) && 1 <= main_~length2~4)) || !(0 == to)) || !(0 == from)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 10.3s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.8s 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.3s 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, 0.0s AbstIntTime, 0 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.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s 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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-52-21-342.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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-52-21-342.csv Received shutdown request...