java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:51:47,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:51:47,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:51:47,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:51:47,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:51:47,446 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:51:47,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:51:47,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:51:47,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:51:47,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:51:47,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:51:47,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:51:47,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:51:47,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:51:47,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:51:47,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:51:47,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:51:47,461 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:51:47,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:51:47,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:51:47,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:51:47,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:51:47,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:51:47,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:51:47,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:51:47,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:51:47,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:51:47,470 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:51:47,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:51:47,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:51:47,471 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:51:47,471 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:51:47,481 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:51:47,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:51:47,482 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:51:47,482 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:51:47,482 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:51:47,482 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:51:47,482 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:51:47,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:51:47,483 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:51:47,483 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:51:47,484 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:51:47,484 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:51:47,484 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:51:47,484 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:51:47,484 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:51:47,484 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:51:47,485 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:51:47,485 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:51:47,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:51:47,485 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:51:47,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:51:47,486 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:51:47,486 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:51:47,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:51:47,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:51:47,486 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:51:47,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:51:47,487 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:51:47,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:51:47,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:51:47,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:51:47,488 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:51:47,488 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:51:47,489 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:51:47,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:51:47,535 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:51:47,539 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:51:47,540 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:51:47,541 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:51:47,542 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-29 22:51:47,700 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:51:47,708 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:51:47,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:51:47,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:51:47,715 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:51:47,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6f32fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47, skipping insertion in model container [2018-01-29 22:51:47,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,737 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:51:47,777 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:51:47,888 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:51:47,903 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:51:47,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47 WrapperNode [2018-01-29 22:51:47,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:51:47,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:51:47,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:51:47,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:51:47,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (1/1) ... [2018-01-29 22:51:47,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:51:47,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:51:47,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:51:47,942 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:51:47,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:51:47,986 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:51:47,987 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:51:47,987 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrreplace [2018-01-29 22:51:47,987 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:51:47,987 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:51:47,987 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:51:47,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:51:47,987 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:51:47,987 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:51:47,987 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:51:47,987 INFO L128 BoogieDeclarations]: Found specification of procedure cstrreplace [2018-01-29 22:51:47,987 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:51:47,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:51:47,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:51:48,191 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:51:48,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:51:48 BoogieIcfgContainer [2018-01-29 22:51:48,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:51:48,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:51:48,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:51:48,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:51:48,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:51:47" (1/3) ... [2018-01-29 22:51:48,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d100e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:51:48, skipping insertion in model container [2018-01-29 22:51:48,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:51:47" (2/3) ... [2018-01-29 22:51:48,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d100e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:51:48, skipping insertion in model container [2018-01-29 22:51:48,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:51:48" (3/3) ... [2018-01-29 22:51:48,199 INFO L107 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:51:48,205 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:51:48,210 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-29 22:51:48,247 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:51:48,247 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:51:48,247 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:51:48,247 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:51:48,248 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:51:48,248 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:51:48,248 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:51:48,248 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:51:48,249 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:51:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-29 22:51:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-29 22:51:48,274 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:48,275 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:48,275 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:51:48,279 INFO L82 PathProgramCache]: Analyzing trace with hash 677251971, now seen corresponding path program 1 times [2018-01-29 22:51:48,281 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:48,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:48,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:48,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:48,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:48,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:48,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:48,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:51:48,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:51:48,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:51:48,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:51:48,463 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-01-29 22:51:48,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:48,595 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-01-29 22:51:48,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:51:48,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-29 22:51:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:48,715 INFO L225 Difference]: With dead ends: 76 [2018-01-29 22:51:48,715 INFO L226 Difference]: Without dead ends: 57 [2018-01-29 22:51:48,719 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:51:48,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-29 22:51:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-29 22:51:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-29 22:51:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-01-29 22:51:48,750 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 13 [2018-01-29 22:51:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:48,750 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-01-29 22:51:48,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:51:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-01-29 22:51:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-29 22:51:48,751 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:48,751 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:48,751 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:51:48,751 INFO L82 PathProgramCache]: Analyzing trace with hash 677251972, now seen corresponding path program 1 times [2018-01-29 22:51:48,751 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:48,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:48,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:48,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:48,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:48,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:48,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:48,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:51:48,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:51:48,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:51:48,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:51:48,903 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2018-01-29 22:51:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:48,961 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-29 22:51:48,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:51:48,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-29 22:51:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:48,962 INFO L225 Difference]: With dead ends: 57 [2018-01-29 22:51:48,962 INFO L226 Difference]: Without dead ends: 56 [2018-01-29 22:51:48,963 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:51:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-29 22:51:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-29 22:51:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-29 22:51:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-29 22:51:48,971 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 13 [2018-01-29 22:51:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:48,971 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-29 22:51:48,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:51:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-29 22:51:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 22:51:48,972 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:48,973 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:48,973 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:51:48,973 INFO L82 PathProgramCache]: Analyzing trace with hash -277412007, now seen corresponding path program 1 times [2018-01-29 22:51:48,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:48,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:48,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:48,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:48,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:48,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:49,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:49,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:51:49,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:51:49,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:51:49,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:51:49,071 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2018-01-29 22:51:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:49,182 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-29 22:51:49,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:51:49,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-29 22:51:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:49,184 INFO L225 Difference]: With dead ends: 60 [2018-01-29 22:51:49,184 INFO L226 Difference]: Without dead ends: 57 [2018-01-29 22:51:49,184 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:51:49,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-29 22:51:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-01-29 22:51:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-29 22:51:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-29 22:51:49,191 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 23 [2018-01-29 22:51:49,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:49,191 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-29 22:51:49,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:51:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-29 22:51:49,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 22:51:49,192 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:49,192 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:49,192 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:51:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash -277412006, now seen corresponding path program 1 times [2018-01-29 22:51:49,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:49,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:49,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:49,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:49,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:49,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:49,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:49,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:51:49,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:51:49,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:51:49,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:51:49,347 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 9 states. [2018-01-29 22:51:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:49,495 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-29 22:51:49,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:51:49,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-29 22:51:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:49,500 INFO L225 Difference]: With dead ends: 75 [2018-01-29 22:51:49,500 INFO L226 Difference]: Without dead ends: 72 [2018-01-29 22:51:49,501 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-29 22:51:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-29 22:51:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2018-01-29 22:51:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-29 22:51:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-29 22:51:49,510 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 23 [2018-01-29 22:51:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:49,511 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-29 22:51:49,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:51:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-29 22:51:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 22:51:49,512 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:49,512 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:49,512 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:51:49,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1145030291, now seen corresponding path program 1 times [2018-01-29 22:51:49,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:49,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:49,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:49,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:49,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:49,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:51:49,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:49,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:51:49,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:51:49,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:51:49,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:51:49,596 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 7 states. [2018-01-29 22:51:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:49,722 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-29 22:51:49,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:51:49,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-01-29 22:51:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:49,723 INFO L225 Difference]: With dead ends: 62 [2018-01-29 22:51:49,723 INFO L226 Difference]: Without dead ends: 61 [2018-01-29 22:51:49,724 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:51:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-29 22:51:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-29 22:51:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-29 22:51:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-29 22:51:49,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 33 [2018-01-29 22:51:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:49,728 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-29 22:51:49,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:51:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-29 22:51:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-29 22:51:49,729 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:49,729 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:49,729 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:51:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1145030290, now seen corresponding path program 1 times [2018-01-29 22:51:49,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:49,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:49,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:49,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:49,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:49,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:50,135 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-29 22:51:50,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:51:50,136 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:51:50,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:50,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:51:50,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:51:50,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:51:50,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:50,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:50,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:51:50,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:51:50,424 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-29 22:51:50,432 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-29 22:51:50,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:51:50,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:51:50,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:51:50,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-29 22:51:50,538 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-29 22:51:50,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:51:50,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-01-29 22:51:50,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 22:51:50,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 22:51:50,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-01-29 22:51:50,560 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 20 states. [2018-01-29 22:51:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:55,574 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2018-01-29 22:51:55,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:51:55,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-01-29 22:51:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:55,576 INFO L225 Difference]: With dead ends: 158 [2018-01-29 22:51:55,576 INFO L226 Difference]: Without dead ends: 155 [2018-01-29 22:51:55,577 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=1241, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:51:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-29 22:51:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 76. [2018-01-29 22:51:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-29 22:51:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-01-29 22:51:55,587 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 33 [2018-01-29 22:51:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:55,587 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-01-29 22:51:55,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 22:51:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-01-29 22:51:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 22:51:55,589 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:55,589 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:55,589 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:51:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash -692482562, now seen corresponding path program 1 times [2018-01-29 22:51:55,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:55,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:55,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:55,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:55,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:55,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:55,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:55,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:51:55,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:51:55,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:51:55,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:51:55,678 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 4 states. [2018-01-29 22:51:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:55,726 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-29 22:51:55,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:51:55,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-29 22:51:55,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:55,727 INFO L225 Difference]: With dead ends: 76 [2018-01-29 22:51:55,727 INFO L226 Difference]: Without dead ends: 63 [2018-01-29 22:51:55,727 INFO L553 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-29 22:51:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-29 22:51:55,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-29 22:51:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-29 22:51:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-01-29 22:51:55,735 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 36 [2018-01-29 22:51:55,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:55,735 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-01-29 22:51:55,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:51:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-01-29 22:51:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 22:51:55,736 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:55,736 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:55,736 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:51:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash -846142846, now seen corresponding path program 2 times [2018-01-29 22:51:55,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:55,736 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:55,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:55,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:55,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:55,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:56,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:51:56,125 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:51:56,130 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:51:56,145 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:51:56,153 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:51:56,166 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:51:56,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:51:56,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:51:56,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:51:56,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:56,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:56,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:51:56,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:51:56,527 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 28 treesize of output 22 [2018-01-29 22:51:56,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:56,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-29 22:51:56,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:51:56,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:51:56,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:51:56,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:43 [2018-01-29 22:51:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:56,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:51:56,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 25 [2018-01-29 22:51:56,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 22:51:56,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 22:51:56,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:51:56,677 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 26 states. [2018-01-29 22:51:56,966 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 35 DAG size of output 33 [2018-01-29 22:51:57,430 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 63 DAG size of output 60 [2018-01-29 22:52:00,265 WARN L146 SmtUtils]: Spent 2085ms on a formula simplification. DAG size of input: 86 DAG size of output 70 [2018-01-29 22:52:01,892 WARN L146 SmtUtils]: Spent 1487ms on a formula simplification. DAG size of input: 78 DAG size of output 66 [2018-01-29 22:52:02,506 WARN L146 SmtUtils]: Spent 475ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-01-29 22:52:04,119 WARN L146 SmtUtils]: Spent 1317ms on a formula simplification. DAG size of input: 94 DAG size of output 79 [2018-01-29 22:52:05,619 WARN L146 SmtUtils]: Spent 512ms on a formula simplification. DAG size of input: 85 DAG size of output 77 [2018-01-29 22:52:07,838 WARN L146 SmtUtils]: Spent 2047ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-01-29 22:52:08,803 WARN L146 SmtUtils]: Spent 654ms on a formula simplification. DAG size of input: 81 DAG size of output 67 [2018-01-29 22:52:09,259 WARN L146 SmtUtils]: Spent 347ms on a formula simplification. DAG size of input: 79 DAG size of output 65 [2018-01-29 22:52:10,579 WARN L146 SmtUtils]: Spent 869ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-29 22:52:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:13,431 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2018-01-29 22:52:13,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-29 22:52:13,432 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 43 [2018-01-29 22:52:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:13,433 INFO L225 Difference]: With dead ends: 167 [2018-01-29 22:52:13,433 INFO L226 Difference]: Without dead ends: 164 [2018-01-29 22:52:13,435 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=684, Invalid=3476, Unknown=0, NotChecked=0, Total=4160 [2018-01-29 22:52:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-29 22:52:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 87. [2018-01-29 22:52:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 22:52:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-01-29 22:52:13,448 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 43 [2018-01-29 22:52:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:13,449 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-01-29 22:52:13,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 22:52:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-01-29 22:52:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-29 22:52:13,450 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:13,450 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:13,451 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrreplaceErr4RequiresViolation, cstrreplaceErr5RequiresViolation, cstrreplaceErr3RequiresViolation, cstrreplaceErr0RequiresViolation, cstrreplaceErr1RequiresViolation, cstrreplaceErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-29 22:52:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash 35164530, now seen corresponding path program 1 times [2018-01-29 22:52:13,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:13,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:13,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:13,452 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:52:13,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:13,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:52:13,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:13,837 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:13,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:13,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:13,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:13,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:13,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:13,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:52:13,900 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-29 22:52:13,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-29 22:52:13,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:13,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:13,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:13,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-29 22:52:13,990 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-29 22:52:13,998 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-29 22:52:13,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:14,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:14,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:14,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-01-29 22:52:14,094 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-29 22:52:14,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:14,101 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-29 22:52:14,107 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-29 22:52:14,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:14,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:14,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:14,116 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:34 [2018-01-29 22:52:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:14,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:14,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2018-01-29 22:52:14,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 22:52:14,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 22:52:14,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-01-29 22:52:14,236 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 28 states. [2018-01-29 22:52:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:15,186 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2018-01-29 22:52:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:52:15,187 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2018-01-29 22:52:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:15,187 INFO L225 Difference]: With dead ends: 139 [2018-01-29 22:52:15,187 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 22:52:15,188 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=506, Invalid=1944, Unknown=0, NotChecked=0, Total=2450 [2018-01-29 22:52:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 22:52:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 22:52:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 22:52:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 22:52:15,189 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-01-29 22:52:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:15,189 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 22:52:15,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 22:52:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 22:52:15,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 22:52:15,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 22:52:15,281 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-29 22:52:15,284 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-29 22:52:15,335 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 169 DAG size of output 161 [2018-01-29 22:52:25,534 WARN L146 SmtUtils]: Spent 10187ms on a formula simplification. DAG size of input: 181 DAG size of output 68 [2018-01-29 22:52:25,674 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 68 DAG size of output 34 [2018-01-29 22:52:25,704 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,704 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L395 ceAbstractionStarter]: At program point cstrreplaceENTRY(lines 540 552) the Hoare annotation is: (let ((.cse0 (+ (select |#length| |cstrreplace_#in~s.base|) (- 1)))) (or (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) .cse0)) (not (= 1 (select |#valid| |cstrreplace_#in~s.base|))) (not (= 0 |cstrreplace_#in~s.offset|)) (not (exists ((main_~length1~5 Int)) (and (<= 1 main_~length1~5) (<= (+ main_~length1~5 |cstrreplace_#in~s.offset|) (select |#length| |cstrreplace_#in~s.base|)) (= 0 (select (select |old(#memory_int)| |cstrreplace_#in~s.base|) (+ main_~length1~5 |cstrreplace_#in~s.offset| (- 1))))))) (not (= 0 (select (select |old(#memory_int)| |cstrreplace_#in~s.base|) .cse0))))) [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 552) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point cstrreplaceFINAL(lines 540 552) no Hoare annotation was computed. [2018-01-29 22:52:25,705 INFO L399 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L545'''''(lines 545 548) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 552) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L544''''''(lines 544 550) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point cstrreplaceEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-29 22:52:25,706 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L395 ceAbstractionStarter]: At program point L544'''''(lines 544 550) the Hoare annotation is: (let ((.cse8 (+ (select |#length| |cstrreplace_#in~s.base|) (- 1))) (.cse7 (select |#length| cstrreplace_~p~2.base)) (.cse9 (select |#length| cstrreplace_~s.base))) (let ((.cse0 (= 0 (select (select |#memory_int| cstrreplace_~s.base) (+ .cse9 (- 1))))) (.cse3 (= 1 (select |#valid| cstrreplace_~s.base))) (.cse4 (<= 1 .cse9)) (.cse6 (= 1 (select |#valid| cstrreplace_~p~2.base))) (.cse5 (= 0 cstrreplace_~s.offset)) (.cse1 (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ .cse7 (- 1))))) (.cse2 (= 0 (select (select |#memory_int| |cstrreplace_#in~s.base|) .cse8)))) (or (not (= 0 |cstrreplace_#in~s.offset|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 cstrreplace_~p~2.offset) .cse6 (exists ((main_~length1~5 Int)) (and (<= 1 main_~length1~5) (<= (+ main_~length1~5 cstrreplace_~p~2.offset) (select |#length| cstrreplace_~p~2.base)) (= 0 (select (select |#memory_int| cstrreplace_~p~2.base) (+ main_~length1~5 cstrreplace_~p~2.offset (- 1))))))) (not (= 1 (select |#valid| |cstrreplace_#in~s.base|))) (and .cse0 (and .cse3 (<= 1 cstrreplace_~p~2.offset) .cse4 (<= (+ cstrreplace_~p~2.offset 1) .cse7) .cse6) .cse5 .cse1 .cse2) (not (exists ((main_~length1~5 Int)) (and (<= 1 main_~length1~5) (<= (+ main_~length1~5 |cstrreplace_#in~s.offset|) (select |#length| |cstrreplace_#in~s.base|)) (= 0 (select (select |old(#memory_int)| |cstrreplace_#in~s.base|) (+ main_~length1~5 |cstrreplace_#in~s.offset| (- 1))))))) (not (= 0 (select (select |old(#memory_int)| |cstrreplace_#in~s.base|) .cse8)))))) [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point cstrreplaceErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-01-29 22:52:25,707 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L560''''(line 560) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L560'''''(line 560) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L560'''(line 560) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L395 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 main_~nondetString1~5.offset) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= 0 (select (select |#memory_int| main_~nondetString1~5.base) (+ main_~nondetString1~5.offset (+ .cse0 (- 1))))) (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|))) [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-29 22:52:25,708 INFO L399 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-29 22:52:25,709 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-29 22:52:25,709 INFO L399 ceAbstractionStarter]: For program point L560''''''(line 560) no Hoare annotation was computed. [2018-01-29 22:52:25,709 INFO L399 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-01-29 22:52:25,709 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-29 22:52:25,709 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-29 22:52:25,709 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 22:52:25,709 INFO L399 ceAbstractionStarter]: For program point L560''(line 560) no Hoare annotation was computed. [2018-01-29 22:52:25,709 INFO L399 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-29 22:52:25,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,717 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,718 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,720 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,724 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,729 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,729 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,730 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,731 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,731 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,732 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,733 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,734 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:52:25 BoogieIcfgContainer [2018-01-29 22:52:25,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:52:25,737 INFO L168 Benchmark]: Toolchain (without parser) took 38035.84 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 267.8 MB in the beginning and 538.8 MB in the end (delta: -271.0 MB). Peak memory consumption was 223.2 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:25,738 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:52:25,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.26 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:25,739 INFO L168 Benchmark]: Boogie Preprocessor took 32.10 ms. Allocated memory is still 307.8 MB. Free memory was 256.6 MB in the beginning and 255.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-29 22:52:25,739 INFO L168 Benchmark]: RCFGBuilder took 250.29 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 237.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:25,739 INFO L168 Benchmark]: TraceAbstraction took 37543.64 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 237.0 MB in the beginning and 538.8 MB in the end (delta: -301.8 MB). Peak memory consumption was 192.4 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:25,741 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.17 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.26 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 256.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.10 ms. Allocated memory is still 307.8 MB. Free memory was 256.6 MB in the beginning and 255.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 250.29 ms. Allocated memory is still 307.8 MB. Free memory was 254.6 MB in the beginning and 237.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 37543.64 ms. Allocated memory was 307.8 MB in the beginning and 587.2 MB in the end (delta: 279.4 MB). Free memory was 237.0 MB in the beginning and 538.8 MB in the end (delta: -301.8 MB). Peak memory consumption was 192.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~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[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[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[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[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[main_~length1~5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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-29 22:52:25,747 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,748 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,748 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,749 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,749 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,749 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,749 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,750 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,751 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,752 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,753 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,753 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,753 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,753 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,753 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,754 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,756 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,757 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length1~5,QUANTIFIED] [2018-01-29 22:52:25,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,758 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,759 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,760 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 22:52:25,761 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-29 22:52:25,762 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((!(0 == s) || ((((((((0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 1 == \valid[s]) && 1 <= unknown-#length-unknown[s]) && 0 == s) && 0 == p) && 1 == \valid[p]) && (\exists main_~length1~5 : int :: (1 <= main_~length1~5 && main_~length1~5 + p <= unknown-#length-unknown[p]) && 0 == unknown-#memory_int-unknown[p][main_~length1~5 + p + -1]))) || !(1 == \valid[s])) || ((((0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] && (((1 == \valid[s] && 1 <= p) && 1 <= unknown-#length-unknown[s]) && p + 1 <= unknown-#length-unknown[p]) && 1 == \valid[p]) && 0 == s) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1])) || !(\exists main_~length1~5 : int :: (1 <= main_~length1~5 && main_~length1~5 + s <= unknown-#length-unknown[s]) && 0 == \old(unknown-#memory_int-unknown)[s][main_~length1~5 + s + -1])) || !(0 == \old(unknown-#memory_int-unknown)[s][unknown-#length-unknown[s] + -1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 9 error locations. SAFE Result, 37.4s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 10.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 445 SDtfs, 1560 SDslu, 2533 SDs, 0 SdLazy, 1387 SolverSat, 176 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 167 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 300 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1725 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2702 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 395 ConstructedInterpolants, 30 QuantifiedInterpolants, 171992 SizeOfPredicates, 52 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 12/102 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/strreplace-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-52-25-767.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-52-25-767.csv Received shutdown request...