java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:51:00,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:51:00,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:51:00,061 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:51:00,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:51:00,062 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:51:00,063 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:51:00,064 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:51:00,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:51:00,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:51:00,067 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:51:00,067 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:51:00,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:51:00,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:51:00,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:51:00,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:51:00,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:51:00,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:51:00,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:51:00,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:51:00,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:51:00,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:51:00,080 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:51:00,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:51:00,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:51:00,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:51:00,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:51:00,084 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:51:00,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:51:00,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:51:00,085 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:51:00,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:51:00,095 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:51:00,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:51:00,096 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:51:00,096 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:51:00,096 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:51:00,096 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:51:00,097 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:51:00,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:51:00,097 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:51:00,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:51:00,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:51:00,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:51:00,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:51:00,098 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:51:00,099 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:51:00,099 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:51:00,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:51:00,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:51:00,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:51:00,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:51:00,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:51:00,100 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:51:00,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:51:00,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:51:00,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:51:00,101 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:51:00,101 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:51:00,101 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:51:00,101 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:51:00,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:51:00,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:51:00,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:51:00,103 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:51:00,103 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:51:00,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:51:00,148 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:51:00,152 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:51:00,154 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:51:00,154 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:51:00,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:51:00,335 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:51:00,340 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:51:00,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:51:00,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:51:00,345 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:51:00,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f741a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00, skipping insertion in model container [2018-01-24 12:51:00,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,360 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:51:00,397 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:51:00,509 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:51:00,526 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:51:00,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00 WrapperNode [2018-01-24 12:51:00,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:51:00,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:51:00,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:51:00,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:51:00,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (1/1) ... [2018-01-24 12:51:00,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:51:00,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:51:00,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:51:00,564 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:51:00,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:51:00,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:51:00,612 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:51:00,612 INFO L136 BoogieDeclarations]: Found implementation of procedure cstpcpy [2018-01-24 12:51:00,612 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:51:00,612 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:51:00,612 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:51:00,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:51:00,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:51:00,613 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:51:00,613 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:51:00,613 INFO L128 BoogieDeclarations]: Found specification of procedure cstpcpy [2018-01-24 12:51:00,613 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:51:00,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:51:00,613 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:51:00,788 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:51:00,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:51:00 BoogieIcfgContainer [2018-01-24 12:51:00,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:51:00,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:51:00,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:51:00,792 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:51:00,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:51:00" (1/3) ... [2018-01-24 12:51:00,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ed6c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:51:00, skipping insertion in model container [2018-01-24 12:51:00,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:51:00" (2/3) ... [2018-01-24 12:51:00,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ed6c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:51:00, skipping insertion in model container [2018-01-24 12:51:00,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:51:00" (3/3) ... [2018-01-24 12:51:00,794 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:51:00,801 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:51:00,806 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 12:51:00,844 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:51:00,844 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:51:00,844 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:51:00,844 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:51:00,845 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:51:00,845 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:51:00,845 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:51:00,845 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:51:00,846 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:51:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-24 12:51:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 12:51:00,874 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:00,875 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:00,875 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1122979584, now seen corresponding path program 1 times [2018-01-24 12:51:00,883 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:00,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:00,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:00,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:00,925 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:00,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:01,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:01,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:51:01,021 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:01,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:51:01,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:51:01,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:51:01,035 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-01-24 12:51:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:01,102 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-24 12:51:01,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:51:01,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-24 12:51:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:01,179 INFO L225 Difference]: With dead ends: 54 [2018-01-24 12:51:01,179 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 12:51:01,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:51:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 12:51:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 12:51:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 12:51:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 12:51:01,209 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-01-24 12:51:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:01,210 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 12:51:01,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:51:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 12:51:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:51:01,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:01,211 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:01,211 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226348, now seen corresponding path program 1 times [2018-01-24 12:51:01,211 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:01,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:01,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,213 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:01,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:01,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:01,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:51:01,276 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:01,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:51:01,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:51:01,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:51:01,279 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-01-24 12:51:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:01,356 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 12:51:01,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:51:01,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:51:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:01,358 INFO L225 Difference]: With dead ends: 37 [2018-01-24 12:51:01,358 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:51:01,359 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:51:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:51:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 12:51:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:51:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:51:01,365 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-01-24 12:51:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:01,365 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:51:01,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:51:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:51:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:51:01,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:01,366 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:01,366 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1918226347, now seen corresponding path program 1 times [2018-01-24 12:51:01,367 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:01,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:01,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,368 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:01,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:01,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:01,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:51:01,498 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:01,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:51:01,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:51:01,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:51:01,499 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-24 12:51:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:01,537 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 12:51:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:51:01,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:51:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:01,538 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:51:01,538 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 12:51:01,539 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:51:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 12:51:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 12:51:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:51:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 12:51:01,545 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-01-24 12:51:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:01,545 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 12:51:01,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:51:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 12:51:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:51:01,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:01,546 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:01,546 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633306, now seen corresponding path program 1 times [2018-01-24 12:51:01,547 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:01,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:01,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:01,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:01,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:01,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:51:01,606 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:01,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:51:01,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:51:01,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:51:01,607 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-01-24 12:51:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:01,674 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-24 12:51:01,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:51:01,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 12:51:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:01,676 INFO L225 Difference]: With dead ends: 35 [2018-01-24 12:51:01,676 INFO L226 Difference]: Without dead ends: 34 [2018-01-24 12:51:01,676 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:51:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-24 12:51:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-24 12:51:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 12:51:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-24 12:51:01,682 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-24 12:51:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:01,682 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-24 12:51:01,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:51:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-24 12:51:01,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:51:01,683 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:01,683 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:01,683 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:01,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1371633307, now seen corresponding path program 1 times [2018-01-24 12:51:01,683 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:01,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:01,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,685 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:01,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:01,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:01,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:51:01,791 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:01,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:51:01,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:51:01,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:51:01,792 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-24 12:51:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:01,893 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 12:51:01,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:51:01,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 12:51:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:01,897 INFO L225 Difference]: With dead ends: 45 [2018-01-24 12:51:01,897 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 12:51:01,898 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:51:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 12:51:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-01-24 12:51:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:51:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:51:01,904 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-01-24 12:51:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:01,905 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:51:01,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:51:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:51:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:51:01,906 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:01,906 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:01,906 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:01,906 INFO L82 PathProgramCache]: Analyzing trace with hash -429040459, now seen corresponding path program 1 times [2018-01-24 12:51:01,907 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:01,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:01,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:01,908 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:01,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:01,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:01,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:51:01,993 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:01,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:51:01,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:51:01,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:51:01,995 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 8 states. [2018-01-24 12:51:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:02,075 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 12:51:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:51:02,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 12:51:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:02,077 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:51:02,077 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 12:51:02,077 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:51:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 12:51:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 12:51:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:51:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 12:51:02,082 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-01-24 12:51:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:02,082 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 12:51:02,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:51:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 12:51:02,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:51:02,083 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:02,083 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:02,083 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:02,083 INFO L82 PathProgramCache]: Analyzing trace with hash -429040458, now seen corresponding path program 1 times [2018-01-24 12:51:02,084 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:02,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:02,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:02,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:02,085 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:02,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:02,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:02,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:51:02,213 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:02,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:51:02,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:51:02,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:51:02,214 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 8 states. [2018-01-24 12:51:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:02,348 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 12:51:02,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:51:02,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 12:51:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:02,349 INFO L225 Difference]: With dead ends: 42 [2018-01-24 12:51:02,350 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 12:51:02,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:51:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 12:51:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-01-24 12:51:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:51:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-24 12:51:02,356 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-01-24 12:51:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:02,356 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-24 12:51:02,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:51:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-24 12:51:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:51:02,357 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:02,357 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:02,358 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:02,358 INFO L82 PathProgramCache]: Analyzing trace with hash 39867865, now seen corresponding path program 1 times [2018-01-24 12:51:02,358 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:02,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:02,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:02,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:02,359 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:02,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:02,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:02,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 12:51:02,537 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:02,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:51:02,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:51:02,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:51:02,538 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 11 states. [2018-01-24 12:51:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:02,731 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-24 12:51:02,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:51:02,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-24 12:51:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:02,732 INFO L225 Difference]: With dead ends: 91 [2018-01-24 12:51:02,732 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 12:51:02,733 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:51:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 12:51:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-01-24 12:51:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:51:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-24 12:51:02,747 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2018-01-24 12:51:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:02,747 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-24 12:51:02,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:51:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-24 12:51:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:51:02,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:02,748 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:02,749 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1548480037, now seen corresponding path program 1 times [2018-01-24 12:51:02,749 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:02,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:02,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:02,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:02,750 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:02,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:03,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:51:03,000 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:51:03,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:03,006 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:51:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:03,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:51:03,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 12:51:03,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 12:51:03,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:51:03,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:51:03,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 12:51:03,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 12:51:03,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:51:03,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:51:03,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:51:03,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:51:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:03,292 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:51:03,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 12:51:03,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 12:51:03,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:51:03,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,448 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,453 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:51:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:03,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:51:03,483 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:51:03,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:03,487 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:51:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:03,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:51:03,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:03,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:51:03,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:51:03,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:51:03,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:51:03,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:51:03,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-24 12:51:03,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:51:03,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:51:03,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:51:03,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 12:51:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:03,743 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:51:03,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 12:51:03,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:51:03,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:03,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:51:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:03,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:51:03,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 10, 10] total 32 [2018-01-24 12:51:03,887 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:51:03,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:51:03,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:51:03,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:51:03,888 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 16 states. [2018-01-24 12:51:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:04,227 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-24 12:51:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:51:04,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-24 12:51:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:04,229 INFO L225 Difference]: With dead ends: 67 [2018-01-24 12:51:04,229 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 12:51:04,230 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:51:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 12:51:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 12:51:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 12:51:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 12:51:04,240 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-01-24 12:51:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:04,241 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 12:51:04,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:51:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 12:51:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:51:04,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:04,242 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:04,242 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash -758240906, now seen corresponding path program 1 times [2018-01-24 12:51:04,243 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:04,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:04,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:04,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:04,244 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:04,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:04,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:51:04,557 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:51:04,563 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:04,564 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:51:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:04,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:51:04,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:04,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:04,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:04,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:04,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:04,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 12:51:04,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:51:04,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:51:04,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:51:04,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:04,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 12:51:04,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:04,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:04,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-01-24 12:51:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:04,813 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:51:05,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 12:51:05,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 12:51:05,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 12:51:05,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,258 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:51:05,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 12:51:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:05,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:51:05,317 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:51:05,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:05,321 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:51:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:05,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:51:05,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:05,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:05,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-01-24 12:51:05,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:51:05,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:51:05,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:51:05,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 12:51:05,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-01-24 12:51:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:05,694 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:51:05,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 12:51:05,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:05,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 12:51:06,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 12:51:06,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,009 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:51:06,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 12:51:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:06,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:51:06,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12, 10, 11] total 42 [2018-01-24 12:51:06,021 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:51:06,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:51:06,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:51:06,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 12:51:06,022 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 22 states. [2018-01-24 12:51:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:06,581 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-24 12:51:06,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:51:06,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-01-24 12:51:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:06,583 INFO L225 Difference]: With dead ends: 65 [2018-01-24 12:51:06,583 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 12:51:06,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2018-01-24 12:51:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 12:51:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-24 12:51:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 12:51:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-01-24 12:51:06,592 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 24 [2018-01-24 12:51:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:06,593 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-01-24 12:51:06,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:51:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-01-24 12:51:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:51:06,594 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:06,594 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:06,595 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash 67945113, now seen corresponding path program 2 times [2018-01-24 12:51:06,595 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:06,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:06,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:51:06,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:06,597 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:06,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:06,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:51:06,870 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:51:06,878 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:51:06,878 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:51:06,889 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:51:06,893 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:51:06,895 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:51:06,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:51:06,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:06,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:51:06,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:51:06,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:51:06,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:51:06,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:06,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 12:51:06,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:51:06,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:51:06,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:06,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-24 12:51:07,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 12:51:07,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:51:07,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:51:07,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-24 12:51:07,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 12:51:07,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:51:07,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:51:07,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:51:07,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:51:07,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-24 12:51:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:07,166 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:51:07,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-01-24 12:51:07,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:51:07,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:51:07,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 12:51:07,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 12:51:07,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 12:51:07,584 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,587 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:51:07,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-01-24 12:51:07,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:51:07,676 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:51:07,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 12:51:07,696 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,698 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 12:51:07,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 12:51:07,701 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,704 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:07,718 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:51:07,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 12:51:07,787 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:129, output treesize:244 [2018-01-24 12:51:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:07,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:51:07,997 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:51:08,000 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:51:08,000 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:51:08,014 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:51:08,033 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:51:08,068 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:51:08,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:51:08,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:08,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:51:08,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:51:08,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,093 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:51:08,094 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:51:08,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:51:08,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 12:51:08,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:51:08,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:51:08,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-24 12:51:08,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 12:51:08,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:51:08,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:19 [2018-01-24 12:51:08,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 12:51:08,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:51:08,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:51:08,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:51:08,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:51:08,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:49 [2018-01-24 12:51:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:08,327 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:51:08,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 12:51:08,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:51:08,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:51:08,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 12:51:08,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 12:51:08,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 12:51:08,599 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:51:08,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:51:08,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:51:08,630 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:60, output treesize:125 [2018-01-24 12:51:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:08,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:51:08,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13, 13, 13] total 44 [2018-01-24 12:51:08,823 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:51:08,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:51:08,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:51:08,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1821, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 12:51:08,824 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 20 states. [2018-01-24 12:51:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:09,627 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 12:51:09,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:51:09,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-01-24 12:51:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:09,629 INFO L225 Difference]: With dead ends: 64 [2018-01-24 12:51:09,629 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 12:51:09,630 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=349, Invalid=2843, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 12:51:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 12:51:09,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2018-01-24 12:51:09,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 12:51:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 12:51:09,638 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 28 [2018-01-24 12:51:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:09,639 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 12:51:09,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:51:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 12:51:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:51:09,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:51:09,640 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:51:09,640 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, cstpcpyErr0RequiresViolation, cstpcpyErr3RequiresViolation, cstpcpyErr1RequiresViolation, cstpcpyErr2RequiresViolation]=== [2018-01-24 12:51:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1163981862, now seen corresponding path program 1 times [2018-01-24 12:51:09,640 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:51:09,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:09,641 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:51:09,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:51:09,642 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:51:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:51:09,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:51:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:51:09,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:51:09,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:51:09,743 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:51:09,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:51:09,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:51:09,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:51:09,743 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 6 states. [2018-01-24 12:51:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:51:09,806 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 12:51:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:51:09,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 12:51:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:51:09,806 INFO L225 Difference]: With dead ends: 47 [2018-01-24 12:51:09,807 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:51:09,807 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:51:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:51:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:51:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:51:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:51:09,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 12:51:09,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:51:09,808 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:51:09,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:51:09,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:51:09,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:51:09,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:51:09,852 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:51:10,180 WARN L146 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 75 DAG size of output 44 [2018-01-24 12:51:10,427 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 71 DAG size of output 55 [2018-01-24 12:51:10,822 WARN L146 SmtUtils]: Spent 392ms on a formula simplification. DAG size of input: 137 DAG size of output 94 [2018-01-24 12:51:10,826 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point L551'(lines 551 553) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 545 560) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point L548(lines 548 550) no Hoare annotation was computed. [2018-01-24 12:51:10,827 INFO L401 ceAbstractionStarter]: For program point L555'''(line 555) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 545 560) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 545 560) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 545 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-24 12:51:10,828 INFO L397 ceAbstractionStarter]: At program point L557'(line 557) the Hoare annotation is: (let ((.cse1 (select |#length| |main_#t~malloc7.base|)) (.cse0 (select |#length| main_~nondetString~4.base))) (and (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| |main_#t~malloc7.base|)) (<= main_~length2~4 main_~length1~4) (= (select |#valid| main_~nondetArea~4.base) 1) (<= 1 main_~length2~4) (<= main_~length2~4 (select |#length| |main_#t~malloc6.base|)) (not (= main_~nondetArea~4.base main_~nondetString~4.base)) (= 0 |main_#t~malloc7.offset|) (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (= main_~nondetString~4.offset 0) (= 0 main_~nondetArea~4.offset) (= 1 (select |#valid| main_~nondetString~4.base)) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|)) (= .cse0 main_~length2~4) (= main_~length2~4 .cse1) (<= .cse1 (select |#length| main_~nondetArea~4.base)) (not (= |main_#t~malloc7.base| main_~nondetArea~4.base)) (= 0 (select (select |#memory_int| main_~nondetString~4.base) (+ main_~nondetString~4.offset .cse0 (- 1)))) (= (select |#valid| |main_#t~malloc6.base|) 1))) [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point L548''(lines 548 550) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L397 ceAbstractionStarter]: At program point cstpcpyENTRY(lines 540 544) the Hoare annotation is: (let ((.cse11 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse2 (select |old(#memory_int)| |cstpcpy_#in~from.base|)) (.cse10 (+ .cse11 |cstpcpy_#in~from.offset| (- 1)))) (let ((.cse0 (not (= 0 |cstpcpy_#in~from.offset|))) (.cse1 (not (= (select |#valid| |cstpcpy_#in~to.base|) 1))) (.cse3 (not (= 1 (select |#valid| |cstpcpy_#in~from.base|)))) (.cse4 (< .cse11 1)) (.cse6 (not (= (select .cse2 .cse10) 0))) (.cse7 (not (= |cstpcpy_#in~to.offset| 0))) (.cse5 (select |#memory_int| |cstpcpy_#in~from.base|)) (.cse8 (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|)) (.cse9 (< (select |#length| |cstpcpy_#in~to.base|) .cse11))) (and (or .cse0 .cse1 (not (= (select .cse2 |cstpcpy_#in~from.offset|) 0)) .cse3 .cse4 (= 0 (select .cse5 |cstpcpy_#in~from.offset|)) .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 (= 0 (select .cse5 .cse10)) .cse8 .cse9))))) [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point cstpcpyErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point L542''''(line 542) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point L542''''''(line 542) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point cstpcpyEXIT(lines 540 544) no Hoare annotation was computed. [2018-01-24 12:51:10,829 INFO L401 ceAbstractionStarter]: For program point cstpcpyFINAL(lines 540 544) no Hoare annotation was computed. [2018-01-24 12:51:10,830 INFO L397 ceAbstractionStarter]: At program point L542'''''(line 542) the Hoare annotation is: (let ((.cse3 (select |old(#memory_int)| |cstpcpy_#in~from.base|)) (.cse19 (select |#length| |cstpcpy_#in~from.base|))) (let ((.cse1 (not (= 0 |cstpcpy_#in~from.offset|))) (.cse2 (not (= (select |#valid| |cstpcpy_#in~to.base|) 1))) (.cse4 (not (= 1 (select |#valid| |cstpcpy_#in~from.base|)))) (.cse5 (< .cse19 1)) (.cse0 (= cstpcpy_~from.offset 0)) (.cse6 (not (= (select .cse3 (+ .cse19 |cstpcpy_#in~from.offset| (- 1))) 0))) (.cse7 (not (= |cstpcpy_#in~to.offset| 0))) (.cse8 (= |cstpcpy_#in~from.base| |cstpcpy_#in~to.base|)) (.cse9 (< (select |#length| |cstpcpy_#in~to.base|) .cse19))) (and (or (and (= 0 (select (select |#memory_int| cstpcpy_~from.base) cstpcpy_~from.offset)) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) |cstpcpy_#in~from.offset|)) .cse0) .cse1 .cse2 (not (= (select .cse3 |cstpcpy_#in~from.offset|) 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse4 .cse5 (let ((.cse17 (select |#length| cstpcpy_~to.base)) (.cse16 (select |#length| cstpcpy_~from.base))) (let ((.cse14 (<= (+ cstpcpy_~from.offset 1) .cse16)) (.cse15 (<= 1 cstpcpy_~to.offset)) (.cse10 (= 1 (select |#valid| cstpcpy_~to.base))) (.cse11 (= 1 (select |#valid| cstpcpy_~from.base))) (.cse12 (not (= cstpcpy_~from.base cstpcpy_~to.base))) (.cse13 (<= .cse16 .cse17)) (.cse18 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_4 Int)) (and (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 cstpcpy_~from.offset) (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_4) (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 0) (= (select (select |#memory_int| cstpcpy_~from.base) (+ (select |#length| cstpcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_4 (- 1))) 0))))) (or (and .cse10 (<= cstpcpy_~to.offset 1) .cse11 .cse12 .cse13 .cse14 (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_4 Int)) (and (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_4) (<= (+ v_main_~nondetString~4.offset_BEFORE_CALL_4 1) cstpcpy_~from.offset) (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 0) (= (select (select |#memory_int| cstpcpy_~from.base) (+ (select |#length| cstpcpy_~from.base) v_main_~nondetString~4.offset_BEFORE_CALL_4 (- 1))) 0))) .cse15) (and .cse10 .cse11 .cse12 .cse14 (<= (+ .cse16 cstpcpy_~to.offset) (+ .cse17 cstpcpy_~from.offset)) .cse15 .cse18 (<= 2 cstpcpy_~from.offset)) (and (exists ((v_main_~nondetString~4.offset_BEFORE_CALL_4 Int)) (and (<= 0 v_main_~nondetString~4.offset_BEFORE_CALL_4) (= 0 (select (select |#memory_int| |cstpcpy_#in~from.base|) (+ v_main_~nondetString~4.offset_BEFORE_CALL_4 (select |#length| |cstpcpy_#in~from.base|) (- 1)))) (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 0) (<= v_main_~nondetString~4.offset_BEFORE_CALL_4 |cstpcpy_#in~from.offset|))) (= cstpcpy_~to.offset 0) .cse10 .cse11 .cse12 (<= 1 .cse16) .cse13 .cse18 .cse0)))) .cse6 .cse7 .cse8 .cse9)))) [2018-01-24 12:51:10,839 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,841 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,842 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,843 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,845 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,846 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,851 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,863 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,863 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,863 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,864 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,864 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,865 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,865 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,865 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,865 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,867 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,868 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,868 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,868 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,869 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,869 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,869 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,869 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,873 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,874 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,874 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,874 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,874 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,875 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,875 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:51:10 BoogieIcfgContainer [2018-01-24 12:51:10,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:51:10,879 INFO L168 Benchmark]: Toolchain (without parser) took 10543.35 ms. Allocated memory was 302.5 MB in the beginning and 592.4 MB in the end (delta: 289.9 MB). Free memory was 261.6 MB in the beginning and 481.5 MB in the end (delta: -219.9 MB). Peak memory consumption was 226.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:51:10,880 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 302.5 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:51:10,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.22 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:51:10,881 INFO L168 Benchmark]: Boogie Preprocessor took 29.07 ms. Allocated memory is still 302.5 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:51:10,882 INFO L168 Benchmark]: RCFGBuilder took 225.05 ms. Allocated memory is still 302.5 MB. Free memory was 249.6 MB in the beginning and 233.0 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:51:10,882 INFO L168 Benchmark]: TraceAbstraction took 10088.06 ms. Allocated memory was 302.5 MB in the beginning and 592.4 MB in the end (delta: 289.9 MB). Free memory was 233.0 MB in the beginning and 481.5 MB in the end (delta: -248.6 MB). Peak memory consumption was 197.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:51:10,884 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 302.5 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.22 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.07 ms. Allocated memory is still 302.5 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 225.05 ms. Allocated memory is still 302.5 MB. Free memory was 249.6 MB in the beginning and 233.0 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10088.06 ms. Allocated memory was 302.5 MB in the beginning and 592.4 MB in the end (delta: 289.9 MB). Free memory was 233.0 MB in the beginning and 481.5 MB in the end (delta: -248.6 MB). Peak memory consumption was 197.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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: 545]: 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 - 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 - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 542]: Loop Invariant [2018-01-24 12:51:10,893 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,894 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,895 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,895 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,895 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,895 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,896 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,897 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,897 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,898 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,898 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,898 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,898 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,899 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,900 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,901 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,902 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,903 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,904 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,910 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,911 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString~4.offset_BEFORE_CALL_4,QUANTIFIED] [2018-01-24 12:51:10,911 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,912 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,913 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,914 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-24 12:51:10,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:51:10,915 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((0 == unknown-#memory_int-unknown[from][from] && 0 == unknown-#memory_int-unknown[from][from]) && from == 0) || !(0 == from)) || !(\valid[to] == 1)) || !(\old(unknown-#memory_int-unknown)[from][from] == 0)) || !(1 == \valid[from])) || unknown-#length-unknown[from] < 1) || !(\old(unknown-#memory_int-unknown)[from][unknown-#length-unknown[from] + from + -1] == 0)) || !(to == 0)) || from == to) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) && ((((((((!(0 == from) || !(\valid[to] == 1)) || !(1 == \valid[from])) || unknown-#length-unknown[from] < 1) || ((((((((1 == \valid[to] && to <= 1) && 1 == \valid[from]) && !(from == to)) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && from + 1 <= unknown-#length-unknown[from]) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_4 : int :: ((0 <= v_main_~nondetString~4.offset_BEFORE_CALL_4 && v_main_~nondetString~4.offset_BEFORE_CALL_4 + 1 <= from) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= 0) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_4 + -1] == 0)) && 1 <= to) || (((((((1 == \valid[to] && 1 == \valid[from]) && !(from == to)) && from + 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] + to <= unknown-#length-unknown[to] + from) && 1 <= to) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_4 <= from && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_4) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= 0) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_4 + -1] == 0)) && 2 <= from)) || (((((((((\exists v_main_~nondetString~4.offset_BEFORE_CALL_4 : int :: ((0 <= v_main_~nondetString~4.offset_BEFORE_CALL_4 && 0 == unknown-#memory_int-unknown[from][v_main_~nondetString~4.offset_BEFORE_CALL_4 + unknown-#length-unknown[from] + -1]) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= 0) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= from) && to == 0) && 1 == \valid[to]) && 1 == \valid[from]) && !(from == to)) && 1 <= unknown-#length-unknown[from]) && unknown-#length-unknown[from] <= unknown-#length-unknown[to]) && (\exists v_main_~nondetString~4.offset_BEFORE_CALL_4 : int :: ((v_main_~nondetString~4.offset_BEFORE_CALL_4 <= from && 0 <= v_main_~nondetString~4.offset_BEFORE_CALL_4) && v_main_~nondetString~4.offset_BEFORE_CALL_4 <= 0) && unknown-#memory_int-unknown[from][unknown-#length-unknown[from] + v_main_~nondetString~4.offset_BEFORE_CALL_4 + -1] == 0)) && from == 0)) || !(\old(unknown-#memory_int-unknown)[from][unknown-#length-unknown[from] + from + -1] == 0)) || !(to == 0)) || from == to) || unknown-#length-unknown[to] < unknown-#length-unknown[from]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 9.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 491 SDslu, 1428 SDs, 0 SdLazy, 1378 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 211 SyntacticMatches, 20 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 568 HoareAnnotationTreeSize, 9 FomulaSimplifications, 298 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 776 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 515 ConstructedInterpolants, 36 QuantifiedInterpolants, 126882 SizeOfPredicates, 81 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 2/72 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-51-10-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-51-10-920.csv Received shutdown request...