java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/filter1.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:31:17,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:31:17,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:31:17,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:31:17,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:31:17,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:31:17,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:31:17,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:31:17,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:31:17,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:31:17,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:31:17,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:31:17,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:31:17,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:31:17,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:31:17,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:31:17,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:31:17,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:31:17,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:31:17,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:31:17,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:31:17,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:31:17,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:31:17,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:31:17,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:31:17,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:31:17,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:31:17,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:31:17,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:31:17,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:31:17,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:31:17,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:31:17,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:31:17,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:31:17,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:31:17,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:31:17,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:31:17,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:31:17,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:31:17,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:31:17,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:31:17,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:31:17,252 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:31:17,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:31:17,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:31:17,253 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:31:17,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:31:17,254 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:31:17,254 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:31:17,254 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:31:17,254 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:31:17,255 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:31:17,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:31:17,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:31:17,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:31:17,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:31:17,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:31:17,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:31:17,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:31:17,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:31:17,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:31:17,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:31:17,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:31:17,257 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:31:17,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:31:17,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:31:17,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:31:17,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:31:17,258 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:31:17,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:31:17,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:31:17,259 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:31:17,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:31:17,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:31:17,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:31:17,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:31:17,303 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:31:17,304 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/filter1.c.v+lhb-reducer.c [2019-09-10 01:31:17,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c3b6cd6/e22e7e8d0dbe401bbf4ddd18d44f7655/FLAG078af50c5 [2019-09-10 01:31:17,820 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:31:17,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/filter1.c.v+lhb-reducer.c [2019-09-10 01:31:17,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c3b6cd6/e22e7e8d0dbe401bbf4ddd18d44f7655/FLAG078af50c5 [2019-09-10 01:31:17,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18c3b6cd6/e22e7e8d0dbe401bbf4ddd18d44f7655 [2019-09-10 01:31:17,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:31:17,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:31:17,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:31:17,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:31:17,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:31:17,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:31:17" (1/1) ... [2019-09-10 01:31:17,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2243a972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:17, skipping insertion in model container [2019-09-10 01:31:17,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:31:17" (1/1) ... [2019-09-10 01:31:17,873 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:31:17,896 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:31:18,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:31:18,098 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:31:18,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:31:18,235 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:31:18,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18 WrapperNode [2019-09-10 01:31:18,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:31:18,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:31:18,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:31:18,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:31:18,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... [2019-09-10 01:31:18,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:31:18,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:31:18,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:31:18,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:31:18,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (1/1) ... No working directory specified, using /storage/repos/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 [2019-09-10 01:31:18,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:31:18,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:31:18,335 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:31:18,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:31:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 01:31:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-09-10 01:31:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:31:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:31:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:31:18,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:31:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:31:18,652 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:31:18,652 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:31:18,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:31:18 BoogieIcfgContainer [2019-09-10 01:31:18,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:31:18,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:31:18,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:31:18,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:31:18,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:31:17" (1/3) ... [2019-09-10 01:31:18,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f261fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:31:18, skipping insertion in model container [2019-09-10 01:31:18,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:31:18" (2/3) ... [2019-09-10 01:31:18,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f261fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:31:18, skipping insertion in model container [2019-09-10 01:31:18,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:31:18" (3/3) ... [2019-09-10 01:31:18,661 INFO L109 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2019-09-10 01:31:18,673 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:31:18,681 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 01:31:18,697 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 01:31:18,731 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:31:18,731 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:31:18,732 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:31:18,732 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:31:18,732 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:31:18,732 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:31:18,732 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:31:18,732 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:31:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-10 01:31:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:18,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:18,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:18,759 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2113161621, now seen corresponding path program 1 times [2019-09-10 01:31:18,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:18,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:18,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:18,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:18,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:18,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:18,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:31:18,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:18,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:31:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:31:18,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:31:18,965 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2019-09-10 01:31:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,046 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2019-09-10 01:31:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:31:19,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-10 01:31:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,057 INFO L225 Difference]: With dead ends: 58 [2019-09-10 01:31:19,058 INFO L226 Difference]: Without dead ends: 52 [2019-09-10 01:31:19,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-10 01:31:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2019-09-10 01:31:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-10 01:31:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2019-09-10 01:31:19,109 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2019-09-10 01:31:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,110 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2019-09-10 01:31:19,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:31:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2019-09-10 01:31:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:19,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,114 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2118082726, now seen corresponding path program 1 times [2019-09-10 01:31:19,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:31:19,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:31:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:31:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,198 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 3 states. [2019-09-10 01:31:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,252 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-09-10 01:31:19,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:31:19,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-10 01:31:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,255 INFO L225 Difference]: With dead ends: 61 [2019-09-10 01:31:19,255 INFO L226 Difference]: Without dead ends: 61 [2019-09-10 01:31:19,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-10 01:31:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2019-09-10 01:31:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-10 01:31:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-09-10 01:31:19,263 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-09-10 01:31:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,263 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-09-10 01:31:19,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:31:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-09-10 01:31:19,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:31:19,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,265 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,265 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash -867319772, now seen corresponding path program 1 times [2019-09-10 01:31:19,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:31:19,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:31:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:31:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:19,335 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2019-09-10 01:31:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,454 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-09-10 01:31:19,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:31:19,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-10 01:31:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,458 INFO L225 Difference]: With dead ends: 60 [2019-09-10 01:31:19,459 INFO L226 Difference]: Without dead ends: 60 [2019-09-10 01:31:19,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:31:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-10 01:31:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2019-09-10 01:31:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 01:31:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-09-10 01:31:19,466 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-09-10 01:31:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,467 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-09-10 01:31:19,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:31:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-09-10 01:31:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:31:19,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,469 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1140696651, now seen corresponding path program 1 times [2019-09-10 01:31:19,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:31:19,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:31:19,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:31:19,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,532 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 3 states. [2019-09-10 01:31:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,560 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-09-10 01:31:19,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:31:19,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-10 01:31:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,562 INFO L225 Difference]: With dead ends: 56 [2019-09-10 01:31:19,562 INFO L226 Difference]: Without dead ends: 56 [2019-09-10 01:31:19,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-10 01:31:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2019-09-10 01:31:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-10 01:31:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-09-10 01:31:19,568 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 18 [2019-09-10 01:31:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,569 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-09-10 01:31:19,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:31:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-09-10 01:31:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:31:19,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:31:19,571 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1259642561, now seen corresponding path program 1 times [2019-09-10 01:31:19,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 01:31:19,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 01:31:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 01:31:19,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:19,631 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2019-09-10 01:31:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,739 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-09-10 01:31:19,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:31:19,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-10 01:31:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,740 INFO L225 Difference]: With dead ends: 55 [2019-09-10 01:31:19,741 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 01:31:19,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 01:31:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 01:31:19,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2019-09-10 01:31:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-10 01:31:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-09-10 01:31:19,746 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2019-09-10 01:31:19,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,746 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-09-10 01:31:19,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 01:31:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-09-10 01:31:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:31:19,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,748 INFO L399 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] [2019-09-10 01:31:19,748 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1391760154, now seen corresponding path program 1 times [2019-09-10 01:31:19,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:31:19,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:31:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:31:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,809 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2019-09-10 01:31:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,817 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-09-10 01:31:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:31:19,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-10 01:31:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,819 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:31:19,819 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 01:31:19,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:31:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 01:31:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 01:31:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 01:31:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-10 01:31:19,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2019-09-10 01:31:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,823 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-10 01:31:19,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:31:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-10 01:31:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:31:19,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,824 INFO L399 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] [2019-09-10 01:31:19,825 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1502730495, now seen corresponding path program 1 times [2019-09-10 01:31:19,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:19,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:19,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 01:31:19,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:19,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:31:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:31:19,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:31:19,880 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-09-10 01:31:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:19,914 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-09-10 01:31:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 01:31:19,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-09-10 01:31:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:19,915 INFO L225 Difference]: With dead ends: 58 [2019-09-10 01:31:19,916 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 01:31:19,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:31:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 01:31:19,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2019-09-10 01:31:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:31:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-10 01:31:19,926 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2019-09-10 01:31:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:19,926 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-10 01:31:19,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:31:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-10 01:31:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-10 01:31:19,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:19,929 INFO L399 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] [2019-09-10 01:31:19,930 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:19,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1344039708, now seen corresponding path program 1 times [2019-09-10 01:31:19,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:19,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:19,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:19,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:20,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:20,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 01:31:20,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:20,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:31:20,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:31:20,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:31:20,034 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-09-10 01:31:20,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:20,157 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-09-10 01:31:20,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:31:20,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-10 01:31:20,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:20,159 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:31:20,159 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 01:31:20,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:31:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 01:31:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-10 01:31:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-10 01:31:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-09-10 01:31:20,166 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2019-09-10 01:31:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:20,168 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-09-10 01:31:20,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:31:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-09-10 01:31:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-10 01:31:20,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:31:20,172 INFO L399 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] [2019-09-10 01:31:20,172 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:31:20,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:31:20,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1772689557, now seen corresponding path program 1 times [2019-09-10 01:31:20,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:31:20,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:20,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:31:20,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:31:20,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:31:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:31:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:31:20,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:31:20,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 01:31:20,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:31:20,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:31:20,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:31:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 01:31:20,278 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 7 states. [2019-09-10 01:31:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:31:20,377 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-10 01:31:20,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:31:20,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-09-10 01:31:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:31:20,378 INFO L225 Difference]: With dead ends: 30 [2019-09-10 01:31:20,378 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:31:20,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-10 01:31:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:31:20,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:31:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:31:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:31:20,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-10 01:31:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:31:20,380 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:31:20,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:31:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:31:20,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:31:20,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:31:20 BoogieIcfgContainer [2019-09-10 01:31:20,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:31:20,388 INFO L168 Benchmark]: Toolchain (without parser) took 2529.69 ms. Allocated memory was 134.7 MB in the beginning and 230.7 MB in the end (delta: 95.9 MB). Free memory was 90.7 MB in the beginning and 134.7 MB in the end (delta: -44.0 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:20,389 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 01:31:20,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.13 ms. Allocated memory was 134.7 MB in the beginning and 202.9 MB in the end (delta: 68.2 MB). Free memory was 90.5 MB in the beginning and 179.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:20,390 INFO L168 Benchmark]: Boogie Preprocessor took 30.12 ms. Allocated memory is still 202.9 MB. Free memory was 179.2 MB in the beginning and 177.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:20,391 INFO L168 Benchmark]: RCFGBuilder took 386.79 ms. Allocated memory is still 202.9 MB. Free memory was 177.4 MB in the beginning and 160.7 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:20,392 INFO L168 Benchmark]: TraceAbstraction took 1730.89 ms. Allocated memory was 202.9 MB in the beginning and 230.7 MB in the end (delta: 27.8 MB). Free memory was 160.1 MB in the beginning and 134.7 MB in the end (delta: 25.4 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2019-09-10 01:31:20,396 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 109.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.13 ms. Allocated memory was 134.7 MB in the beginning and 202.9 MB in the end (delta: 68.2 MB). Free memory was 90.5 MB in the beginning and 179.2 MB in the end (delta: -88.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.12 ms. Allocated memory is still 202.9 MB. Free memory was 179.2 MB in the beginning and 177.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.79 ms. Allocated memory is still 202.9 MB. Free memory was 177.4 MB in the beginning and 160.7 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1730.89 ms. Allocated memory was 202.9 MB in the beginning and 230.7 MB in the end (delta: 27.8 MB). Free memory was 160.1 MB in the beginning and 134.7 MB in the end (delta: 25.4 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 99]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 53]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 2 error locations. SAFE Result, 1.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 311 SDtfs, 356 SDslu, 421 SDs, 0 SdLazy, 205 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 117 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 12562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...