./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 253410f53553d69ef02e4dba1b07bb26de7bec75 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 14:58:22,171 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 14:58:22,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 14:58:22,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 14:58:22,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 14:58:22,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 14:58:22,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 14:58:22,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 14:58:22,191 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 14:58:22,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 14:58:22,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 14:58:22,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 14:58:22,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 14:58:22,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 14:58:22,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 14:58:22,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 14:58:22,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 14:58:22,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 14:58:22,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 14:58:22,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 14:58:22,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 14:58:22,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 14:58:22,210 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 14:58:22,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 14:58:22,211 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 14:58:22,212 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 14:58:22,213 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 14:58:22,214 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 14:58:22,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 14:58:22,216 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 14:58:22,216 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 14:58:22,217 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 14:58:22,218 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 14:58:22,218 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 14:58:22,219 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 14:58:22,220 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 14:58:22,220 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 14:58:22,236 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 14:58:22,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 14:58:22,238 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 14:58:22,238 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 14:58:22,238 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 14:58:22,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 14:58:22,239 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 14:58:22,239 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 14:58:22,239 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 14:58:22,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 14:58:22,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 14:58:22,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 14:58:22,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 14:58:22,240 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 14:58:22,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 14:58:22,240 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 14:58:22,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 14:58:22,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 14:58:22,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 14:58:22,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 14:58:22,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 14:58:22,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 14:58:22,244 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 14:58:22,244 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 14:58:22,244 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 14:58:22,244 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 14:58:22,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 14:58:22,244 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 253410f53553d69ef02e4dba1b07bb26de7bec75 [2019-01-14 14:58:22,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 14:58:22,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 14:58:22,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 14:58:22,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 14:58:22,297 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 14:58:22,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:22,350 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428b94a46/da4a0b44c3954b2d983b3c00d64d482f/FLAGe350155ff [2019-01-14 14:58:22,810 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 14:58:22,811 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ssh-simplified/s3_srvr_1a_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:22,819 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428b94a46/da4a0b44c3954b2d983b3c00d64d482f/FLAGe350155ff [2019-01-14 14:58:23,163 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428b94a46/da4a0b44c3954b2d983b3c00d64d482f [2019-01-14 14:58:23,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 14:58:23,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 14:58:23,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 14:58:23,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 14:58:23,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 14:58:23,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b41bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23, skipping insertion in model container [2019-01-14 14:58:23,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 14:58:23,228 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 14:58:23,457 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:58:23,464 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 14:58:23,496 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 14:58:23,510 INFO L195 MainTranslator]: Completed translation [2019-01-14 14:58:23,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23 WrapperNode [2019-01-14 14:58:23,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 14:58:23,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 14:58:23,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 14:58:23,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 14:58:23,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 14:58:23,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 14:58:23,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 14:58:23,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 14:58:23,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (1/1) ... [2019-01-14 14:58:23,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 14:58:23,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 14:58:23,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 14:58:23,644 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 14:58:23,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (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-01-14 14:58:23,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 14:58:23,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 14:58:24,165 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 14:58:24,166 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 14:58:24,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:24 BoogieIcfgContainer [2019-01-14 14:58:24,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 14:58:24,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 14:58:24,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 14:58:24,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 14:58:24,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:58:23" (1/3) ... [2019-01-14 14:58:24,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99f19fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:58:24, skipping insertion in model container [2019-01-14 14:58:24,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:58:23" (2/3) ... [2019-01-14 14:58:24,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99f19fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:58:24, skipping insertion in model container [2019-01-14 14:58:24,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:24" (3/3) ... [2019-01-14 14:58:24,175 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a_true-unreach-call_false-termination.cil.c [2019-01-14 14:58:24,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 14:58:24,193 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 14:58:24,209 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 14:58:24,241 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 14:58:24,242 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 14:58:24,242 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 14:58:24,242 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 14:58:24,242 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 14:58:24,242 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 14:58:24,242 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 14:58:24,243 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 14:58:24,243 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 14:58:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-14 14:58:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 14:58:24,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:24,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 14:58:24,265 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 963516, now seen corresponding path program 1 times [2019-01-14 14:58:24,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:24,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:24,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:24,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:24,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:24,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:24,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 14:58:24,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:24,409 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-01-14 14:58:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:24,573 INFO L93 Difference]: Finished difference Result 131 states and 218 transitions. [2019-01-14 14:58:24,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:24,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 14:58:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:24,585 INFO L225 Difference]: With dead ends: 131 [2019-01-14 14:58:24,585 INFO L226 Difference]: Without dead ends: 79 [2019-01-14 14:58:24,589 INFO L631 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 [2019-01-14 14:58:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-14 14:58:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-14 14:58:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 14:58:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2019-01-14 14:58:24,629 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 4 [2019-01-14 14:58:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:24,629 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2019-01-14 14:58:24,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2019-01-14 14:58:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 14:58:24,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:24,631 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:24,631 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:24,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash -737314741, now seen corresponding path program 1 times [2019-01-14 14:58:24,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:24,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:24,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 14:58:24,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:24,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:24,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:24,667 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand 3 states. [2019-01-14 14:58:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:24,904 INFO L93 Difference]: Finished difference Result 157 states and 249 transitions. [2019-01-14 14:58:24,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:24,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 14:58:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:24,908 INFO L225 Difference]: With dead ends: 157 [2019-01-14 14:58:24,909 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 14:58:24,910 INFO L631 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-01-14 14:58:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 14:58:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-14 14:58:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 14:58:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2019-01-14 14:58:24,928 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 9 [2019-01-14 14:58:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:24,929 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2019-01-14 14:58:24,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2019-01-14 14:58:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 14:58:24,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:24,930 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:24,931 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash -407668003, now seen corresponding path program 1 times [2019-01-14 14:58:24,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:24,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:24,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 14:58:25,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:25,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:25,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:25,026 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand 3 states. [2019-01-14 14:58:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:25,217 INFO L93 Difference]: Finished difference Result 233 states and 365 transitions. [2019-01-14 14:58:25,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:25,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 14:58:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:25,220 INFO L225 Difference]: With dead ends: 233 [2019-01-14 14:58:25,220 INFO L226 Difference]: Without dead ends: 155 [2019-01-14 14:58:25,221 INFO L631 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-01-14 14:58:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-14 14:58:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-14 14:58:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-14 14:58:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2019-01-14 14:58:25,243 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 15 [2019-01-14 14:58:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:25,244 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2019-01-14 14:58:25,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2019-01-14 14:58:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 14:58:25,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:25,247 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:25,248 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:25,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1622407343, now seen corresponding path program 1 times [2019-01-14 14:58:25,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:25,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:25,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:25,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:25,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 14:58:25,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:25,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:25,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:25,325 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand 3 states. [2019-01-14 14:58:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:25,632 INFO L93 Difference]: Finished difference Result 367 states and 579 transitions. [2019-01-14 14:58:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:25,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-14 14:58:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:25,635 INFO L225 Difference]: With dead ends: 367 [2019-01-14 14:58:25,636 INFO L226 Difference]: Without dead ends: 213 [2019-01-14 14:58:25,637 INFO L631 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-01-14 14:58:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-14 14:58:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2019-01-14 14:58:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-14 14:58:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 291 transitions. [2019-01-14 14:58:25,660 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 291 transitions. Word has length 30 [2019-01-14 14:58:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:25,660 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 291 transitions. [2019-01-14 14:58:25,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 291 transitions. [2019-01-14 14:58:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 14:58:25,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:25,666 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:25,666 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2042852816, now seen corresponding path program 1 times [2019-01-14 14:58:25,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:25,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 14:58:25,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:25,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:25,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:25,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:25,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:25,736 INFO L87 Difference]: Start difference. First operand 207 states and 291 transitions. Second operand 3 states. [2019-01-14 14:58:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:25,824 INFO L93 Difference]: Finished difference Result 415 states and 588 transitions. [2019-01-14 14:58:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:25,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-14 14:58:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:25,827 INFO L225 Difference]: With dead ends: 415 [2019-01-14 14:58:25,827 INFO L226 Difference]: Without dead ends: 260 [2019-01-14 14:58:25,829 INFO L631 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-01-14 14:58:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-14 14:58:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-01-14 14:58:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-14 14:58:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 365 transitions. [2019-01-14 14:58:25,850 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 365 transitions. Word has length 44 [2019-01-14 14:58:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:25,851 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 365 transitions. [2019-01-14 14:58:25,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 365 transitions. [2019-01-14 14:58:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 14:58:25,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:25,854 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:25,854 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:25,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1056783528, now seen corresponding path program 1 times [2019-01-14 14:58:25,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:25,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:25,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-14 14:58:25,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:25,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:25,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:25,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:25,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:25,902 INFO L87 Difference]: Start difference. First operand 258 states and 365 transitions. Second operand 3 states. [2019-01-14 14:58:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:26,274 INFO L93 Difference]: Finished difference Result 523 states and 752 transitions. [2019-01-14 14:58:26,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:26,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-01-14 14:58:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:26,277 INFO L225 Difference]: With dead ends: 523 [2019-01-14 14:58:26,277 INFO L226 Difference]: Without dead ends: 188 [2019-01-14 14:58:26,279 INFO L631 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-01-14 14:58:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-14 14:58:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2019-01-14 14:58:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-14 14:58:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 244 transitions. [2019-01-14 14:58:26,296 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 244 transitions. Word has length 47 [2019-01-14 14:58:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:26,296 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 244 transitions. [2019-01-14 14:58:26,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 244 transitions. [2019-01-14 14:58:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-14 14:58:26,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 14:58:26,302 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 14:58:26,303 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 14:58:26,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 14:58:26,303 INFO L82 PathProgramCache]: Analyzing trace with hash -439474765, now seen corresponding path program 1 times [2019-01-14 14:58:26,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 14:58:26,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 14:58:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 14:58:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 14:58:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 14:58:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 14:58:26,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 14:58:26,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 14:58:26,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 14:58:26,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 14:58:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 14:58:26,408 INFO L87 Difference]: Start difference. First operand 185 states and 244 transitions. Second operand 3 states. [2019-01-14 14:58:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 14:58:26,451 INFO L93 Difference]: Finished difference Result 306 states and 375 transitions. [2019-01-14 14:58:26,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 14:58:26,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-01-14 14:58:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 14:58:26,454 INFO L225 Difference]: With dead ends: 306 [2019-01-14 14:58:26,454 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 14:58:26,455 INFO L631 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-01-14 14:58:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 14:58:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 14:58:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 14:58:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 14:58:26,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2019-01-14 14:58:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 14:58:26,463 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 14:58:26,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 14:58:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 14:58:26,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 14:58:26,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 14:58:26,854 INFO L451 ceAbstractionStarter]: At program point L217(lines 9 218) the Hoare annotation is: true [2019-01-14 14:58:26,854 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 186) no Hoare annotation was computed. [2019-01-14 14:58:26,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 14:58:26,854 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 190) no Hoare annotation was computed. [2019-01-14 14:58:26,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 14:58:26,854 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 75 184) no Hoare annotation was computed. [2019-01-14 14:58:26,855 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 194) no Hoare annotation was computed. [2019-01-14 14:58:26,855 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 75 184) no Hoare annotation was computed. [2019-01-14 14:58:26,855 INFO L444 ceAbstractionStarter]: At program point L177(lines 23 212) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~blastFlag~0 3))) (or (and (<= 8672 ULTIMATE.start_main_~s__state~0) .cse0) (<= ULTIMATE.start_main_~blastFlag~0 2) (and .cse0 (<= 8640 ULTIMATE.start_main_~s__state~0) (not (= ULTIMATE.start_main_~s__hit~0 0))))) [2019-01-14 14:58:26,855 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 198) no Hoare annotation was computed. [2019-01-14 14:58:26,855 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 140) no Hoare annotation was computed. [2019-01-14 14:58:26,856 INFO L444 ceAbstractionStarter]: At program point L70(lines 69 186) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_main_~s__state~0))) (or (and (<= ULTIMATE.start_main_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_main_~blastFlag~0 3) .cse0 (not (= ULTIMATE.start_main_~s__hit~0 0))))) [2019-01-14 14:58:26,856 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 202) no Hoare annotation was computed. [2019-01-14 14:58:26,856 INFO L444 ceAbstractionStarter]: At program point L62(lines 61 190) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,856 INFO L444 ceAbstractionStarter]: At program point L54(lines 53 194) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,856 INFO L444 ceAbstractionStarter]: At program point L46(lines 45 198) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,856 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 79 81) no Hoare annotation was computed. [2019-01-14 14:58:26,857 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 75 184) no Hoare annotation was computed. [2019-01-14 14:58:26,857 INFO L444 ceAbstractionStarter]: At program point L38(lines 37 202) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,857 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 205) no Hoare annotation was computed. [2019-01-14 14:58:26,857 INFO L444 ceAbstractionStarter]: At program point L121(lines 114 123) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,857 INFO L444 ceAbstractionStarter]: At program point L113(lines 106 124) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,857 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 163 165) no Hoare annotation was computed. [2019-01-14 14:58:26,857 INFO L444 ceAbstractionStarter]: At program point L31(lines 30 205) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,858 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 124) no Hoare annotation was computed. [2019-01-14 14:58:26,859 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 184) no Hoare annotation was computed. [2019-01-14 14:58:26,859 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 188) no Hoare annotation was computed. [2019-01-14 14:58:26,860 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 192) no Hoare annotation was computed. [2019-01-14 14:58:26,860 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-14 14:58:26,860 INFO L451 ceAbstractionStarter]: At program point L214(lines 9 218) the Hoare annotation is: true [2019-01-14 14:58:26,860 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 119) no Hoare annotation was computed. [2019-01-14 14:58:26,860 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 196) no Hoare annotation was computed. [2019-01-14 14:58:26,860 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 175) no Hoare annotation was computed. [2019-01-14 14:58:26,860 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-01-14 14:58:26,861 INFO L444 ceAbstractionStarter]: At program point L74(lines 73 184) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_main_~s__state~0) (<= ULTIMATE.start_main_~blastFlag~0 3)) [2019-01-14 14:58:26,861 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 200) no Hoare annotation was computed. [2019-01-14 14:58:26,861 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 216) no Hoare annotation was computed. [2019-01-14 14:58:26,861 INFO L444 ceAbstractionStarter]: At program point L66(lines 65 188) the Hoare annotation is: (let ((.cse0 (<= 8640 ULTIMATE.start_main_~s__state~0))) (or (and (<= ULTIMATE.start_main_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_main_~blastFlag~0 3) .cse0 (not (= ULTIMATE.start_main_~s__hit~0 0))))) [2019-01-14 14:58:26,861 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 204) no Hoare annotation was computed. [2019-01-14 14:58:26,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 14:58:26,865 INFO L444 ceAbstractionStarter]: At program point L58(lines 57 192) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,865 INFO L444 ceAbstractionStarter]: At program point L50(lines 49 196) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,865 INFO L444 ceAbstractionStarter]: At program point L174(lines 9 218) the Hoare annotation is: false [2019-01-14 14:58:26,865 INFO L444 ceAbstractionStarter]: At program point L42(lines 41 200) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,865 INFO L444 ceAbstractionStarter]: At program point L34(lines 33 204) the Hoare annotation is: (<= ULTIMATE.start_main_~blastFlag~0 2) [2019-01-14 14:58:26,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:58:26 BoogieIcfgContainer [2019-01-14 14:58:26,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 14:58:26,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 14:58:26,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 14:58:26,888 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 14:58:26,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:58:24" (3/4) ... [2019-01-14 14:58:26,893 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 14:58:26,906 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 14:58:26,907 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 14:58:26,991 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 14:58:26,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 14:58:26,996 INFO L168 Benchmark]: Toolchain (without parser) took 3827.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 951.4 MB in the beginning and 960.1 MB in the end (delta: -8.8 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:26,997 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:58:26,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:26,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.23 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:27,000 INFO L168 Benchmark]: Boogie Preprocessor took 92.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -202.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:27,001 INFO L168 Benchmark]: RCFGBuilder took 523.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:27,006 INFO L168 Benchmark]: TraceAbstraction took 2718.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 960.1 MB in the end (delta: 157.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 11.5 GB. [2019-01-14 14:58:27,007 INFO L168 Benchmark]: Witness Printer took 107.93 ms. Allocated memory is still 1.2 GB. Free memory is still 960.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 14:58:27,011 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.23 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -202.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 523.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2718.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 960.1 MB in the end (delta: 157.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 11.5 GB. * Witness Printer took 107.93 ms. Allocated memory is still 1.2 GB. Free memory is still 960.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 216]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8640 <= s__state) || ((blastFlag <= 3 && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((8672 <= s__state && blastFlag <= 3) || blastFlag <= 2) || ((blastFlag <= 3 && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 8672 <= s__state && blastFlag <= 3 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 8640 <= s__state) || ((blastFlag <= 3 && 8640 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: blastFlag <= 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 427 SDtfs, 251 SDslu, 292 SDs, 0 SdLazy, 196 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=5, 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 85 NumberOfFragments, 103 HoareAnnotationTreeSize, 18 FomulaSimplifications, 585 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 22669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 202/202 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...