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/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:56:52,196 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:56:52,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:56:52,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:56:52,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:56:52,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:56:52,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:56:52,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:56:52,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:56:52,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:56:52,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:56:52,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:56:52,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:56:52,221 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:56:52,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:56:52,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:56:52,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:56:52,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:56:52,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:56:52,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:56:52,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:56:52,234 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:56:52,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:56:52,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:56:52,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:56:52,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:56:52,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:56:52,238 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:56:52,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:56:52,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:56:52,239 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:56:52,240 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:56:52,250 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:56:52,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:56:52,251 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:56:52,251 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:56:52,252 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:56:52,252 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:56:52,252 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:56:52,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:56:52,253 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:56:52,253 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:56:52,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:56:52,253 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:56:52,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:56:52,254 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:56:52,254 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:56:52,254 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:56:52,254 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:56:52,255 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:56:52,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:56:52,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:56:52,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:56:52,255 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:56:52,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:56:52,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:56:52,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:56:52,256 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:56:52,257 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:56:52,257 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:56:52,257 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:56:52,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:56:52,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:56:52,258 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:56:52,258 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:56:52,259 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:56:52,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:56:52,308 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:56:52,312 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:56:52,313 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:56:52,314 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:56:52,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:56:52,493 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:56:52,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:56:52,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:56:52,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:56:52,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:56:52,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@424d8e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52, skipping insertion in model container [2018-01-24 12:56:52,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,524 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:56:52,564 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:56:52,673 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:56:52,691 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:56:52,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52 WrapperNode [2018-01-24 12:56:52,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:56:52,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:56:52,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:56:52,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:56:52,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (1/1) ... [2018-01-24 12:56:52,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:56:52,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:56:52,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:56:52,739 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:56:52,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (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:56:52,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:56:52,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:56:52,795 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-01-24 12:56:52,795 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:56:52,795 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:56:52,796 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:56:52,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:56:52,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:56:52,796 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:56:52,796 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:56:52,796 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-01-24 12:56:52,797 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:56:52,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:56:52,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:56:53,006 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:56:53,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:56:53 BoogieIcfgContainer [2018-01-24 12:56:53,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:56:53,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:56:53,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:56:53,010 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:56:53,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:56:52" (1/3) ... [2018-01-24 12:56:53,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76332de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:56:53, skipping insertion in model container [2018-01-24 12:56:53,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:52" (2/3) ... [2018-01-24 12:56:53,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76332de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:56:53, skipping insertion in model container [2018-01-24 12:56:53,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:56:53" (3/3) ... [2018-01-24 12:56:53,015 INFO L105 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:56:53,021 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:56:53,027 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 12:56:53,071 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:56:53,071 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:56:53,071 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:56:53,071 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:56:53,072 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:56:53,072 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:56:53,072 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:56:53,072 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:56:53,073 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:56:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 12:56:53,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:56:53,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:53,098 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:53,098 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:56:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390414, now seen corresponding path program 1 times [2018-01-24 12:56:53,104 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:53,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:53,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:53,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:53,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:53,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:53,264 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:56:53,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:53,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:56:53,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:53,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:56:53,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:56:53,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:56:53,289 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-01-24 12:56:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:53,461 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-24 12:56:53,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:56:53,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-01-24 12:56:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:53,469 INFO L225 Difference]: With dead ends: 51 [2018-01-24 12:56:53,470 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:56:53,472 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:56:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:56:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 12:56:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:56:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:56:53,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-01-24 12:56:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:53,499 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:56:53,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:56:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:56:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:56:53,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:53,500 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:53,500 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:56:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1004390413, now seen corresponding path program 1 times [2018-01-24 12:56:53,500 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:53,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:53,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:53,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:53,502 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:53,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:53,606 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:56:53,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:53,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:56:53,607 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:53,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:56:53,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:56:53,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:56:53,610 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 12:56:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:53,684 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 12:56:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:56:53,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 12:56:53,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:53,721 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:56:53,721 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 12:56:53,722 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:56:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 12:56:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 12:56:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:56:53,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 12:56:53,727 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 10 [2018-01-24 12:56:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:53,727 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 12:56:53,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:56:53,727 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 12:56:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:56:53,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:53,728 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:53,728 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:56:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash -104566583, now seen corresponding path program 1 times [2018-01-24 12:56:53,728 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:53,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:53,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:53,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:53,729 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:53,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:53,818 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:56:53,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:53,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:56:53,819 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:53,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:56:53,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:56:53,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:56:53,820 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 12:56:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:53,899 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 12:56:53,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:56:53,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 12:56:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:53,901 INFO L225 Difference]: With dead ends: 35 [2018-01-24 12:56:53,901 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 12:56:53,901 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:56:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 12:56:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 12:56:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 12:56:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-24 12:56:53,907 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-24 12:56:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:53,907 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-24 12:56:53,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:56:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-24 12:56:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:56:53,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:53,908 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:53,908 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:56:53,909 INFO L82 PathProgramCache]: Analyzing trace with hash -104566582, now seen corresponding path program 1 times [2018-01-24 12:56:53,909 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:53,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:53,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:53,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:53,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:53,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:54,070 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:56:54,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:54,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:56:54,070 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:54,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:56:54,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:56:54,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:56:54,071 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-01-24 12:56:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:54,198 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 12:56:54,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:56:54,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 12:56:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:54,201 INFO L225 Difference]: With dead ends: 46 [2018-01-24 12:56:54,201 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 12:56:54,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:56:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 12:56:54,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-01-24 12:56:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 12:56:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-01-24 12:56:54,209 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2018-01-24 12:56:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:54,209 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-01-24 12:56:54,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:56:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-01-24 12:56:54,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:56:54,210 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:54,210 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] [2018-01-24 12:56:54,210 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:56:54,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1089103921, now seen corresponding path program 1 times [2018-01-24 12:56:54,211 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:54,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:54,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:54,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:54,212 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:54,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:54,395 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:56:54,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:54,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:56:54,396 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:54,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:56:54,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:56:54,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:56:54,397 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-01-24 12:56:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:54,504 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-01-24 12:56:54,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:56:54,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 12:56:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:54,506 INFO L225 Difference]: With dead ends: 77 [2018-01-24 12:56:54,506 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 12:56:54,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:56:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 12:56:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2018-01-24 12:56:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:56:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 12:56:54,512 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 21 [2018-01-24 12:56:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:54,512 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 12:56:54,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:56:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 12:56:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:56:54,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:54,513 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] [2018-01-24 12:56:54,513 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:56:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1925999697, now seen corresponding path program 1 times [2018-01-24 12:56:54,514 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:54,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:54,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:54,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:54,515 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:54,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:54,728 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:56:54,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:54,729 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:56:54,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:54,742 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:54,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:54,807 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:56:54,817 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:56:54,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:54,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:54,825 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:56:54,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:56:54,904 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:56:54,912 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:56:54,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:56:54,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:54,928 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:56:54,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:56:55,004 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:56:55,004 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:55,196 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:56:55,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,203 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:56:55,215 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:56:55,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,224 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:56:55,224 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:56:55,230 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:56:55,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:55,251 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:56:55,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:55,255 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:55,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:55,290 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:56:55,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:56:55,334 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:56:55,336 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:56:55,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:56:55,426 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:56:55,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-24 12:56:55,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:56:55,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:55,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:55,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 12:56:55,506 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:56:55,506 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:55,572 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:56:55,580 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:56:55,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:55,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:56:55,635 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:56:55,636 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:56:55,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 31 [2018-01-24 12:56:55,636 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:56:55,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:56:55,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:56:55,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2018-01-24 12:56:55,638 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 16 states. [2018-01-24 12:56:56,034 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 54 DAG size of output 39 [2018-01-24 12:57:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:00,843 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-01-24 12:57:00,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:57:00,843 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-01-24 12:57:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:00,845 INFO L225 Difference]: With dead ends: 116 [2018-01-24 12:57:00,845 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 12:57:00,846 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=1634, Unknown=0, NotChecked=0, Total=1892 [2018-01-24 12:57:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 12:57:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 58. [2018-01-24 12:57:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 12:57:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-01-24 12:57:00,857 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 21 [2018-01-24 12:57:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:00,858 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-01-24 12:57:00,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:57:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-01-24 12:57:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:57:00,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:57:00,859 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] [2018-01-24 12:57:00,859 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:57:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 292485851, now seen corresponding path program 1 times [2018-01-24 12:57:00,860 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:57:00,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:00,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:00,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:00,861 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:57:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:00,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:57:00,956 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:57:00,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:57:00,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:57:00,957 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:57:00,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:57:00,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:57:00,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:57:00,958 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 4 states. [2018-01-24 12:57:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:01,008 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-24 12:57:01,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:57:01,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 12:57:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:01,009 INFO L225 Difference]: With dead ends: 58 [2018-01-24 12:57:01,009 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 12:57:01,009 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:57:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 12:57:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 12:57:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 12:57:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 12:57:01,014 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 23 [2018-01-24 12:57:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:01,014 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 12:57:01,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:57:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 12:57:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:57:01,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:57:01,015 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:57:01,015 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:57:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1201761770, now seen corresponding path program 2 times [2018-01-24 12:57:01,015 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:57:01,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:01,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:01,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:01,016 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:57:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:01,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:57:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:01,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:57:01,314 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:57:01,329 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:57:01,330 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:57:01,343 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:57:01,348 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:57:01,350 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:57:01,352 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:57:01,356 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:57:01,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:57:01,384 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:57:01,386 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:57:01,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 12:57:01,498 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:57:01,504 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:57:01,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:57:01,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:01,515 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:57:01,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 12:57:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:01,560 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:57:01,842 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 41 treesize of output 39 [2018-01-24 12:57:01,866 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:57:01,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,896 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 39 treesize of output 37 [2018-01-24 12:57:01,917 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:57:01,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:01,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:01,941 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 12:57:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:02,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:57:02,071 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:57:02,074 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:57:02,074 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:57:02,088 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:57:02,101 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:57:02,116 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:57:02,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:57:02,124 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:57:02,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:02,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:02,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:57:02,162 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:57:02,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:57:02,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:02,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:02,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:02,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 12:57:02,289 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:57:02,296 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:57:02,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:57:02,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:02,310 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:57:02,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 12:57:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:02,315 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:57:02,489 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:57:02,498 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:57:02,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:02,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:02,506 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:57:02,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 12:57:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:02,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:57:02,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 34 [2018-01-24 12:57:02,601 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:57:02,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:57:02,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:57:02,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 12:57:02,602 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 18 states. [2018-01-24 12:57:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:03,319 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-01-24 12:57:03,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:57:03,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-24 12:57:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:03,320 INFO L225 Difference]: With dead ends: 78 [2018-01-24 12:57:03,320 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 12:57:03,321 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=329, Invalid=2023, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 12:57:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 12:57:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-01-24 12:57:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:57:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 12:57:03,330 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 27 [2018-01-24 12:57:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:03,331 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 12:57:03,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:57:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 12:57:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:57:03,332 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:57:03,332 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:57:03,332 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:57:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2006324798, now seen corresponding path program 1 times [2018-01-24 12:57:03,333 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:57:03,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:03,334 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:57:03,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:03,334 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:57:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:03,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:57:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:03,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:57:03,547 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:57:03,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:03,552 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:57:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:03,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:57:03,573 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:57:03,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:03,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:03,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:57:03,583 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 15 treesize of output 12 [2018-01-24 12:57:03,584 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:57:03,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:03,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:03,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:03,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:57:03,631 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 23 treesize of output 18 [2018-01-24 12:57:03,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 12:57:03,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:57:03,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:03,669 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:57:03,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-24 12:57:03,731 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 29 treesize of output 25 [2018-01-24 12:57:03,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:57:03,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:57:03,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:03,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:03,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:34 [2018-01-24 12:57:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:03,816 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:57:04,097 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:57:04,106 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:57:04,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,114 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:57:04,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:57:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:04,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:57:04,194 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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:57:04,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:04,197 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:57:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:04,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:57:04,257 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:57:04,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:57:04,268 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:57:04,269 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:57:04,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 12:57:04,323 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 23 treesize of output 18 [2018-01-24 12:57:04,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 30 [2018-01-24 12:57:04,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:57:04,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:04,348 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:57:04,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-24 12:57:04,457 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 29 treesize of output 25 [2018-01-24 12:57:04,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:57:04,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:57:04,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:04,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:04,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:34 [2018-01-24 12:57:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:04,500 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:57:04,710 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:57:04,719 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:57:04,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:04,726 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:57:04,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 12:57:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:04,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:57:04,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12, 12, 12] total 42 [2018-01-24 12:57:04,809 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:57:04,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:57:04,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:57:04,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1588, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 12:57:04,810 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 21 states. [2018-01-24 12:57:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:05,331 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 12:57:05,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:57:05,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-01-24 12:57:05,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:05,332 INFO L225 Difference]: With dead ends: 48 [2018-01-24 12:57:05,332 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:57:05,333 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 99 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=568, Invalid=2624, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 12:57:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:57:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:57:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:57:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:57:05,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-24 12:57:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:05,334 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:57:05,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:57:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:57:05,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:57:05,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:57:05,818 WARN L146 SmtUtils]: Spent 393ms on a formula simplification. DAG size of input: 130 DAG size of output 72 [2018-01-24 12:57:05,911 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,911 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:57:05,946 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,946 INFO L397 ceAbstractionStarter]: At program point cstrreplaceENTRY(lines 540 552) the Hoare annotation is: (let ((.cse6 (select |#length| |cstrreplace_#in~s.base|))) (let ((.cse2 (not (= 1 (select |#valid| |cstrreplace_#in~s.base|)))) (.cse3 (< .cse6 1)) (.cse5 (select |old(#memory_int)| |cstrreplace_#in~s.base|)) (.cse4 (not (= 0 |cstrreplace_#in~s.offset|))) (.cse0 (select |#memory_int| |cstrreplace_#in~s.base|))) (and (let ((.cse1 (+ .cse6 (- 1)))) (or (= 0 (select .cse0 .cse1)) .cse2 .cse3 .cse4 (not (= 0 (select .cse5 .cse1))))) (or .cse2 .cse3 (not (= (select .cse5 |cstrreplace_#in~s.offset|) 0)) .cse4 (= 0 (select .cse0 |cstrreplace_#in~s.offset|)))))) [2018-01-24 12:57:05,946 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 550) the Hoare annotation is: (let ((.cse5 (select |#length| |cstrreplace_#in~s.base|))) (let ((.cse0 (not (= 1 (select |#valid| |cstrreplace_#in~s.base|)))) (.cse1 (< .cse5 1)) (.cse2 (select |old(#memory_int)| |cstrreplace_#in~s.base|)) (.cse4 (exists ((main_~length1~5 Int) (v_main_~nondetString1~5.offset_BEFORE_CALL_1 Int)) (and (<= cstrreplace_~p~2.offset v_main_~nondetString1~5.offset_BEFORE_CALL_1) (<= (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_1) (select |#length| cstrreplace_~p~2.base)) (<= 1 main_~length1~5) (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ main_~length1~5 v_main_~nondetString1~5.offset_BEFORE_CALL_1 (- 1))))))) (.cse3 (= 1 (select |#valid| cstrreplace_~p~2.base)))) (and (or .cse0 .cse1 (not (= (select .cse2 |cstrreplace_#in~s.offset|) 0)) (not (= 0 |cstrreplace_#in~s.offset|)) (and (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) cstrreplace_~p~2.offset)) .cse3 (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) |cstrreplace_#in~s.offset|)) .cse4 (= cstrreplace_~p~2.offset 0))) (or (< 0 |cstrreplace_#in~s.offset|) .cse0 .cse1 (< |cstrreplace_#in~s.offset| 0) (not (= 0 (select .cse2 (+ .cse5 (- 1))))) (and .cse4 (exists ((v_main_~nondetString1~5.offset_BEFORE_CALL_3 Int)) (and (<= v_main_~nondetString1~5.offset_BEFORE_CALL_3 |cstrreplace_#in~s.offset|) (<= 0 v_main_~nondetString1~5.offset_BEFORE_CALL_3) (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) (+ (select |#length| |cstrreplace_#in~s.base|) v_main_~nondetString1~5.offset_BEFORE_CALL_3 (- 1)))) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_3 0))) (exists ((v_main_~nondetString1~5.offset_BEFORE_CALL_3 Int)) (and (= (select (select |#memory_int| cstrreplace_~p~2.base) (+ (select |#length| cstrreplace_~p~2.base) v_main_~nondetString1~5.offset_BEFORE_CALL_3 (- 1))) 0) (<= 0 v_main_~nondetString1~5.offset_BEFORE_CALL_3) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_3 cstrreplace_~p~2.offset) (<= v_main_~nondetString1~5.offset_BEFORE_CALL_3 0))) .cse3))))) [2018-01-24 12:57:05,946 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,946 INFO L401 ceAbstractionStarter]: For program point L544''''(lines 544 550) no Hoare annotation was computed. [2018-01-24 12:57:05,946 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 12:57:05,946 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point cstrreplaceFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point L545'''(lines 545 548) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,947 INFO L401 ceAbstractionStarter]: For program point cstrreplaceEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-24 12:57:05,948 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 12:57:05,948 INFO L401 ceAbstractionStarter]: For program point cstrreplaceErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,948 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-24 12:57:05,948 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,948 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-24 12:57:05,948 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,948 INFO L397 ceAbstractionStarter]: At program point L560(line 560) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString1~5.base))) (and (= 1 (select |#valid| main_~nondetString1~5.base)) (= 0 |main_#t~malloc6.offset|) (= main_~length1~5 .cse0) (<= 1 main_~length1~5) (= main_~length1~5 (select |#length| |main_#t~malloc6.base|)) (= 0 (select (select |#memory_int| main_~nondetString1~5.base) (+ .cse0 (+ main_~nondetString1~5.offset (- 1))))) (= 0 main_~nondetString1~5.offset) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|))) [2018-01-24 12:57:05,948 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L401 ceAbstractionStarter]: For program point L560'(line 560) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L401 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-24 12:57:05,949 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:57:05,950 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-24 12:57:05,950 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-24 12:57:05,950 INFO L401 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-24 12:57:05,950 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-24 12:57:05,958 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,961 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,962 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,963 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,967 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,968 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,976 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,977 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,978 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,979 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,980 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:05,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,980 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,981 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,982 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:05,983 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:05,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:57:05 BoogieIcfgContainer [2018-01-24 12:57:05,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:57:05,987 INFO L168 Benchmark]: Toolchain (without parser) took 13493.68 ms. Allocated memory was 304.6 MB in the beginning and 564.7 MB in the end (delta: 260.0 MB). Free memory was 264.5 MB in the beginning and 440.5 MB in the end (delta: -176.0 MB). Peak memory consumption was 84.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:05,988 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:57:05,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.62 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:05,989 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 ms. Allocated memory is still 304.6 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:05,989 INFO L168 Benchmark]: RCFGBuilder took 268.23 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 235.6 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:05,990 INFO L168 Benchmark]: TraceAbstraction took 12978.50 ms. Allocated memory was 304.6 MB in the beginning and 564.7 MB in the end (delta: 260.0 MB). Free memory was 235.6 MB in the beginning and 440.5 MB in the end (delta: -204.9 MB). Peak memory consumption was 55.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:05,991 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.25 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.62 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.84 ms. Allocated memory is still 304.6 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 268.23 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 235.6 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12978.50 ms. Allocated memory was 304.6 MB in the beginning and 564.7 MB in the end (delta: 260.0 MB). Free memory was 235.6 MB in the beginning and 440.5 MB in the end (delta: -204.9 MB). Peak memory consumption was 55.1 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_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 12:57:05,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:05,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:05,999 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,000 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,001 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,002 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,003 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,003 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,004 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,005 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,006 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,008 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,009 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-24 12:57:06,010 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:57:06,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,011 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,012 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString1~5.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-24 12:57:06,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,012 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,013 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:57:06,014 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:57:06,015 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(1 == \valid[s]) || unknown-#length-unknown[s] < 1) || !(\old(unknown-#memory_int-unknown)[s][s] == 0)) || !(0 == s)) || ((((0 == unknown-#memory_int-unknown[p][p] && 1 == \valid[p]) && 0 == unknown-#memory_int-unknown[s][s]) && (\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_1 : int :: ((p <= v_main_~nondetString1~5.offset_BEFORE_CALL_1 && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 <= unknown-#length-unknown[p]) && 1 <= main_~length1~5) && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 + -1])) && p == 0)) && (((((0 < s || !(1 == \valid[s])) || unknown-#length-unknown[s] < 1) || s < 0) || !(0 == \old(unknown-#memory_int-unknown)[s][unknown-#length-unknown[s] + -1])) || ((((\exists main_~length1~5 : int, v_main_~nondetString1~5.offset_BEFORE_CALL_1 : int :: ((p <= v_main_~nondetString1~5.offset_BEFORE_CALL_1 && main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 <= unknown-#length-unknown[p]) && 1 <= main_~length1~5) && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + v_main_~nondetString1~5.offset_BEFORE_CALL_1 + -1]) && (\exists v_main_~nondetString1~5.offset_BEFORE_CALL_3 : int :: ((v_main_~nondetString1~5.offset_BEFORE_CALL_3 <= s && 0 <= v_main_~nondetString1~5.offset_BEFORE_CALL_3) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + v_main_~nondetString1~5.offset_BEFORE_CALL_3 + -1]) && v_main_~nondetString1~5.offset_BEFORE_CALL_3 <= 0)) && (\exists v_main_~nondetString1~5.offset_BEFORE_CALL_3 : int :: ((unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + v_main_~nondetString1~5.offset_BEFORE_CALL_3 + -1] == 0 && 0 <= v_main_~nondetString1~5.offset_BEFORE_CALL_3) && v_main_~nondetString1~5.offset_BEFORE_CALL_3 <= p) && v_main_~nondetString1~5.offset_BEFORE_CALL_3 <= 0)) && 1 == \valid[p])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. SAFE Result, 12.8s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 242 SDtfs, 498 SDslu, 910 SDs, 0 SdLazy, 874 SolverSat, 159 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 245 SyntacticMatches, 22 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=6, 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, 9 MinimizatonAttempts, 77 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 16 NumberOfFragments, 319 HoareAnnotationTreeSize, 9 FomulaSimplifications, 377 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1015 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 488 ConstructedInterpolants, 71 QuantifiedInterpolants, 200562 SizeOfPredicates, 73 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 22/182 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/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-57-06-020.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-57-06-020.csv Received shutdown request...