./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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/Problem02_label54.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 7013b5440d15c52781747fe18e114861ef321ee3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:53:14,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:53:14,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:53:15,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:53:15,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:53:15,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:53:15,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:53:15,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:53:15,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:53:15,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:53:15,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:53:15,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:53:15,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:53:15,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:53:15,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:53:15,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:53:15,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:53:15,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:53:15,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:53:15,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:53:15,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:53:15,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:53:15,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:53:15,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:53:15,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:53:15,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:53:15,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:53:15,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:53:15,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:53:15,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:53:15,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:53:15,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:53:15,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:53:15,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:53:15,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:53:15,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:53:15,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:53:15,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:53:15,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:53:15,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:53:15,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:53:15,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:53:15,080 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:53:15,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:53:15,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:53:15,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:53:15,083 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:53:15,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:53:15,084 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:53:15,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:53:15,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:53:15,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:53:15,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:53:15,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:53:15,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:53:15,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:53:15,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:53:15,087 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:53:15,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:53:15,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:53:15,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:53:15,089 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:53:15,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:53:15,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:53:15,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:53:15,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:53:15,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:53:15,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:53:15,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:53:15,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:53:15,092 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 -> 7013b5440d15c52781747fe18e114861ef321ee3 [2019-11-19 20:53:15,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:53:15,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:53:15,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:53:15,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:53:15,415 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:53:15,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label54.c [2019-11-19 20:53:15,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fb62694/1fe0785ad3ac4a66860539bf2b2738c8/FLAG2eeb69637 [2019-11-19 20:53:16,087 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:53:16,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label54.c [2019-11-19 20:53:16,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fb62694/1fe0785ad3ac4a66860539bf2b2738c8/FLAG2eeb69637 [2019-11-19 20:53:16,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96fb62694/1fe0785ad3ac4a66860539bf2b2738c8 [2019-11-19 20:53:16,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:53:16,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:53:16,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:53:16,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:53:16,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:53:16,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:53:16" (1/1) ... [2019-11-19 20:53:16,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f22426b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:16, skipping insertion in model container [2019-11-19 20:53:16,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:53:16" (1/1) ... [2019-11-19 20:53:16,374 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:53:16,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:53:17,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:53:17,104 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:53:17,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:53:17,207 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:53:17,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17 WrapperNode [2019-11-19 20:53:17,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:53:17,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:53:17,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:53:17,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:53:17,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:53:17,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:53:17,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:53:17,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:53:17,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (1/1) ... [2019-11-19 20:53:17,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:53:17,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:53:17,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:53:17,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:53:17,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (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-19 20:53:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:53:17,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:53:18,872 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:53:18,872 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:53:18,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:18 BoogieIcfgContainer [2019-11-19 20:53:18,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:53:18,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:53:18,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:53:18,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:53:18,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:53:16" (1/3) ... [2019-11-19 20:53:18,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a8fda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:53:18, skipping insertion in model container [2019-11-19 20:53:18,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:53:17" (2/3) ... [2019-11-19 20:53:18,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a8fda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:53:18, skipping insertion in model container [2019-11-19 20:53:18,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:18" (3/3) ... [2019-11-19 20:53:18,884 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label54.c [2019-11-19 20:53:18,895 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:53:18,903 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:53:18,915 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:53:18,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:53:18,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:53:18,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:53:18,950 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:53:18,951 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:53:18,951 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:53:18,951 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:53:18,951 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:53:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-19 20:53:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-19 20:53:18,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:18,988 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] [2019-11-19 20:53:18,988 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1695579141, now seen corresponding path program 1 times [2019-11-19 20:53:19,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:19,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552329858] [2019-11-19 20:53:19,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:19,457 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-19 20:53:19,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552329858] [2019-11-19 20:53:19,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:19,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 20:53:19,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340429953] [2019-11-19 20:53:19,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:19,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:19,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:19,485 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2019-11-19 20:53:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:20,435 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2019-11-19 20:53:20,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:20,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-19 20:53:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:20,470 INFO L225 Difference]: With dead ends: 601 [2019-11-19 20:53:20,470 INFO L226 Difference]: Without dead ends: 310 [2019-11-19 20:53:20,481 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-19 20:53:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-19 20:53:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-11-19 20:53:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-19 20:53:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2019-11-19 20:53:20,578 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 101 [2019-11-19 20:53:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:20,579 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2019-11-19 20:53:20,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2019-11-19 20:53:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-19 20:53:20,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:20,589 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-19 20:53:20,590 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash -292589926, now seen corresponding path program 1 times [2019-11-19 20:53:20,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:20,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045863081] [2019-11-19 20:53:20,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:20,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045863081] [2019-11-19 20:53:20,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:20,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:20,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346511146] [2019-11-19 20:53:20,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:20,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:20,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:20,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:20,815 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand 4 states. [2019-11-19 20:53:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:21,771 INFO L93 Difference]: Finished difference Result 1200 states and 1733 transitions. [2019-11-19 20:53:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:21,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-19 20:53:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:21,781 INFO L225 Difference]: With dead ends: 1200 [2019-11-19 20:53:21,781 INFO L226 Difference]: Without dead ends: 892 [2019-11-19 20:53:21,783 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-19 20:53:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-11-19 20:53:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 593. [2019-11-19 20:53:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-19 20:53:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 827 transitions. [2019-11-19 20:53:21,811 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 827 transitions. Word has length 119 [2019-11-19 20:53:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:21,812 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 827 transitions. [2019-11-19 20:53:21,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 827 transitions. [2019-11-19 20:53:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 20:53:21,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:21,815 INFO L410 BasicCegarLoop]: trace histogram [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-19 20:53:21,816 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash 566132794, now seen corresponding path program 1 times [2019-11-19 20:53:21,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:21,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118137855] [2019-11-19 20:53:21,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:21,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118137855] [2019-11-19 20:53:21,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:21,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:21,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253235790] [2019-11-19 20:53:21,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:21,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:21,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:21,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:21,925 INFO L87 Difference]: Start difference. First operand 593 states and 827 transitions. Second operand 4 states. [2019-11-19 20:53:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:22,950 INFO L93 Difference]: Finished difference Result 2316 states and 3244 transitions. [2019-11-19 20:53:22,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:22,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-19 20:53:22,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:22,968 INFO L225 Difference]: With dead ends: 2316 [2019-11-19 20:53:22,968 INFO L226 Difference]: Without dead ends: 1725 [2019-11-19 20:53:22,970 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-19 20:53:22,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2019-11-19 20:53:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1151. [2019-11-19 20:53:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-11-19 20:53:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1548 transitions. [2019-11-19 20:53:23,022 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1548 transitions. Word has length 120 [2019-11-19 20:53:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:23,022 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 1548 transitions. [2019-11-19 20:53:23,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:23,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1548 transitions. [2019-11-19 20:53:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 20:53:23,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:23,027 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2019-11-19 20:53:23,027 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:23,028 INFO L82 PathProgramCache]: Analyzing trace with hash -157142321, now seen corresponding path program 1 times [2019-11-19 20:53:23,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:23,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999085601] [2019-11-19 20:53:23,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:23,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999085601] [2019-11-19 20:53:23,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:23,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:23,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385134038] [2019-11-19 20:53:23,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:23,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:23,123 INFO L87 Difference]: Start difference. First operand 1151 states and 1548 transitions. Second operand 4 states. [2019-11-19 20:53:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:24,209 INFO L93 Difference]: Finished difference Result 3563 states and 4698 transitions. [2019-11-19 20:53:24,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:24,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-19 20:53:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:24,221 INFO L225 Difference]: With dead ends: 3563 [2019-11-19 20:53:24,222 INFO L226 Difference]: Without dead ends: 2414 [2019-11-19 20:53:24,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-19 20:53:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2131. [2019-11-19 20:53:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-19 20:53:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2618 transitions. [2019-11-19 20:53:24,276 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2618 transitions. Word has length 123 [2019-11-19 20:53:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:24,277 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2618 transitions. [2019-11-19 20:53:24,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2618 transitions. [2019-11-19 20:53:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-19 20:53:24,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:24,283 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-19 20:53:24,283 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash -920596231, now seen corresponding path program 1 times [2019-11-19 20:53:24,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:24,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413798487] [2019-11-19 20:53:24,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 20:53:24,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413798487] [2019-11-19 20:53:24,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:24,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:24,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045059910] [2019-11-19 20:53:24,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:24,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:24,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:24,456 INFO L87 Difference]: Start difference. First operand 2131 states and 2618 transitions. Second operand 4 states. [2019-11-19 20:53:25,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:25,300 INFO L93 Difference]: Finished difference Result 5105 states and 6307 transitions. [2019-11-19 20:53:25,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:25,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-19 20:53:25,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:25,311 INFO L225 Difference]: With dead ends: 5105 [2019-11-19 20:53:25,312 INFO L226 Difference]: Without dead ends: 2414 [2019-11-19 20:53:25,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 20:53:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-19 20:53:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2410. [2019-11-19 20:53:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2019-11-19 20:53:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 2692 transitions. [2019-11-19 20:53:25,361 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 2692 transitions. Word has length 128 [2019-11-19 20:53:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:25,362 INFO L462 AbstractCegarLoop]: Abstraction has 2410 states and 2692 transitions. [2019-11-19 20:53:25,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 2692 transitions. [2019-11-19 20:53:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-19 20:53:25,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:25,367 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-11-19 20:53:25,368 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:25,368 INFO L82 PathProgramCache]: Analyzing trace with hash -91008860, now seen corresponding path program 1 times [2019-11-19 20:53:25,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:25,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093198234] [2019-11-19 20:53:25,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-19 20:53:25,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093198234] [2019-11-19 20:53:25,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:25,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:25,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084719355] [2019-11-19 20:53:25,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:25,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:25,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:25,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:25,432 INFO L87 Difference]: Start difference. First operand 2410 states and 2692 transitions. Second operand 4 states. [2019-11-19 20:53:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:25,960 INFO L93 Difference]: Finished difference Result 4526 states and 5047 transitions. [2019-11-19 20:53:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:25,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-19 20:53:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:25,972 INFO L225 Difference]: With dead ends: 4526 [2019-11-19 20:53:25,972 INFO L226 Difference]: Without dead ends: 2117 [2019-11-19 20:53:25,975 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-19 20:53:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2019-11-19 20:53:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1557. [2019-11-19 20:53:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-11-19 20:53:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1702 transitions. [2019-11-19 20:53:26,020 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1702 transitions. Word has length 140 [2019-11-19 20:53:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:26,020 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 1702 transitions. [2019-11-19 20:53:26,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1702 transitions. [2019-11-19 20:53:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-19 20:53:26,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:26,026 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, 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] [2019-11-19 20:53:26,026 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:26,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1260894349, now seen corresponding path program 1 times [2019-11-19 20:53:26,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:26,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086991134] [2019-11-19 20:53:26,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:26,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086991134] [2019-11-19 20:53:26,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:26,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 20:53:26,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231357081] [2019-11-19 20:53:26,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 20:53:26,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 20:53:26,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:53:26,424 INFO L87 Difference]: Start difference. First operand 1557 states and 1702 transitions. Second operand 7 states. [2019-11-19 20:53:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:27,615 INFO L93 Difference]: Finished difference Result 3266 states and 3576 transitions. [2019-11-19 20:53:27,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 20:53:27,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2019-11-19 20:53:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:27,626 INFO L225 Difference]: With dead ends: 3266 [2019-11-19 20:53:27,627 INFO L226 Difference]: Without dead ends: 1571 [2019-11-19 20:53:27,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:53:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2019-11-19 20:53:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1417. [2019-11-19 20:53:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2019-11-19 20:53:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1553 transitions. [2019-11-19 20:53:27,675 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1553 transitions. Word has length 169 [2019-11-19 20:53:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:27,675 INFO L462 AbstractCegarLoop]: Abstraction has 1417 states and 1553 transitions. [2019-11-19 20:53:27,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 20:53:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1553 transitions. [2019-11-19 20:53:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-19 20:53:27,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:27,683 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-19 20:53:27,684 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:27,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash 992818194, now seen corresponding path program 1 times [2019-11-19 20:53:27,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:27,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359012630] [2019-11-19 20:53:27,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:53:27,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359012630] [2019-11-19 20:53:27,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:27,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:53:27,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757418031] [2019-11-19 20:53:27,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:53:27,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:27,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:53:27,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:27,885 INFO L87 Difference]: Start difference. First operand 1417 states and 1553 transitions. Second operand 4 states. [2019-11-19 20:53:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:28,569 INFO L93 Difference]: Finished difference Result 2691 states and 2953 transitions. [2019-11-19 20:53:28,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:53:28,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-19 20:53:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:28,577 INFO L225 Difference]: With dead ends: 2691 [2019-11-19 20:53:28,578 INFO L226 Difference]: Without dead ends: 1136 [2019-11-19 20:53:28,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:53:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-11-19 20:53:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1135. [2019-11-19 20:53:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-11-19 20:53:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1216 transitions. [2019-11-19 20:53:28,603 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1216 transitions. Word has length 178 [2019-11-19 20:53:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:28,604 INFO L462 AbstractCegarLoop]: Abstraction has 1135 states and 1216 transitions. [2019-11-19 20:53:28,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:53:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1216 transitions. [2019-11-19 20:53:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-19 20:53:28,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:53:28,610 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, 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, 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] [2019-11-19 20:53:28,611 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:53:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:53:28,611 INFO L82 PathProgramCache]: Analyzing trace with hash -751837008, now seen corresponding path program 1 times [2019-11-19 20:53:28,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:53:28,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497831997] [2019-11-19 20:53:28,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:53:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:53:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 20:53:28,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497831997] [2019-11-19 20:53:28,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:53:28,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:53:28,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773378488] [2019-11-19 20:53:28,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:53:28,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:53:28,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:53:28,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:53:28,812 INFO L87 Difference]: Start difference. First operand 1135 states and 1216 transitions. Second operand 3 states. [2019-11-19 20:53:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:53:29,240 INFO L93 Difference]: Finished difference Result 2268 states and 2425 transitions. [2019-11-19 20:53:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:53:29,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-11-19 20:53:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:53:29,242 INFO L225 Difference]: With dead ends: 2268 [2019-11-19 20:53:29,242 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:53:29,245 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-19 20:53:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:53:29,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:53:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:53:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:53:29,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199 [2019-11-19 20:53:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:53:29,247 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:53:29,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:53:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:53:29,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:53:29,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:53:29,650 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-11-19 20:53:29,929 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 33 [2019-11-19 20:53:29,933 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,933 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,933 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,933 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-19 20:53:29,933 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-19 20:53:29,933 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-19 20:53:29,934 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-19 20:53:29,935 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-19 20:53:29,935 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-19 20:53:29,935 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-19 20:53:29,935 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-19 20:53:29,935 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-19 20:53:29,935 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,936 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,937 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,937 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-19 20:53:29,937 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-19 20:53:29,937 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-19 20:53:29,938 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-19 20:53:29,938 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-19 20:53:29,938 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,938 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,938 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,939 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-19 20:53:29,939 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-19 20:53:29,939 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-19 20:53:29,939 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-19 20:53:29,939 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-19 20:53:29,940 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-19 20:53:29,940 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-19 20:53:29,940 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-19 20:53:29,940 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,940 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,940 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,941 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-19 20:53:29,941 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-19 20:53:29,941 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-19 20:53:29,941 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-19 20:53:29,941 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-19 20:53:29,941 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-19 20:53:29,942 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-19 20:53:29,942 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-19 20:53:29,942 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,942 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,942 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,942 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-19 20:53:29,943 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-19 20:53:29,943 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-19 20:53:29,943 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-19 20:53:29,943 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-19 20:53:29,943 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-19 20:53:29,944 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-19 20:53:29,944 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-19 20:53:29,944 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-19 20:53:29,944 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,944 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,945 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,945 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-19 20:53:29,945 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-19 20:53:29,945 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-19 20:53:29,945 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-19 20:53:29,946 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-19 20:53:29,946 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-19 20:53:29,946 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,946 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,946 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,946 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-19 20:53:29,947 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-19 20:53:29,947 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-19 20:53:29,947 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-19 20:53:29,947 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-19 20:53:29,947 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:53:29,947 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-19 20:53:29,948 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-19 20:53:29,948 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-19 20:53:29,948 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,948 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,948 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,948 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-19 20:53:29,949 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-19 20:53:29,949 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-19 20:53:29,949 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-19 20:53:29,949 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-19 20:53:29,949 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,949 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,950 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,950 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-19 20:53:29,950 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-19 20:53:29,950 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-19 20:53:29,950 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-19 20:53:29,951 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-19 20:53:29,951 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-19 20:53:29,951 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-19 20:53:29,951 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-19 20:53:29,951 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-19 20:53:29,951 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-19 20:53:29,952 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 20:53:29,952 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 475) no Hoare annotation was computed. [2019-11-19 20:53:29,952 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-19 20:53:29,952 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,952 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,953 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-19 20:53:29,953 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-19 20:53:29,953 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-19 20:53:29,953 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-19 20:53:29,953 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-19 20:53:29,953 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-19 20:53:29,954 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-19 20:53:29,954 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-19 20:53:29,954 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-19 20:53:29,955 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse9 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse6 (= 1 ~a11~0))) (let ((.cse4 (= 10 ~a28~0)) (.cse7 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse0 (not .cse6)) (.cse2 (= ~a17~0 8)) (.cse5 (not .cse3)) (.cse10 (not .cse9)) (.cse8 (not (= ~a28~0 11)))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse1 .cse4) (and .cse5 .cse6 .cse4 .cse7) (and (and .cse1 .cse7 .cse8) .cse3) (and .cse9 .cse3 .cse7) (and .cse9 .cse2 .cse1) (and .cse2 .cse10 .cse0 .cse8) (and .cse2 .cse5 .cse10 .cse8)))) [2019-11-19 20:53:29,955 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,955 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,955 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-19 20:53:29,955 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-19 20:53:29,955 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-19 20:53:29,956 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-19 20:53:29,956 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-19 20:53:29,956 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-19 20:53:29,956 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-19 20:53:29,956 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,956 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,957 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-19 20:53:29,957 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-19 20:53:29,957 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-19 20:53:29,957 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-19 20:53:29,957 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-19 20:53:29,957 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-19 20:53:29,958 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-19 20:53:29,958 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-19 20:53:29,958 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-19 20:53:29,958 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,958 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,958 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-19 20:53:29,959 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-19 20:53:29,959 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-19 20:53:29,959 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-19 20:53:29,959 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-19 20:53:29,959 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-19 20:53:29,960 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse9 (= ~a28~0 9)) (.cse3 (= ~a25~0 1)) (.cse6 (= 1 ~a11~0))) (let ((.cse4 (= 10 ~a28~0)) (.cse7 (<= ~a17~0 8)) (.cse1 (= ~a19~0 1)) (.cse0 (not .cse6)) (.cse2 (= ~a17~0 8)) (.cse5 (not .cse3)) (.cse10 (not .cse9)) (.cse8 (not (= ~a28~0 11)))) (or (and (and .cse0 .cse1) .cse2 .cse3) (and .cse1 .cse4) (and .cse5 .cse6 .cse4 .cse7) (and (and .cse1 .cse7 .cse8) .cse3) (and .cse9 .cse3 .cse7) (and .cse9 .cse2 .cse1) (and .cse2 .cse10 .cse0 .cse8) (and .cse2 .cse5 .cse10 .cse8)))) [2019-11-19 20:53:29,960 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,960 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,960 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-19 20:53:29,960 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-19 20:53:29,961 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-19 20:53:29,961 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-19 20:53:29,961 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-19 20:53:29,961 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,961 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,961 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-19 20:53:29,962 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-19 20:53:29,962 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-19 20:53:29,962 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-19 20:53:29,962 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-19 20:53:29,962 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-19 20:53:29,962 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-19 20:53:29,963 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-19 20:53:29,963 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-19 20:53:29,963 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,963 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,963 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-19 20:53:29,964 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,964 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-19 20:53:29,964 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-19 20:53:29,964 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-19 20:53:29,964 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-19 20:53:29,964 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-19 20:53:29,965 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:53:29,965 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-19 20:53:29,965 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,965 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,965 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,965 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-19 20:53:29,966 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-19 20:53:29,966 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-19 20:53:29,966 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-19 20:53:29,966 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-19 20:53:29,966 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,966 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,967 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,967 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-19 20:53:29,967 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-19 20:53:29,967 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-19 20:53:29,967 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-19 20:53:29,967 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-19 20:53:29,968 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-19 20:53:29,968 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,968 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,968 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,968 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-19 20:53:29,968 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-19 20:53:29,969 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-19 20:53:29,969 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-19 20:53:29,969 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-19 20:53:29,969 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-19 20:53:29,969 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:53:29,969 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-19 20:53:29,970 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-19 20:53:29,970 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,970 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,970 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,970 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-19 20:53:29,970 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-19 20:53:29,970 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-19 20:53:29,971 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-19 20:53:29,971 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-19 20:53:29,971 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,971 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,971 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-19 20:53:29,971 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-19 20:53:29,972 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-19 20:53:29,972 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-19 20:53:29,972 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-19 20:53:29,972 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-19 20:53:29,972 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-19 20:53:29,972 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-19 20:53:29,972 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-19 20:53:29,973 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-19 20:53:29,973 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-19 20:53:29,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:53:29 BoogieIcfgContainer [2019-11-19 20:53:29,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:53:29,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:53:29,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:53:29,994 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:53:29,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:53:18" (3/4) ... [2019-11-19 20:53:29,999 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:53:30,021 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:53:30,022 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:53:30,180 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:53:30,180 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:53:30,182 INFO L168 Benchmark]: Toolchain (without parser) took 13825.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 445.1 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -208.0 MB). Peak memory consumption was 237.1 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:30,182 INFO L168 Benchmark]: CDTParser took 0.54 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-19 20:53:30,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 849.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:30,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.62 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:30,184 INFO L168 Benchmark]: Boogie Preprocessor took 97.02 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:30,184 INFO L168 Benchmark]: RCFGBuilder took 1469.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:30,185 INFO L168 Benchmark]: TraceAbstraction took 11118.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -184.9 MB). Peak memory consumption was 110.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:30,185 INFO L168 Benchmark]: Witness Printer took 186.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-19 20:53:30,187 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.54 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 849.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.62 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.02 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1469.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11118.13 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -184.9 MB). Peak memory consumption was 110.8 MB. Max. memory is 11.5 GB. * Witness Printer took 186.12 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 475]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((!(1 == a11) && a19 == 1) && a17 == 8) && a25 == 1) || (a19 == 1 && 10 == a28)) || (((!(a25 == 1) && 1 == a11) && 10 == a28) && a17 <= 8)) || (((a19 == 1 && a17 <= 8) && !(a28 == 11)) && a25 == 1)) || ((a28 == 9 && a25 == 1) && a17 <= 8)) || ((a28 == 9 && a17 == 8) && a19 == 1)) || (((a17 == 8 && !(a28 == 9)) && !(1 == a11)) && !(a28 == 11))) || (((a17 == 8 && !(a25 == 1)) && !(a28 == 9)) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((!(1 == a11) && a19 == 1) && a17 == 8) && a25 == 1) || (a19 == 1 && 10 == a28)) || (((!(a25 == 1) && 1 == a11) && 10 == a28) && a17 <= 8)) || (((a19 == 1 && a17 <= 8) && !(a28 == 11)) && a25 == 1)) || ((a28 == 9 && a25 == 1) && a17 <= 8)) || ((a28 == 9 && a17 == 8) && a19 == 1)) || (((a17 == 8 && !(a28 == 9)) && !(1 == a11)) && !(a28 == 11))) || (((a17 == 8 && !(a25 == 1)) && !(a28 == 9)) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 11.0s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 803 SDtfs, 2334 SDslu, 259 SDs, 0 SdLazy, 5614 SolverSat, 808 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred in iteration=5, 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, 9 MinimizatonAttempts, 1875 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 35 NumberOfFragments, 209 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1434 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 818 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1268 ConstructedInterpolants, 0 QuantifiedInterpolants, 617302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 420/420 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...