./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/eca-rers2012/Problem01_label25.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 29670da151301b8436a6c7ddafad57f5257b4a8d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:43:23,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:43:23,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:43:23,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:43:23,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:43:23,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:43:23,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:43:23,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:43:23,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:43:23,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:43:23,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:43:23,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:43:23,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:43:23,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:43:23,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:43:23,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:43:23,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:43:23,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:43:23,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:43:23,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:43:23,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:43:23,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:43:23,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:43:23,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:43:23,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:43:23,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:43:23,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:43:23,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:43:23,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:43:23,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:43:23,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:43:23,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:43:23,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:43:23,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:43:23,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:43:23,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:43:23,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:43:23,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:43:23,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:43:23,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:43:23,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:43:23,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:43:23,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:43:23,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:43:23,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:43:23,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:43:23,413 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:43:23,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:43:23,413 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:43:23,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:43:23,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:43:23,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:43:23,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:43:23,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:43:23,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:43:23,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:43:23,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:43:23,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:43:23,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:43:23,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:43:23,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:43:23,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:43:23,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:43:23,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:23,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:43:23,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:43:23,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:43:23,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:43:23,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:43:23,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:43:23,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:43:23,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 29670da151301b8436a6c7ddafad57f5257b4a8d [2019-11-28 15:43:23,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:43:23,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:43:23,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:43:23,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:43:23,768 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:43:23,769 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2019-11-28 15:43:23,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859a71408/d57d11ff2a4a400c9972ce61ac81bbb4/FLAG21fc06aea [2019-11-28 15:43:24,428 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:43:24,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2019-11-28 15:43:24,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859a71408/d57d11ff2a4a400c9972ce61ac81bbb4/FLAG21fc06aea [2019-11-28 15:43:24,628 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859a71408/d57d11ff2a4a400c9972ce61ac81bbb4 [2019-11-28 15:43:24,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:43:24,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:43:24,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:24,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:43:24,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:43:24,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:24" (1/1) ... [2019-11-28 15:43:24,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a27607f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:24, skipping insertion in model container [2019-11-28 15:43:24,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:24" (1/1) ... [2019-11-28 15:43:24,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:43:24,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:43:25,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:25,252 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:43:25,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:25,407 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:43:25,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25 WrapperNode [2019-11-28 15:43:25,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:25,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:25,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:43:25,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:43:25,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:25,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:43:25,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:43:25,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:43:25,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (1/1) ... [2019-11-28 15:43:25,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:43:25,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:43:25,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:43:25,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:43:25,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (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-11-28 15:43:25,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:43:25,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:43:26,985 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:43:26,986 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:43:26,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:26 BoogieIcfgContainer [2019-11-28 15:43:26,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:43:26,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:43:26,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:43:26,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:43:26,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:24" (1/3) ... [2019-11-28 15:43:26,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a554b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:26, skipping insertion in model container [2019-11-28 15:43:26,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:25" (2/3) ... [2019-11-28 15:43:26,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a554b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:26, skipping insertion in model container [2019-11-28 15:43:26,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:26" (3/3) ... [2019-11-28 15:43:26,997 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label25.c [2019-11-28 15:43:27,008 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:43:27,017 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:43:27,030 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:43:27,068 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:43:27,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:43:27,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:43:27,069 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:43:27,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:43:27,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:43:27,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:43:27,070 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:43:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-28 15:43:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 15:43:27,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:27,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:27,104 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:27,111 INFO L82 PathProgramCache]: Analyzing trace with hash -278930290, now seen corresponding path program 1 times [2019-11-28 15:43:27,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:27,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596915137] [2019-11-28 15:43:27,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:27,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596915137] [2019-11-28 15:43:27,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:27,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:27,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87691620] [2019-11-28 15:43:27,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:27,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:27,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:27,621 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-28 15:43:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:29,152 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-28 15:43:29,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:29,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-28 15:43:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:29,172 INFO L225 Difference]: With dead ends: 662 [2019-11-28 15:43:29,173 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 15:43:29,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 15:43:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-28 15:43:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-28 15:43:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-28 15:43:29,249 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 119 [2019-11-28 15:43:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:29,250 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-28 15:43:29,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-28 15:43:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-28 15:43:29,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:29,256 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 15:43:29,256 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:29,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:29,257 INFO L82 PathProgramCache]: Analyzing trace with hash -451650634, now seen corresponding path program 1 times [2019-11-28 15:43:29,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:29,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773560909] [2019-11-28 15:43:29,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:29,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773560909] [2019-11-28 15:43:29,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:29,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:29,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47568622] [2019-11-28 15:43:29,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:29,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:29,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:29,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:29,369 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-28 15:43:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:30,052 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-28 15:43:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:30,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-28 15:43:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:30,058 INFO L225 Difference]: With dead ends: 1185 [2019-11-28 15:43:30,059 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:43:30,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:43:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-28 15:43:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:43:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-28 15:43:30,104 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 124 [2019-11-28 15:43:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:30,105 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-28 15:43:30,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-28 15:43:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-28 15:43:30,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:30,110 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:30,110 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash 329866697, now seen corresponding path program 1 times [2019-11-28 15:43:30,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:30,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384610010] [2019-11-28 15:43:30,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 15:43:30,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384610010] [2019-11-28 15:43:30,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:30,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:30,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414729881] [2019-11-28 15:43:30,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:30,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:30,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:30,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:30,181 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-28 15:43:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:30,738 INFO L93 Difference]: Finished difference Result 1971 states and 2688 transitions. [2019-11-28 15:43:30,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:30,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-28 15:43:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:30,745 INFO L225 Difference]: With dead ends: 1971 [2019-11-28 15:43:30,745 INFO L226 Difference]: Without dead ends: 1183 [2019-11-28 15:43:30,747 INFO L630 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-11-28 15:43:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-28 15:43:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 790. [2019-11-28 15:43:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:43:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-28 15:43:30,775 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 131 [2019-11-28 15:43:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:30,775 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-28 15:43:30,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-28 15:43:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-28 15:43:30,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:30,780 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:30,780 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:30,780 INFO L82 PathProgramCache]: Analyzing trace with hash 935317039, now seen corresponding path program 1 times [2019-11-28 15:43:30,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:30,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997698973] [2019-11-28 15:43:30,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:30,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997698973] [2019-11-28 15:43:30,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:30,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:30,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165296831] [2019-11-28 15:43:30,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:30,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:30,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:30,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:30,937 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 4 states. [2019-11-28 15:43:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:31,708 INFO L93 Difference]: Finished difference Result 1714 states and 2292 transitions. [2019-11-28 15:43:31,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:31,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-28 15:43:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:31,713 INFO L225 Difference]: With dead ends: 1714 [2019-11-28 15:43:31,714 INFO L226 Difference]: Without dead ends: 926 [2019-11-28 15:43:31,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-28 15:43:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 921. [2019-11-28 15:43:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-28 15:43:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1204 transitions. [2019-11-28 15:43:31,737 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1204 transitions. Word has length 134 [2019-11-28 15:43:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:31,738 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1204 transitions. [2019-11-28 15:43:31,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1204 transitions. [2019-11-28 15:43:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-28 15:43:31,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:31,741 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:31,741 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:31,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1288510055, now seen corresponding path program 1 times [2019-11-28 15:43:31,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:31,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018428475] [2019-11-28 15:43:31,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:31,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018428475] [2019-11-28 15:43:31,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:31,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:31,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721648332] [2019-11-28 15:43:31,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:43:31,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:31,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:43:31,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:31,839 INFO L87 Difference]: Start difference. First operand 921 states and 1204 transitions. Second operand 5 states. [2019-11-28 15:43:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:32,934 INFO L93 Difference]: Finished difference Result 2233 states and 2968 transitions. [2019-11-28 15:43:32,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:32,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-11-28 15:43:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:32,942 INFO L225 Difference]: With dead ends: 2233 [2019-11-28 15:43:32,943 INFO L226 Difference]: Without dead ends: 1445 [2019-11-28 15:43:32,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:32,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-28 15:43:32,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-28 15:43:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:43:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1807 transitions. [2019-11-28 15:43:32,980 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1807 transitions. Word has length 138 [2019-11-28 15:43:32,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:32,981 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1807 transitions. [2019-11-28 15:43:32,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:43:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1807 transitions. [2019-11-28 15:43:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 15:43:32,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:32,985 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:32,985 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:32,986 INFO L82 PathProgramCache]: Analyzing trace with hash -965503870, now seen corresponding path program 1 times [2019-11-28 15:43:32,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:32,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310169307] [2019-11-28 15:43:32,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:33,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310169307] [2019-11-28 15:43:33,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:33,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:33,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073357993] [2019-11-28 15:43:33,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:33,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:33,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:33,046 INFO L87 Difference]: Start difference. First operand 1445 states and 1807 transitions. Second operand 3 states. [2019-11-28 15:43:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:33,512 INFO L93 Difference]: Finished difference Result 3150 states and 3958 transitions. [2019-11-28 15:43:33,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:33,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-28 15:43:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:33,520 INFO L225 Difference]: With dead ends: 3150 [2019-11-28 15:43:33,521 INFO L226 Difference]: Without dead ends: 1707 [2019-11-28 15:43:33,523 INFO L630 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-11-28 15:43:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-28 15:43:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-28 15:43:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:43:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1666 transitions. [2019-11-28 15:43:33,556 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1666 transitions. Word has length 141 [2019-11-28 15:43:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:33,556 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1666 transitions. [2019-11-28 15:43:33,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1666 transitions. [2019-11-28 15:43:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-28 15:43:33,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:33,560 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:33,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash -750696464, now seen corresponding path program 1 times [2019-11-28 15:43:33,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:33,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799599043] [2019-11-28 15:43:33,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 15:43:33,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799599043] [2019-11-28 15:43:33,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:33,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:33,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031756424] [2019-11-28 15:43:33,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:33,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:33,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:33,631 INFO L87 Difference]: Start difference. First operand 1445 states and 1666 transitions. Second operand 3 states. [2019-11-28 15:43:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:34,234 INFO L93 Difference]: Finished difference Result 2888 states and 3328 transitions. [2019-11-28 15:43:34,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:34,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-28 15:43:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:34,242 INFO L225 Difference]: With dead ends: 2888 [2019-11-28 15:43:34,242 INFO L226 Difference]: Without dead ends: 1445 [2019-11-28 15:43:34,244 INFO L630 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-11-28 15:43:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-28 15:43:34,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-28 15:43:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 15:43:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1594 transitions. [2019-11-28 15:43:34,304 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1594 transitions. Word has length 149 [2019-11-28 15:43:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:34,305 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1594 transitions. [2019-11-28 15:43:34,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1594 transitions. [2019-11-28 15:43:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 15:43:34,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:34,309 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 15:43:34,309 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:34,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:34,310 INFO L82 PathProgramCache]: Analyzing trace with hash 396028422, now seen corresponding path program 1 times [2019-11-28 15:43:34,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:34,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849215333] [2019-11-28 15:43:34,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:35,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849215333] [2019-11-28 15:43:35,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:35,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 15:43:35,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899577988] [2019-11-28 15:43:35,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 15:43:35,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:35,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 15:43:35,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-28 15:43:35,113 INFO L87 Difference]: Start difference. First operand 1445 states and 1594 transitions. Second operand 12 states. [2019-11-28 15:43:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:36,886 INFO L93 Difference]: Finished difference Result 3260 states and 3655 transitions. [2019-11-28 15:43:36,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 15:43:36,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2019-11-28 15:43:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:36,899 INFO L225 Difference]: With dead ends: 3260 [2019-11-28 15:43:36,899 INFO L226 Difference]: Without dead ends: 1914 [2019-11-28 15:43:36,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-28 15:43:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-28 15:43:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2019-11-28 15:43:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-28 15:43:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1909 transitions. [2019-11-28 15:43:36,955 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1909 transitions. Word has length 156 [2019-11-28 15:43:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:36,956 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1909 transitions. [2019-11-28 15:43:36,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 15:43:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1909 transitions. [2019-11-28 15:43:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-28 15:43:36,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:36,967 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:36,967 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1825782608, now seen corresponding path program 1 times [2019-11-28 15:43:36,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:36,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110592064] [2019-11-28 15:43:36,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-28 15:43:37,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110592064] [2019-11-28 15:43:37,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:37,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:37,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190861070] [2019-11-28 15:43:37,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:37,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:37,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:37,383 INFO L87 Difference]: Start difference. First operand 1742 states and 1909 transitions. Second operand 3 states. [2019-11-28 15:43:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:37,917 INFO L93 Difference]: Finished difference Result 1744 states and 1910 transitions. [2019-11-28 15:43:37,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:37,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-28 15:43:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:37,929 INFO L225 Difference]: With dead ends: 1744 [2019-11-28 15:43:37,929 INFO L226 Difference]: Without dead ends: 1742 [2019-11-28 15:43:37,931 INFO L630 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-11-28 15:43:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-11-28 15:43:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2019-11-28 15:43:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-28 15:43:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1907 transitions. [2019-11-28 15:43:37,981 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1907 transitions. Word has length 225 [2019-11-28 15:43:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:37,982 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1907 transitions. [2019-11-28 15:43:37,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1907 transitions. [2019-11-28 15:43:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-28 15:43:37,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:37,993 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:37,994 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1135581686, now seen corresponding path program 1 times [2019-11-28 15:43:37,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:37,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639274993] [2019-11-28 15:43:37,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 15:43:38,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639274993] [2019-11-28 15:43:38,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109615129] [2019-11-28 15:43:38,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:43:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:38,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:43:38,550 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:43:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-28 15:43:38,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:43:38,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-28 15:43:38,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559231444] [2019-11-28 15:43:38,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:38,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:38,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:38,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:43:38,728 INFO L87 Difference]: Start difference. First operand 1742 states and 1907 transitions. Second operand 3 states. [2019-11-28 15:43:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:39,129 INFO L93 Difference]: Finished difference Result 1742 states and 1907 transitions. [2019-11-28 15:43:39,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:39,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-28 15:43:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:39,130 INFO L225 Difference]: With dead ends: 1742 [2019-11-28 15:43:39,130 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:43:39,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:43:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:43:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:43:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:43:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:43:39,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-11-28 15:43:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:39,136 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:43:39,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:43:39,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:43:39,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:43:39,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:43:39,545 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-28 15:43:39,546 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-28 15:43:39,546 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,546 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,546 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,546 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,546 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,546 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,546 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-28 15:43:39,547 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-28 15:43:39,547 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-28 15:43:39,547 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-28 15:43:39,547 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-28 15:43:39,547 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-28 15:43:39,547 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-28 15:43:39,548 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 15:43:39,548 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-28 15:43:39,548 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-28 15:43:39,549 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,549 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,549 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,549 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,550 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,550 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,550 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-28 15:43:39,550 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-28 15:43:39,552 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-28 15:43:39,552 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-28 15:43:39,552 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-28 15:43:39,552 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-28 15:43:39,552 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-28 15:43:39,552 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,553 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,554 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,554 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,554 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,554 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-28 15:43:39,555 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-28 15:43:39,555 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-28 15:43:39,555 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-28 15:43:39,555 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-28 15:43:39,555 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-28 15:43:39,556 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-28 15:43:39,557 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-28 15:43:39,557 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-28 15:43:39,558 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (not (= ~a16~0 6))) (.cse1 (<= ~a21~0 0)) (.cse0 (= 1 ~a7~0)) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse2 .cse3) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)) (and (not .cse0) .cse3))) [2019-11-28 15:43:39,558 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,558 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,558 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,558 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-28 15:43:39,559 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-28 15:43:39,560 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-28 15:43:39,560 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-28 15:43:39,560 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-28 15:43:39,561 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-28 15:43:39,561 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-28 15:43:39,561 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-28 15:43:39,561 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,561 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,561 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,561 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-28 15:43:39,562 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-28 15:43:39,563 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-28 15:43:39,563 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,563 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,563 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,564 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,564 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-28 15:43:39,564 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,564 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-28 15:43:39,564 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-28 15:43:39,564 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-28 15:43:39,565 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-28 15:43:39,566 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-28 15:43:39,566 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-28 15:43:39,566 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,566 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~a16~0 6))) (.cse1 (<= ~a21~0 0)) (.cse0 (= 1 ~a7~0)) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse2 .cse3) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)) (and (not .cse0) .cse3))) [2019-11-28 15:43:39,566 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,566 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,566 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,567 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,567 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-28 15:43:39,567 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-28 15:43:39,570 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-28 15:43:39,570 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-28 15:43:39,570 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-28 15:43:39,570 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 15:43:39,570 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-28 15:43:39,570 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-28 15:43:39,570 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,570 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-28 15:43:39,571 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,572 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:43:39,573 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-28 15:43:39,574 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-28 15:43:39,575 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-28 15:43:39,576 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:43:39,577 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2019-11-28 15:43:39,577 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-28 15:43:39,577 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-28 15:43:39,577 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-28 15:43:39,577 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,577 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,577 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,577 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-28 15:43:39,578 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-28 15:43:39,579 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-28 15:43:39,579 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-28 15:43:39,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:43:39 BoogieIcfgContainer [2019-11-28 15:43:39,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:43:39,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:43:39,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:43:39,608 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:43:39,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:26" (3/4) ... [2019-11-28 15:43:39,613 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:43:39,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:43:39,649 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:43:39,896 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:43:39,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:43:39,900 INFO L168 Benchmark]: Toolchain (without parser) took 15265.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 415.2 MB). Free memory was 956.3 MB in the beginning and 874.0 MB in the end (delta: 82.3 MB). Peak memory consumption was 497.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:39,900 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:43:39,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:39,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.29 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:39,902 INFO L168 Benchmark]: Boogie Preprocessor took 79.47 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:39,903 INFO L168 Benchmark]: RCFGBuilder took 1394.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.9 MB in the end (delta: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:39,904 INFO L168 Benchmark]: TraceAbstraction took 12618.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 284.2 MB). Free memory was 984.9 MB in the beginning and 886.0 MB in the end (delta: 98.9 MB). Peak memory consumption was 383.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:39,905 INFO L168 Benchmark]: Witness Printer took 289.31 ms. Allocated memory is still 1.4 GB. Free memory was 886.0 MB in the beginning and 874.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:39,907 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.42 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 773.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.29 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.47 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1394.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.9 MB in the end (delta: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12618.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 284.2 MB). Free memory was 984.9 MB in the beginning and 886.0 MB in the end (delta: 98.9 MB). Peak memory consumption was 383.1 MB. Max. memory is 11.5 GB. * Witness Printer took 289.31 ms. Allocated memory is still 1.4 GB. Free memory was 886.0 MB in the beginning and 874.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: 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: 30]: Loop Invariant Derived loop invariant: ((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (!(a16 == 6) && a21 == 1)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || (!(1 == a7) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (!(a16 == 6) && a21 == 1)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || (!(1 == a7) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 12.2s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 727 SDtfs, 2078 SDslu, 122 SDs, 0 SdLazy, 5451 SolverSat, 683 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 832 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 38 NumberOfFragments, 83 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1988 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1797 NumberOfCodeBlocks, 1797 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1786 ConstructedInterpolants, 0 QuantifiedInterpolants, 1060078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 882/909 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...