./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer --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 0efda15f8357629016064e69e444205aff537305 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:56:15,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:15,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:15,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:15,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:15,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:15,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:15,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:15,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:15,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:15,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:15,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:15,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:15,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:15,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:15,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:15,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:15,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:15,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:15,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:15,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:15,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:15,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:15,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:15,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:15,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:15,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:15,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:15,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:15,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:15,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:15,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:15,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:15,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:15,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:15,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:15,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:15,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:15,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:15,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:15,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:15,075 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:56:15,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:15,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:15,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:15,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:15,088 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:15,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:15,088 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:15,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:56:15,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:15,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:15,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:56:15,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:56:15,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:56:15,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:15,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:56:15,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:15,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:56:15,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:15,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:15,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:56:15,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:56:15,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:56:15,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:15,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:56:15,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:56:15,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:56:15,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:56:15,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:56:15,096 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer 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 -> 0efda15f8357629016064e69e444205aff537305 [2019-11-25 08:56:15,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:15,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:15,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:15,263 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:15,263 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:15,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2019-11-25 08:56:15,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/data/26f503c06/7d32426127e64acbb263ca30f61363e4/FLAG5fa4e1e93 [2019-11-25 08:56:15,822 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:15,822 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2019-11-25 08:56:15,832 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/data/26f503c06/7d32426127e64acbb263ca30f61363e4/FLAG5fa4e1e93 [2019-11-25 08:56:16,285 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/data/26f503c06/7d32426127e64acbb263ca30f61363e4 [2019-11-25 08:56:16,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:16,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:56:16,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:16,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:16,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:16,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:16,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e94434d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16, skipping insertion in model container [2019-11-25 08:56:16,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:16,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:16,361 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:16,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:16,789 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:16,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:16,905 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:16,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16 WrapperNode [2019-11-25 08:56:16,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:16,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:16,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:56:16,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:56:16,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:16,940 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:17,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:17,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:17,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:17,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:17,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:17,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:17,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:17,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:17,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:17,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:17,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... [2019-11-25 08:56:17,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:17,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:17,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:17,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:17,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/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-25 08:56:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:17,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:18,361 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:18,361 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:56:18,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:18 BoogieIcfgContainer [2019-11-25 08:56:18,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:18,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:56:18,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:56:18,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:56:18,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:56:16" (1/3) ... [2019-11-25 08:56:18,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8d9287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:18, skipping insertion in model container [2019-11-25 08:56:18,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:16" (2/3) ... [2019-11-25 08:56:18,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8d9287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:18, skipping insertion in model container [2019-11-25 08:56:18,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:18" (3/3) ... [2019-11-25 08:56:18,374 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label48.c [2019-11-25 08:56:18,385 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:56:18,393 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:56:18,403 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:56:18,427 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:56:18,427 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:56:18,428 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:56:18,428 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:18,428 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:18,428 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:56:18,428 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:18,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:56:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:56:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:56:18,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:18,461 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:18,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1763883850, now seen corresponding path program 1 times [2019-11-25 08:56:18,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:18,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945867431] [2019-11-25 08:56:18,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:19,048 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-25 08:56:19,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945867431] [2019-11-25 08:56:19,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:19,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:19,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893622926] [2019-11-25 08:56:19,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:19,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:19,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:19,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:19,074 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-25 08:56:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:20,426 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-25 08:56:20,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:20,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-25 08:56:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:20,448 INFO L225 Difference]: With dead ends: 662 [2019-11-25 08:56:20,448 INFO L226 Difference]: Without dead ends: 397 [2019-11-25 08:56:20,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-25 08:56:20,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-25 08:56:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-25 08:56:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-25 08:56:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 577 transitions. [2019-11-25 08:56:20,530 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 577 transitions. Word has length 121 [2019-11-25 08:56:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:20,531 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 577 transitions. [2019-11-25 08:56:20,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 577 transitions. [2019-11-25 08:56:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-25 08:56:20,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:20,535 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:20,536 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1818986610, now seen corresponding path program 1 times [2019-11-25 08:56:20,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:20,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921404582] [2019-11-25 08:56:20,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:20,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921404582] [2019-11-25 08:56:20,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:20,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:20,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610374410] [2019-11-25 08:56:20,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:20,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:20,608 INFO L87 Difference]: Start difference. First operand 397 states and 577 transitions. Second operand 3 states. [2019-11-25 08:56:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:21,137 INFO L93 Difference]: Finished difference Result 1185 states and 1726 transitions. [2019-11-25 08:56:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:21,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-25 08:56:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:21,142 INFO L225 Difference]: With dead ends: 1185 [2019-11-25 08:56:21,142 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:56:21,144 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-25 08:56:21,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:56:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-25 08:56:21,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-25 08:56:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-11-25 08:56:21,196 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 134 [2019-11-25 08:56:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:21,196 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-11-25 08:56:21,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-11-25 08:56:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-25 08:56:21,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:21,206 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:21,206 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1407656640, now seen corresponding path program 1 times [2019-11-25 08:56:21,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:21,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52665035] [2019-11-25 08:56:21,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:56:21,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52665035] [2019-11-25 08:56:21,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:21,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:21,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367595743] [2019-11-25 08:56:21,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:21,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:21,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:21,355 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-11-25 08:56:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:22,177 INFO L93 Difference]: Finished difference Result 2233 states and 3034 transitions. [2019-11-25 08:56:22,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:22,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-25 08:56:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:22,189 INFO L225 Difference]: With dead ends: 2233 [2019-11-25 08:56:22,189 INFO L226 Difference]: Without dead ends: 1576 [2019-11-25 08:56:22,191 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-25 08:56:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-25 08:56:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-11-25 08:56:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-25 08:56:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1879 transitions. [2019-11-25 08:56:22,238 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1879 transitions. Word has length 143 [2019-11-25 08:56:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:22,239 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1879 transitions. [2019-11-25 08:56:22,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1879 transitions. [2019-11-25 08:56:22,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-25 08:56:22,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:22,256 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:22,256 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:22,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1463287631, now seen corresponding path program 1 times [2019-11-25 08:56:22,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:22,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271196379] [2019-11-25 08:56:22,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:56:22,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271196379] [2019-11-25 08:56:22,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:22,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:22,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330705737] [2019-11-25 08:56:22,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:22,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:22,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:22,405 INFO L87 Difference]: Start difference. First operand 1445 states and 1879 transitions. Second operand 4 states. [2019-11-25 08:56:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:23,063 INFO L93 Difference]: Finished difference Result 3027 states and 3913 transitions. [2019-11-25 08:56:23,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:56:23,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-25 08:56:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:23,073 INFO L225 Difference]: With dead ends: 3027 [2019-11-25 08:56:23,073 INFO L226 Difference]: Without dead ends: 1584 [2019-11-25 08:56:23,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-11-25 08:56:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1576. [2019-11-25 08:56:23,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-25 08:56:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2016 transitions. [2019-11-25 08:56:23,128 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2016 transitions. Word has length 149 [2019-11-25 08:56:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:23,129 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2016 transitions. [2019-11-25 08:56:23,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2016 transitions. [2019-11-25 08:56:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-25 08:56:23,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:23,134 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:23,135 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash -572408455, now seen corresponding path program 1 times [2019-11-25 08:56:23,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:23,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588372622] [2019-11-25 08:56:23,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:56:23,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588372622] [2019-11-25 08:56:23,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:23,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:56:23,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070996450] [2019-11-25 08:56:23,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:56:23,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:56:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:23,273 INFO L87 Difference]: Start difference. First operand 1576 states and 2016 transitions. Second operand 5 states. [2019-11-25 08:56:24,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:24,264 INFO L93 Difference]: Finished difference Result 3281 states and 4233 transitions. [2019-11-25 08:56:24,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:56:24,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-25 08:56:24,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:24,274 INFO L225 Difference]: With dead ends: 3281 [2019-11-25 08:56:24,275 INFO L226 Difference]: Without dead ends: 1838 [2019-11-25 08:56:24,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-25 08:56:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-25 08:56:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:56:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2308 transitions. [2019-11-25 08:56:24,326 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2308 transitions. Word has length 153 [2019-11-25 08:56:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:24,327 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2308 transitions. [2019-11-25 08:56:24,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:56:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2308 transitions. [2019-11-25 08:56:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-25 08:56:24,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:24,332 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:24,333 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1905945086, now seen corresponding path program 1 times [2019-11-25 08:56:24,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:24,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841180452] [2019-11-25 08:56:24,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-25 08:56:24,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841180452] [2019-11-25 08:56:24,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:24,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:24,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740220400] [2019-11-25 08:56:24,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:24,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:24,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:24,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:24,392 INFO L87 Difference]: Start difference. First operand 1838 states and 2308 transitions. Second operand 3 states. [2019-11-25 08:56:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:24,902 INFO L93 Difference]: Finished difference Result 4329 states and 5505 transitions. [2019-11-25 08:56:24,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:24,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-25 08:56:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:24,955 INFO L225 Difference]: With dead ends: 4329 [2019-11-25 08:56:24,955 INFO L226 Difference]: Without dead ends: 2362 [2019-11-25 08:56:24,957 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-25 08:56:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-25 08:56:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1969. [2019-11-25 08:56:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:56:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2242 transitions. [2019-11-25 08:56:25,003 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2242 transitions. Word has length 156 [2019-11-25 08:56:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:25,004 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2242 transitions. [2019-11-25 08:56:25,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2242 transitions. [2019-11-25 08:56:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-25 08:56:25,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:25,010 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:56:25,010 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1955275782, now seen corresponding path program 1 times [2019-11-25 08:56:25,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:25,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680323207] [2019-11-25 08:56:25,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:25,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680323207] [2019-11-25 08:56:25,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:25,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:56:25,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025089449] [2019-11-25 08:56:25,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:56:25,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:25,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:56:25,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:25,138 INFO L87 Difference]: Start difference. First operand 1969 states and 2242 transitions. Second operand 5 states. [2019-11-25 08:56:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:26,118 INFO L93 Difference]: Finished difference Result 5246 states and 6053 transitions. [2019-11-25 08:56:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:56:26,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-11-25 08:56:26,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:26,135 INFO L225 Difference]: With dead ends: 5246 [2019-11-25 08:56:26,135 INFO L226 Difference]: Without dead ends: 3410 [2019-11-25 08:56:26,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2019-11-25 08:56:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 2755. [2019-11-25 08:56:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2019-11-25 08:56:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3075 transitions. [2019-11-25 08:56:26,205 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3075 transitions. Word has length 171 [2019-11-25 08:56:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:26,205 INFO L462 AbstractCegarLoop]: Abstraction has 2755 states and 3075 transitions. [2019-11-25 08:56:26,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:56:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3075 transitions. [2019-11-25 08:56:26,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-25 08:56:26,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:26,213 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:26,213 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:26,214 INFO L82 PathProgramCache]: Analyzing trace with hash 731241800, now seen corresponding path program 1 times [2019-11-25 08:56:26,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:26,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498951128] [2019-11-25 08:56:26,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-25 08:56:26,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498951128] [2019-11-25 08:56:26,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799080277] [2019-11-25 08:56:26,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:26,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:26,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-11-25 08:56:26,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:56:26,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:56:26,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907592097] [2019-11-25 08:56:26,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:26,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:26,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:26,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:26,800 INFO L87 Difference]: Start difference. First operand 2755 states and 3075 transitions. Second operand 3 states. [2019-11-25 08:56:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:27,269 INFO L93 Difference]: Finished difference Result 5639 states and 6302 transitions. [2019-11-25 08:56:27,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:27,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-11-25 08:56:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:27,283 INFO L225 Difference]: With dead ends: 5639 [2019-11-25 08:56:27,284 INFO L226 Difference]: Without dead ends: 2755 [2019-11-25 08:56:27,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:27,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-25 08:56:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2493. [2019-11-25 08:56:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-11-25 08:56:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2700 transitions. [2019-11-25 08:56:27,343 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2700 transitions. Word has length 237 [2019-11-25 08:56:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:27,345 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2700 transitions. [2019-11-25 08:56:27,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2700 transitions. [2019-11-25 08:56:27,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-25 08:56:27,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:27,352 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:27,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:27,556 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:27,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:27,556 INFO L82 PathProgramCache]: Analyzing trace with hash -786840920, now seen corresponding path program 1 times [2019-11-25 08:56:27,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:27,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786830328] [2019-11-25 08:56:27,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-25 08:56:27,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786830328] [2019-11-25 08:56:27,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:27,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:56:27,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134918207] [2019-11-25 08:56:27,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:27,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:27,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:27,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:27,707 INFO L87 Difference]: Start difference. First operand 2493 states and 2700 transitions. Second operand 4 states. [2019-11-25 08:56:28,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:28,214 INFO L93 Difference]: Finished difference Result 5508 states and 5981 transitions. [2019-11-25 08:56:28,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:28,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-25 08:56:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:28,229 INFO L225 Difference]: With dead ends: 5508 [2019-11-25 08:56:28,229 INFO L226 Difference]: Without dead ends: 2886 [2019-11-25 08:56:28,232 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-25 08:56:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-11-25 08:56:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2362. [2019-11-25 08:56:28,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-11-25 08:56:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2557 transitions. [2019-11-25 08:56:28,280 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2557 transitions. Word has length 240 [2019-11-25 08:56:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:28,280 INFO L462 AbstractCegarLoop]: Abstraction has 2362 states and 2557 transitions. [2019-11-25 08:56:28,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2557 transitions. [2019-11-25 08:56:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-25 08:56:28,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:28,287 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:28,288 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1721505113, now seen corresponding path program 1 times [2019-11-25 08:56:28,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:28,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284290261] [2019-11-25 08:56:28,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 233 proven. 27 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-25 08:56:28,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284290261] [2019-11-25 08:56:28,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817551900] [2019-11-25 08:56:28,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:28,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:28,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-11-25 08:56:28,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:56:28,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:56:28,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312409414] [2019-11-25 08:56:28,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:28,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:28,745 INFO L87 Difference]: Start difference. First operand 2362 states and 2557 transitions. Second operand 3 states. [2019-11-25 08:56:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:29,136 INFO L93 Difference]: Finished difference Result 4982 states and 5390 transitions. [2019-11-25 08:56:29,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:29,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-25 08:56:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:29,136 INFO L225 Difference]: With dead ends: 4982 [2019-11-25 08:56:29,137 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:56:29,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:29,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:56:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:56:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:56:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:56:29,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2019-11-25 08:56:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:29,142 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:56:29,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:56:29,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:56:29,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:29,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:56:30,058 WARN L192 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2019-11-25 08:56:30,635 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-11-25 08:56:30,637 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:56:30,637 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:56:30,637 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:56:30,638 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,639 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,640 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:56:30,640 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:56:30,640 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:56:30,640 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:56:30,640 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:56:30,640 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:56:30,640 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:56:30,640 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,641 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,642 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,642 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,642 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,642 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:56:30,642 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:56:30,642 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:56:30,642 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:56:30,642 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:56:30,643 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:56:30,643 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:56:30,643 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:56:30,643 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:56:30,643 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse7 (= 15 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse3 (<= ~a16~0 4)) (.cse4 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not (= 14 ~a8~0))) (.cse6 (= ~a16~0 5)) (.cse11 (<= 14 ~a8~0)) (.cse8 (not (= ~a16~0 6))) (.cse10 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse7 .cse6) (and .cse4 .cse3) (and .cse4 .cse8 .cse0 .cse9 .cse1) (and .cse10 .cse2 .cse3) (and .cse11 .cse0 .cse9 .cse1 .cse5) (and .cse11 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2) (and .cse2 .cse7 (not .cse0)) (and .cse7 .cse5) (and .cse4 .cse10 .cse9 .cse2) (and .cse5 .cse3) (and .cse4 .cse0 .cse9 .cse2 .cse6) (and .cse11 .cse8 .cse10 .cse2))) [2019-11-25 08:56:30,643 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,644 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,644 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,644 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,645 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,645 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:56:30,645 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:56:30,645 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:56:30,646 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:56:30,646 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:56:30,646 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:56:30,646 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:56:30,646 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:56:30,646 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:56:30,647 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:56:30,647 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:56:30,647 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:56:30,647 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:56:30,647 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:56:30,647 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,648 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,648 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,648 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,648 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,648 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:56:30,648 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:56:30,649 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:56:30,649 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:56:30,649 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:56:30,649 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:56:30,649 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:56:30,649 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:56:30,650 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:56:30,650 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,650 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,650 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,650 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,650 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:56:30,651 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,651 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:56:30,651 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:56:30,651 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:56:30,651 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:56:30,651 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:56:30,652 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:56:30,652 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:56:30,652 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:56:30,652 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:56:30,652 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:56:30,652 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:56:30,653 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:56:30,653 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:56:30,653 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:56:30,653 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,654 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a21~0 1)) (.cse7 (= 15 ~a8~0)) (.cse5 (<= ~a20~0 0)) (.cse3 (<= ~a16~0 4)) (.cse4 (= 1 ~a7~0)) (.cse0 (= ~a17~0 1)) (.cse9 (not (= 14 ~a8~0))) (.cse6 (= ~a16~0 5)) (.cse11 (<= 14 ~a8~0)) (.cse8 (not (= ~a16~0 6))) (.cse10 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse7 .cse6) (and .cse4 .cse3) (and .cse4 .cse8 .cse0 .cse9 .cse1) (and .cse10 .cse2 .cse3) (and .cse11 .cse0 .cse9 .cse1 .cse5) (and .cse11 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2) (and .cse2 .cse7 (not .cse0)) (and .cse7 .cse5) (and .cse4 .cse10 .cse9 .cse2) (and .cse5 .cse3) (and .cse4 .cse0 .cse9 .cse2 .cse6) (and .cse11 .cse8 .cse10 .cse2))) [2019-11-25 08:56:30,654 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,654 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,654 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,654 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,654 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:56:30,655 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:56:30,655 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:56:30,655 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:56:30,655 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:56:30,655 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:56:30,655 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:56:30,656 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:56:30,656 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,656 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,656 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,656 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,656 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,657 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:56:30,657 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:56:30,657 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:56:30,657 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:56:30,657 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:56:30,657 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:56:30,658 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:56:30,658 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:56:30,658 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:56:30,658 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:56:30,658 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:56:30,658 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:56:30,659 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:56:30,659 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,659 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,659 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,659 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,659 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:56:30,660 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,660 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,660 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:56:30,660 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:56:30,660 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:56:30,660 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:56:30,661 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:56:30,661 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:56:30,661 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:56:30,661 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:56:30,661 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:56:30,661 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:56:30,662 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:56:30,662 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:56:30,662 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:56:30,662 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,662 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,663 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,663 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,663 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,663 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:56:30,663 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,663 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:56:30,664 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:56:30,664 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:56:30,664 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:56:30,664 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:56:30,664 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:56:30,664 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:56:30,665 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:56:30,665 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:56:30,665 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:56:30,665 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:56:30,665 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:56:30,665 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 539) no Hoare annotation was computed. [2019-11-25 08:56:30,666 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:56:30,666 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:56:30,666 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:56:30,666 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,666 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,666 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,667 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,667 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,667 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:30,667 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:56:30,667 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:56:30,667 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:56:30,668 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:56:30,668 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:56:30,668 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:56:30,668 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:56:30,668 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:56:30,668 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:56:30,669 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:56:30,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:30 BoogieIcfgContainer [2019-11-25 08:56:30,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:30,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:30,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:30,691 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:30,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:18" (3/4) ... [2019-11-25 08:56:30,695 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:56:30,719 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:56:30,720 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:56:30,914 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d4f8cd05-b6d5-4103-aaa2-d6ff8bf36d4d/bin/uautomizer/witness.graphml [2019-11-25 08:56:30,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:30,915 INFO L168 Benchmark]: Toolchain (without parser) took 14627.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 407.4 MB). Free memory was 944.7 MB in the beginning and 865.0 MB in the end (delta: 79.7 MB). Peak memory consumption was 487.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:30,916 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:30,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:30,917 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:30,917 INFO L168 Benchmark]: Boogie Preprocessor took 83.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:30,918 INFO L168 Benchmark]: RCFGBuilder took 1270.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.1 MB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:30,918 INFO L168 Benchmark]: TraceAbstraction took 12326.69 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 288.9 MB). Free memory was 970.1 MB in the beginning and 891.6 MB in the end (delta: 78.5 MB). Peak memory consumption was 367.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:30,918 INFO L168 Benchmark]: Witness Printer took 223.54 ms. Allocated memory is still 1.4 GB. Free memory was 891.6 MB in the beginning and 865.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:30,920 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 617.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1270.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 970.1 MB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12326.69 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 288.9 MB). Free memory was 970.1 MB in the beginning and 891.6 MB in the end (delta: 78.5 MB). Peak memory consumption was 367.4 MB. Max. memory is 11.5 GB. * Witness Printer took 223.54 ms. Allocated memory is still 1.4 GB. Free memory was 891.6 MB in the beginning and 865.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 539]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4) || ((1 == a7 && a20 <= 0) && a16 == 5)) || ((1 == a7 && 15 == a8) && a16 == 5)) || (1 == a7 && a16 <= 4)) || ((((1 == a7 && !(a16 == 6)) && a17 == 1) && !(14 == a8)) && a21 == 1)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || ((((14 <= a8 && a17 == 1) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((14 <= a8 && a20 <= 0) && a16 == 5)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || (15 == a8 && a20 <= 0)) || (((1 == a7 && a17 <= 0) && !(14 == a8)) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && a16 <= 4) || ((1 == a7 && a20 <= 0) && a16 == 5)) || ((1 == a7 && 15 == a8) && a16 == 5)) || (1 == a7 && a16 <= 4)) || ((((1 == a7 && !(a16 == 6)) && a17 == 1) && !(14 == a8)) && a21 == 1)) || ((a17 <= 0 && a20 == 1) && a16 <= 4)) || ((((14 <= a8 && a17 == 1) && !(14 == a8)) && a21 == 1) && a20 <= 0)) || ((14 <= a8 && a20 <= 0) && a16 == 5)) || (((a17 == 1 && !(14 == a8)) && a21 == 1) && a20 == 1)) || ((a20 == 1 && 15 == a8) && !(a17 == 1))) || (15 == a8 && a20 <= 0)) || (((1 == a7 && a17 <= 0) && !(14 == a8)) && a20 == 1)) || (a20 <= 0 && a16 <= 4)) || ((((1 == a7 && a17 == 1) && !(14 == a8)) && a20 == 1) && a16 == 5)) || (((14 <= a8 && !(a16 == 6)) && a17 <= 0) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 12.2s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 823 SDtfs, 2137 SDslu, 102 SDs, 0 SdLazy, 4955 SolverSat, 923 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 510 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2755occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 2104 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 54 NumberOfFragments, 361 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1711 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1405 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2267 NumberOfCodeBlocks, 2267 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2255 ConstructedInterpolants, 0 QuantifiedInterpolants, 907136 SizeOfPredicates, 2 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 1627/1681 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...