./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/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 59598ef74ac7afb6c962e2cc2ba26af488759b7c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:08:20,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:08:20,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:08:20,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:08:20,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:08:20,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:08:20,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:08:20,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:08:20,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:08:20,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:08:20,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:08:20,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:08:20,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:08:20,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:08:20,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:08:20,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:08:20,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:08:20,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:08:20,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:08:20,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:08:20,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:08:20,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:08:20,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:08:20,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:08:20,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:08:20,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:08:20,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:08:20,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:08:20,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:08:20,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:08:20,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:08:20,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:08:20,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:08:20,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:08:20,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:08:20,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:08:20,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:08:20,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:08:20,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:08:20,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:08:20,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:08:20,806 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:08:20,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:08:20,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:08:20,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:08:20,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:08:20,819 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:08:20,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:08:20,819 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:08:20,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:08:20,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:08:20,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:08:20,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:08:20,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:08:20,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:08:20,820 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:08:20,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:08:20,821 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:08:20,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:08:20,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:08:20,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:08:20,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:08:20,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:08:20,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:08:20,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:08:20,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:08:20,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:08:20,822 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:08:20,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:08:20,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:08:20,823 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:08:20,823 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_573714cb-ab94-4500-a533-3345ba3472c4/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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-12-07 18:08:20,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:08:20,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:08:20,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:08:20,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:08:20,944 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:08:20,945 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-12-07 18:08:20,980 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/data/37d7d2dcc/dfcf2f13bf0941539b946891d5f001e1/FLAG268014ec0 [2019-12-07 18:08:21,411 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:08:21,411 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-12-07 18:08:21,417 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/data/37d7d2dcc/dfcf2f13bf0941539b946891d5f001e1/FLAG268014ec0 [2019-12-07 18:08:21,425 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/data/37d7d2dcc/dfcf2f13bf0941539b946891d5f001e1 [2019-12-07 18:08:21,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:08:21,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:08:21,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:08:21,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:08:21,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:08:21,431 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa9bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21, skipping insertion in model container [2019-12-07 18:08:21,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:08:21,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:08:21,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:08:21,619 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:08:21,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:08:21,654 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:08:21,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21 WrapperNode [2019-12-07 18:08:21,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:08:21,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:08:21,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:08:21,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:08:21,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:08:21,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:08:21,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:08:21,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:08:21,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... [2019-12-07 18:08:21,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:08:21,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:08:21,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:08:21,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:08:21,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/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-12-07 18:08:21,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:08:21,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:08:22,060 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:08:22,061 INFO L287 CfgBuilder]: Removed 82 assume(true) statements. [2019-12-07 18:08:22,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:08:22 BoogieIcfgContainer [2019-12-07 18:08:22,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:08:22,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:08:22,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:08:22,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:08:22,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:08:21" (1/3) ... [2019-12-07 18:08:22,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a0cbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:08:22, skipping insertion in model container [2019-12-07 18:08:22,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:08:21" (2/3) ... [2019-12-07 18:08:22,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a0cbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:08:22, skipping insertion in model container [2019-12-07 18:08:22,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:08:22" (3/3) ... [2019-12-07 18:08:22,068 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-12-07 18:08:22,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:08:22,083 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:08:22,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 18:08:22,112 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:08:22,113 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:08:22,113 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:08:22,113 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:08:22,113 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:08:22,113 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:08:22,113 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:08:22,113 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:08:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 18:08:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:08:22,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,131 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] [2019-12-07 18:08:22,132 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,135 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-12-07 18:08:22,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10932313] [2019-12-07 18:08:22,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:22,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10932313] [2019-12-07 18:08:22,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:22,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816589773] [2019-12-07 18:08:22,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:22,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:22,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:22,254 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-12-07 18:08:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:22,288 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2019-12-07 18:08:22,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:22,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:08:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:22,297 INFO L225 Difference]: With dead ends: 291 [2019-12-07 18:08:22,298 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 18:08:22,300 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-12-07 18:08:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 18:08:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-12-07 18:08:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 18:08:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-12-07 18:08:22,333 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2019-12-07 18:08:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:22,334 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-12-07 18:08:22,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-12-07 18:08:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:08:22,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,335 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] [2019-12-07 18:08:22,335 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-12-07 18:08:22,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920276592] [2019-12-07 18:08:22,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:22,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920276592] [2019-12-07 18:08:22,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:22,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297729557] [2019-12-07 18:08:22,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:22,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:22,363 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2019-12-07 18:08:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:22,400 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2019-12-07 18:08:22,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:22,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:08:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:22,402 INFO L225 Difference]: With dead ends: 384 [2019-12-07 18:08:22,402 INFO L226 Difference]: Without dead ends: 246 [2019-12-07 18:08:22,404 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-12-07 18:08:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-12-07 18:08:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-12-07 18:08:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 18:08:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2019-12-07 18:08:22,425 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2019-12-07 18:08:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:22,425 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2019-12-07 18:08:22,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2019-12-07 18:08:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:08:22,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,427 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] [2019-12-07 18:08:22,427 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-12-07 18:08:22,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162665772] [2019-12-07 18:08:22,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:22,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162665772] [2019-12-07 18:08:22,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:22,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538765744] [2019-12-07 18:08:22,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:22,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:22,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:22,456 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 3 states. [2019-12-07 18:08:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:22,479 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2019-12-07 18:08:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:22,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:08:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:22,481 INFO L225 Difference]: With dead ends: 477 [2019-12-07 18:08:22,481 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 18:08:22,482 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-12-07 18:08:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 18:08:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-12-07 18:08:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 18:08:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2019-12-07 18:08:22,497 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2019-12-07 18:08:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:22,497 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2019-12-07 18:08:22,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2019-12-07 18:08:22,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:08:22,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,498 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] [2019-12-07 18:08:22,498 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,499 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-12-07 18:08:22,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722440196] [2019-12-07 18:08:22,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:22,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722440196] [2019-12-07 18:08:22,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:22,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923574752] [2019-12-07 18:08:22,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:22,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:22,520 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand 3 states. [2019-12-07 18:08:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:22,550 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2019-12-07 18:08:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:22,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:08:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:22,552 INFO L225 Difference]: With dead ends: 476 [2019-12-07 18:08:22,552 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 18:08:22,552 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-12-07 18:08:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 18:08:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-12-07 18:08:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 18:08:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2019-12-07 18:08:22,564 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2019-12-07 18:08:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:22,564 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2019-12-07 18:08:22,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2019-12-07 18:08:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:08:22,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,565 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] [2019-12-07 18:08:22,565 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-12-07 18:08:22,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848828661] [2019-12-07 18:08:22,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:22,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848828661] [2019-12-07 18:08:22,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:22,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222560562] [2019-12-07 18:08:22,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:22,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:22,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:22,585 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 3 states. [2019-12-07 18:08:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:22,611 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2019-12-07 18:08:22,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:22,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:08:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:22,613 INFO L225 Difference]: With dead ends: 475 [2019-12-07 18:08:22,613 INFO L226 Difference]: Without dead ends: 242 [2019-12-07 18:08:22,613 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-12-07 18:08:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-12-07 18:08:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-12-07 18:08:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 18:08:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2019-12-07 18:08:22,622 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 39 [2019-12-07 18:08:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:22,623 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2019-12-07 18:08:22,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2019-12-07 18:08:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:08:22,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,624 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] [2019-12-07 18:08:22,624 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-12-07 18:08:22,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744008336] [2019-12-07 18:08:22,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:22,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744008336] [2019-12-07 18:08:22,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:08:22,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695149438] [2019-12-07 18:08:22,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:22,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:22,657 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand 3 states. [2019-12-07 18:08:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:22,690 INFO L93 Difference]: Finished difference Result 662 states and 893 transitions. [2019-12-07 18:08:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:22,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:08:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:22,693 INFO L225 Difference]: With dead ends: 662 [2019-12-07 18:08:22,693 INFO L226 Difference]: Without dead ends: 431 [2019-12-07 18:08:22,694 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-12-07 18:08:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-07 18:08:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2019-12-07 18:08:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 18:08:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2019-12-07 18:08:22,708 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 39 [2019-12-07 18:08:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:22,708 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2019-12-07 18:08:22,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2019-12-07 18:08:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:08:22,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,710 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:08:22,710 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash 407580417, now seen corresponding path program 1 times [2019-12-07 18:08:22,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496954988] [2019-12-07 18:08:22,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:22,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496954988] [2019-12-07 18:08:22,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:08:22,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591300948] [2019-12-07 18:08:22,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:22,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:22,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:22,768 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand 5 states. [2019-12-07 18:08:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:22,856 INFO L93 Difference]: Finished difference Result 985 states and 1321 transitions. [2019-12-07 18:08:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:08:22,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 18:08:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:22,861 INFO L225 Difference]: With dead ends: 985 [2019-12-07 18:08:22,861 INFO L226 Difference]: Without dead ends: 593 [2019-12-07 18:08:22,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:08:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-12-07 18:08:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 413. [2019-12-07 18:08:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 18:08:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 533 transitions. [2019-12-07 18:08:22,891 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 533 transitions. Word has length 63 [2019-12-07 18:08:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:22,891 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 533 transitions. [2019-12-07 18:08:22,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 533 transitions. [2019-12-07 18:08:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:08:22,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:22,893 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:08:22,893 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash 830282243, now seen corresponding path program 1 times [2019-12-07 18:08:22,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:22,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981351216] [2019-12-07 18:08:22,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:22,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981351216] [2019-12-07 18:08:22,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:22,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:22,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383429298] [2019-12-07 18:08:22,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:22,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:22,937 INFO L87 Difference]: Start difference. First operand 413 states and 533 transitions. Second operand 3 states. [2019-12-07 18:08:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:23,003 INFO L93 Difference]: Finished difference Result 1143 states and 1486 transitions. [2019-12-07 18:08:23,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:23,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-07 18:08:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:23,008 INFO L225 Difference]: With dead ends: 1143 [2019-12-07 18:08:23,009 INFO L226 Difference]: Without dead ends: 747 [2019-12-07 18:08:23,009 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-12-07 18:08:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-12-07 18:08:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 715. [2019-12-07 18:08:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-07 18:08:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 925 transitions. [2019-12-07 18:08:23,040 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 925 transitions. Word has length 63 [2019-12-07 18:08:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:23,041 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 925 transitions. [2019-12-07 18:08:23,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 925 transitions. [2019-12-07 18:08:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:08:23,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:23,042 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:08:23,042 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1821446916, now seen corresponding path program 1 times [2019-12-07 18:08:23,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:23,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666396164] [2019-12-07 18:08:23,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:23,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666396164] [2019-12-07 18:08:23,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:23,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:08:23,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925287907] [2019-12-07 18:08:23,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:08:23,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:08:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:08:23,085 INFO L87 Difference]: Start difference. First operand 715 states and 925 transitions. Second operand 5 states. [2019-12-07 18:08:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:23,187 INFO L93 Difference]: Finished difference Result 1617 states and 2113 transitions. [2019-12-07 18:08:23,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:08:23,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 18:08:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:23,191 INFO L225 Difference]: With dead ends: 1617 [2019-12-07 18:08:23,191 INFO L226 Difference]: Without dead ends: 923 [2019-12-07 18:08:23,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:08:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-07 18:08:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 721. [2019-12-07 18:08:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-12-07 18:08:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2019-12-07 18:08:23,228 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2019-12-07 18:08:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:23,228 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2019-12-07 18:08:23,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:08:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2019-12-07 18:08:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:08:23,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:23,229 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:08:23,229 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:23,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:23,230 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2019-12-07 18:08:23,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:23,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069588034] [2019-12-07 18:08:23,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:23,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069588034] [2019-12-07 18:08:23,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:23,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:23,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451460838] [2019-12-07 18:08:23,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:23,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:23,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:23,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:23,278 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 3 states. [2019-12-07 18:08:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:23,350 INFO L93 Difference]: Finished difference Result 2017 states and 2558 transitions. [2019-12-07 18:08:23,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:23,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-07 18:08:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:23,357 INFO L225 Difference]: With dead ends: 2017 [2019-12-07 18:08:23,357 INFO L226 Difference]: Without dead ends: 1321 [2019-12-07 18:08:23,358 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-12-07 18:08:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-12-07 18:08:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1317. [2019-12-07 18:08:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-12-07 18:08:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1638 transitions. [2019-12-07 18:08:23,401 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1638 transitions. Word has length 63 [2019-12-07 18:08:23,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:23,401 INFO L462 AbstractCegarLoop]: Abstraction has 1317 states and 1638 transitions. [2019-12-07 18:08:23,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1638 transitions. [2019-12-07 18:08:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 18:08:23,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:23,402 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 18:08:23,402 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2019-12-07 18:08:23,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:23,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807885266] [2019-12-07 18:08:23,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:23,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807885266] [2019-12-07 18:08:23,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:23,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:23,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919106904] [2019-12-07 18:08:23,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:23,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:23,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:23,426 INFO L87 Difference]: Start difference. First operand 1317 states and 1638 transitions. Second operand 3 states. [2019-12-07 18:08:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:23,512 INFO L93 Difference]: Finished difference Result 3670 states and 4533 transitions. [2019-12-07 18:08:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:23,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-07 18:08:23,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:23,519 INFO L225 Difference]: With dead ends: 3670 [2019-12-07 18:08:23,519 INFO L226 Difference]: Without dead ends: 1847 [2019-12-07 18:08:23,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-12-07 18:08:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2019-12-07 18:08:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-12-07 18:08:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2255 transitions. [2019-12-07 18:08:23,579 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2255 transitions. Word has length 64 [2019-12-07 18:08:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:23,580 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 2255 transitions. [2019-12-07 18:08:23,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2255 transitions. [2019-12-07 18:08:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 18:08:23,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:23,581 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-12-07 18:08:23,581 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:23,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1159062640, now seen corresponding path program 1 times [2019-12-07 18:08:23,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:23,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792315353] [2019-12-07 18:08:23,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 18:08:23,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792315353] [2019-12-07 18:08:23,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:23,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:23,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194915637] [2019-12-07 18:08:23,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:23,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:23,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:23,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:23,612 INFO L87 Difference]: Start difference. First operand 1847 states and 2255 transitions. Second operand 3 states. [2019-12-07 18:08:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:23,679 INFO L93 Difference]: Finished difference Result 3621 states and 4413 transitions. [2019-12-07 18:08:23,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:23,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-07 18:08:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:23,686 INFO L225 Difference]: With dead ends: 3621 [2019-12-07 18:08:23,686 INFO L226 Difference]: Without dead ends: 1799 [2019-12-07 18:08:23,688 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-12-07 18:08:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-12-07 18:08:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2019-12-07 18:08:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2019-12-07 18:08:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2119 transitions. [2019-12-07 18:08:23,748 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2119 transitions. Word has length 93 [2019-12-07 18:08:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:23,749 INFO L462 AbstractCegarLoop]: Abstraction has 1799 states and 2119 transitions. [2019-12-07 18:08:23,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2119 transitions. [2019-12-07 18:08:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 18:08:23,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:23,750 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:08:23,750 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380816, now seen corresponding path program 1 times [2019-12-07 18:08:23,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:23,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661656824] [2019-12-07 18:08:23,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:08:23,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661656824] [2019-12-07 18:08:23,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:23,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:23,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530334866] [2019-12-07 18:08:23,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:23,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:23,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:23,774 INFO L87 Difference]: Start difference. First operand 1799 states and 2119 transitions. Second operand 3 states. [2019-12-07 18:08:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:23,843 INFO L93 Difference]: Finished difference Result 3078 states and 3607 transitions. [2019-12-07 18:08:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:23,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-07 18:08:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:23,846 INFO L225 Difference]: With dead ends: 3078 [2019-12-07 18:08:23,846 INFO L226 Difference]: Without dead ends: 724 [2019-12-07 18:08:23,849 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-12-07 18:08:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-12-07 18:08:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-12-07 18:08:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-12-07 18:08:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2019-12-07 18:08:23,879 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2019-12-07 18:08:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:23,880 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2019-12-07 18:08:23,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2019-12-07 18:08:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 18:08:23,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:23,881 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] [2019-12-07 18:08:23,881 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:23,881 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2019-12-07 18:08:23,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:23,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791516360] [2019-12-07 18:08:23,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:08:23,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791516360] [2019-12-07 18:08:23,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:23,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:23,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110881952] [2019-12-07 18:08:23,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:23,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:23,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:23,917 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2019-12-07 18:08:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:23,954 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2019-12-07 18:08:23,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:23,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-07 18:08:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:23,957 INFO L225 Difference]: With dead ends: 1048 [2019-12-07 18:08:23,957 INFO L226 Difference]: Without dead ends: 594 [2019-12-07 18:08:23,958 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-12-07 18:08:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-07 18:08:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-12-07 18:08:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-12-07 18:08:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2019-12-07 18:08:23,988 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2019-12-07 18:08:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:23,988 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2019-12-07 18:08:23,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2019-12-07 18:08:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 18:08:23,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:23,989 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] [2019-12-07 18:08:23,989 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2019-12-07 18:08:23,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:23,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886304797] [2019-12-07 18:08:23,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 18:08:24,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886304797] [2019-12-07 18:08:24,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:24,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:08:24,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800504013] [2019-12-07 18:08:24,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:08:24,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:24,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:08:24,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:24,041 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2019-12-07 18:08:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:24,067 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2019-12-07 18:08:24,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:08:24,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 18:08:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:24,070 INFO L225 Difference]: With dead ends: 598 [2019-12-07 18:08:24,070 INFO L226 Difference]: Without dead ends: 596 [2019-12-07 18:08:24,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:08:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-12-07 18:08:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2019-12-07 18:08:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-12-07 18:08:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2019-12-07 18:08:24,093 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2019-12-07 18:08:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:24,094 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2019-12-07 18:08:24,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:08:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2019-12-07 18:08:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 18:08:24,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:24,095 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] [2019-12-07 18:08:24,095 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:24,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2019-12-07 18:08:24,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:24,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168186792] [2019-12-07 18:08:24,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:08:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 18:08:24,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168186792] [2019-12-07 18:08:24,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:08:24,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:08:24,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289871973] [2019-12-07 18:08:24,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:08:24,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:08:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:08:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:08:24,119 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2019-12-07 18:08:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:08:24,171 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2019-12-07 18:08:24,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:08:24,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 18:08:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:08:24,176 INFO L225 Difference]: With dead ends: 1230 [2019-12-07 18:08:24,176 INFO L226 Difference]: Without dead ends: 900 [2019-12-07 18:08:24,177 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-12-07 18:08:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-12-07 18:08:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2019-12-07 18:08:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-12-07 18:08:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2019-12-07 18:08:24,211 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2019-12-07 18:08:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:08:24,211 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2019-12-07 18:08:24,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:08:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2019-12-07 18:08:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 18:08:24,212 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:08:24,212 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] [2019-12-07 18:08:24,213 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:08:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:08:24,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2019-12-07 18:08:24,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:08:24,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451071146] [2019-12-07 18:08:24,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:08:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:08:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:08:24,260 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:08:24,260 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:08:24,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:08:24 BoogieIcfgContainer [2019-12-07 18:08:24,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:08:24,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:08:24,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:08:24,332 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:08:24,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:08:22" (3/4) ... [2019-12-07 18:08:24,334 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:08:24,419 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_573714cb-ab94-4500-a533-3345ba3472c4/bin/uautomizer/witness.graphml [2019-12-07 18:08:24,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:08:24,420 INFO L168 Benchmark]: Toolchain (without parser) took 2991.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.7 MB). Free memory was 946.2 MB in the beginning and 1.2 GB in the end (delta: -225.5 MB). Peak memory consumption was 124.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:24,420 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:08:24,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -202.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:24,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:24,421 INFO L168 Benchmark]: Boogie Preprocessor took 23.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:08:24,421 INFO L168 Benchmark]: RCFGBuilder took 351.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:24,422 INFO L168 Benchmark]: TraceAbstraction took 2268.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.6 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:24,422 INFO L168 Benchmark]: Witness Printer took 87.26 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:08:24,423 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 225.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -202.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 351.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2268.43 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.6 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. * Witness Printer took 87.26 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 [L208] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L45] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L59] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L64] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L65] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3381 SDtfs, 2968 SDslu, 2280 SDs, 0 SdLazy, 233 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=11, 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, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 125079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 191/191 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 incorrect! Received shutdown request...