./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/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.24-678e011 [2019-11-19 23:25:32,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:25:32,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:25:32,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:25:32,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:25:32,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:25:32,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:25:32,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:25:32,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:25:32,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:25:32,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:25:32,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:25:32,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:25:32,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:25:32,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:25:32,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:25:32,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:25:32,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:25:32,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:25:32,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:25:32,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:25:32,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:25:32,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:25:32,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:25:32,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:25:32,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:25:32,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:25:32,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:25:32,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:25:32,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:25:32,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:25:32,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:25:32,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:25:32,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:25:32,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:25:32,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:25:32,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:25:32,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:25:32,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:25:32,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:25:32,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:25:32,763 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:25:32,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:25:32,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:25:32,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:25:32,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:25:32,777 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:25:32,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:25:32,778 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:25:32,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:25:32,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:25:32,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:25:32,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:25:32,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:25:32,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:25:32,779 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:25:32,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:25:32,779 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:25:32,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:25:32,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:25:32,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:25:32,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:25:32,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:25:32,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:25:32,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:25:32,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:25:32,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:25:32,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:25:32,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:25:32,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:25:32,782 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_2e0066a8-b7b5-4976-a8c0-d22e320b3638/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-11-19 23:25:32,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:25:32,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:25:32,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:25:32,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:25:32,940 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:25:32,941 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-19 23:25:32,991 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/data/091a529b0/fbcf0d0b069f4ae488b32123e7a8ba0e/FLAG2fecea307 [2019-11-19 23:25:33,412 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:25:33,413 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-19 23:25:33,421 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/data/091a529b0/fbcf0d0b069f4ae488b32123e7a8ba0e/FLAG2fecea307 [2019-11-19 23:25:33,435 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/data/091a529b0/fbcf0d0b069f4ae488b32123e7a8ba0e [2019-11-19 23:25:33,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:25:33,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:25:33,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:25:33,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:25:33,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:25:33,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505c7fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33, skipping insertion in model container [2019-11-19 23:25:33,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,454 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:25:33,480 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:25:33,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:25:33,738 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:25:33,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:25:33,792 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:25:33,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33 WrapperNode [2019-11-19 23:25:33,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:25:33,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:25:33,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:25:33,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:25:33,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:25:33,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:25:33,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:25:33,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:25:33,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... [2019-11-19 23:25:33,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:25:33,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:25:33,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:25:33,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:25:33,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:25:33,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:25:33,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:25:34,489 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:25:34,489 INFO L285 CfgBuilder]: Removed 82 assume(true) statements. [2019-11-19 23:25:34,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:25:34 BoogieIcfgContainer [2019-11-19 23:25:34,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:25:34,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:25:34,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:25:34,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:25:34,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:25:33" (1/3) ... [2019-11-19 23:25:34,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43ec1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:25:34, skipping insertion in model container [2019-11-19 23:25:34,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:25:33" (2/3) ... [2019-11-19 23:25:34,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e43ec1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:25:34, skipping insertion in model container [2019-11-19 23:25:34,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:25:34" (3/3) ... [2019-11-19 23:25:34,497 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-11-19 23:25:34,506 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:25:34,512 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-19 23:25:34,522 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-19 23:25:34,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:25:34,564 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:25:34,564 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:25:34,564 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:25:34,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:25:34,565 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:25:34,565 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:25:34,565 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:25:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-19 23:25:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:25:34,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:34,598 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-11-19 23:25:34,599 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-11-19 23:25:34,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:34,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055996484] [2019-11-19 23:25:34,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:34,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055996484] [2019-11-19 23:25:34,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:34,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:25:34,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871273466] [2019-11-19 23:25:34,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:34,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:34,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:34,788 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-19 23:25:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:34,860 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2019-11-19 23:25:34,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:34,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:25:34,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:34,876 INFO L225 Difference]: With dead ends: 291 [2019-11-19 23:25:34,876 INFO L226 Difference]: Without dead ends: 144 [2019-11-19 23:25:34,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-19 23:25:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-19 23:25:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:25:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-11-19 23:25:34,927 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2019-11-19 23:25:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:34,927 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-11-19 23:25:34,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-11-19 23:25:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:25:34,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:34,929 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-11-19 23:25:34,930 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-11-19 23:25:34,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:34,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912120933] [2019-11-19 23:25:34,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:34,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912120933] [2019-11-19 23:25:34,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:34,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:25:34,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387671773] [2019-11-19 23:25:34,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:34,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:34,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:34,966 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2019-11-19 23:25:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:35,026 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2019-11-19 23:25:35,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:35,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:25:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:35,030 INFO L225 Difference]: With dead ends: 384 [2019-11-19 23:25:35,030 INFO L226 Difference]: Without dead ends: 246 [2019-11-19 23:25:35,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-19 23:25:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-11-19 23:25:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-19 23:25:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2019-11-19 23:25:35,075 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2019-11-19 23:25:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:35,075 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2019-11-19 23:25:35,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2019-11-19 23:25:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:25:35,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:35,079 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-11-19 23:25:35,079 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-11-19 23:25:35,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:35,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633962674] [2019-11-19 23:25:35,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:35,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633962674] [2019-11-19 23:25:35,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:35,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:25:35,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333091889] [2019-11-19 23:25:35,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:35,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:35,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:35,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,119 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 3 states. [2019-11-19 23:25:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:35,155 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2019-11-19 23:25:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:35,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:25:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:35,163 INFO L225 Difference]: With dead ends: 477 [2019-11-19 23:25:35,163 INFO L226 Difference]: Without dead ends: 242 [2019-11-19 23:25:35,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-19 23:25:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-19 23:25:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-19 23:25:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2019-11-19 23:25:35,206 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2019-11-19 23:25:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:35,206 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2019-11-19 23:25:35,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2019-11-19 23:25:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:25:35,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:35,208 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-11-19 23:25:35,208 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:35,209 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-11-19 23:25:35,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:35,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919133251] [2019-11-19 23:25:35,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:35,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919133251] [2019-11-19 23:25:35,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:35,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:25:35,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611041827] [2019-11-19 23:25:35,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:35,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:35,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,260 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand 3 states. [2019-11-19 23:25:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:35,309 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2019-11-19 23:25:35,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:35,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:25:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:35,312 INFO L225 Difference]: With dead ends: 476 [2019-11-19 23:25:35,312 INFO L226 Difference]: Without dead ends: 242 [2019-11-19 23:25:35,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-19 23:25:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-19 23:25:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-19 23:25:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2019-11-19 23:25:35,330 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2019-11-19 23:25:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:35,330 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2019-11-19 23:25:35,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2019-11-19 23:25:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:25:35,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:35,332 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-11-19 23:25:35,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-11-19 23:25:35,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:35,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837839660] [2019-11-19 23:25:35,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:35,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837839660] [2019-11-19 23:25:35,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:35,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:25:35,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410180677] [2019-11-19 23:25:35,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:35,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:35,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:35,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,377 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 3 states. [2019-11-19 23:25:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:35,417 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2019-11-19 23:25:35,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:35,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:25:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:35,418 INFO L225 Difference]: With dead ends: 475 [2019-11-19 23:25:35,419 INFO L226 Difference]: Without dead ends: 242 [2019-11-19 23:25:35,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-19 23:25:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-19 23:25:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-19 23:25:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2019-11-19 23:25:35,432 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 39 [2019-11-19 23:25:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:35,433 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2019-11-19 23:25:35,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2019-11-19 23:25:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 23:25:35,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:35,434 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-11-19 23:25:35,435 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-11-19 23:25:35,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:35,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044068425] [2019-11-19 23:25:35,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:35,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044068425] [2019-11-19 23:25:35,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:35,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:25:35,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044856122] [2019-11-19 23:25:35,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:35,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:35,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,491 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand 3 states. [2019-11-19 23:25:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:35,550 INFO L93 Difference]: Finished difference Result 662 states and 893 transitions. [2019-11-19 23:25:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:35,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 23:25:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:35,553 INFO L225 Difference]: With dead ends: 662 [2019-11-19 23:25:35,554 INFO L226 Difference]: Without dead ends: 431 [2019-11-19 23:25:35,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-19 23:25:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2019-11-19 23:25:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-19 23:25:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2019-11-19 23:25:35,575 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 39 [2019-11-19 23:25:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:35,576 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2019-11-19 23:25:35,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2019-11-19 23:25:35,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 23:25:35,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:35,578 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-11-19 23:25:35,578 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:35,578 INFO L82 PathProgramCache]: Analyzing trace with hash 407580417, now seen corresponding path program 1 times [2019-11-19 23:25:35,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:35,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348945457] [2019-11-19 23:25:35,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:35,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348945457] [2019-11-19 23:25:35,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:35,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:25:35,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274476191] [2019-11-19 23:25:35,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:25:35,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:35,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:25:35,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:25:35,671 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand 5 states. [2019-11-19 23:25:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:35,798 INFO L93 Difference]: Finished difference Result 985 states and 1321 transitions. [2019-11-19 23:25:35,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:25:35,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-19 23:25:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:35,803 INFO L225 Difference]: With dead ends: 985 [2019-11-19 23:25:35,803 INFO L226 Difference]: Without dead ends: 593 [2019-11-19 23:25:35,804 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-11-19 23:25:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-11-19 23:25:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 413. [2019-11-19 23:25:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-19 23:25:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 533 transitions. [2019-11-19 23:25:35,836 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 533 transitions. Word has length 63 [2019-11-19 23:25:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:35,836 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 533 transitions. [2019-11-19 23:25:35,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:25:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 533 transitions. [2019-11-19 23:25:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 23:25:35,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:35,838 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-11-19 23:25:35,838 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:35,839 INFO L82 PathProgramCache]: Analyzing trace with hash 830282243, now seen corresponding path program 1 times [2019-11-19 23:25:35,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:35,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024503120] [2019-11-19 23:25:35,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:35,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024503120] [2019-11-19 23:25:35,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:35,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:25:35,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062484114] [2019-11-19 23:25:35,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:35,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,887 INFO L87 Difference]: Start difference. First operand 413 states and 533 transitions. Second operand 3 states. [2019-11-19 23:25:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:35,966 INFO L93 Difference]: Finished difference Result 1143 states and 1486 transitions. [2019-11-19 23:25:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-19 23:25:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:35,971 INFO L225 Difference]: With dead ends: 1143 [2019-11-19 23:25:35,972 INFO L226 Difference]: Without dead ends: 747 [2019-11-19 23:25:35,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-19 23:25:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 715. [2019-11-19 23:25:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-19 23:25:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 925 transitions. [2019-11-19 23:25:36,021 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 925 transitions. Word has length 63 [2019-11-19 23:25:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:36,022 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 925 transitions. [2019-11-19 23:25:36,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 925 transitions. [2019-11-19 23:25:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 23:25:36,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:36,024 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-11-19 23:25:36,024 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1821446916, now seen corresponding path program 1 times [2019-11-19 23:25:36,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:36,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022966352] [2019-11-19 23:25:36,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:36,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022966352] [2019-11-19 23:25:36,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:36,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:25:36,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263841436] [2019-11-19 23:25:36,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:25:36,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:25:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:25:36,137 INFO L87 Difference]: Start difference. First operand 715 states and 925 transitions. Second operand 5 states. [2019-11-19 23:25:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:36,267 INFO L93 Difference]: Finished difference Result 1617 states and 2113 transitions. [2019-11-19 23:25:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:25:36,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-19 23:25:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:36,273 INFO L225 Difference]: With dead ends: 1617 [2019-11-19 23:25:36,273 INFO L226 Difference]: Without dead ends: 923 [2019-11-19 23:25:36,274 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-11-19 23:25:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-11-19 23:25:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 721. [2019-11-19 23:25:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-19 23:25:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2019-11-19 23:25:36,320 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2019-11-19 23:25:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:36,321 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2019-11-19 23:25:36,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:25:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2019-11-19 23:25:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 23:25:36,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:36,322 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-11-19 23:25:36,323 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2019-11-19 23:25:36,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:36,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492176637] [2019-11-19 23:25:36,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:36,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:36,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492176637] [2019-11-19 23:25:36,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:36,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:25:36,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512956184] [2019-11-19 23:25:36,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:36,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:36,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:36,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:36,382 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 3 states. [2019-11-19 23:25:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:36,477 INFO L93 Difference]: Finished difference Result 2017 states and 2558 transitions. [2019-11-19 23:25:36,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:36,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-19 23:25:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:36,485 INFO L225 Difference]: With dead ends: 2017 [2019-11-19 23:25:36,485 INFO L226 Difference]: Without dead ends: 1321 [2019-11-19 23:25:36,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-11-19 23:25:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1317. [2019-11-19 23:25:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-11-19 23:25:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1638 transitions. [2019-11-19 23:25:36,563 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1638 transitions. Word has length 63 [2019-11-19 23:25:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:36,564 INFO L462 AbstractCegarLoop]: Abstraction has 1317 states and 1638 transitions. [2019-11-19 23:25:36,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1638 transitions. [2019-11-19 23:25:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 23:25:36,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:36,566 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-11-19 23:25:36,566 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:36,566 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2019-11-19 23:25:36,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:36,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226474143] [2019-11-19 23:25:36,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:36,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226474143] [2019-11-19 23:25:36,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:36,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:25:36,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233850130] [2019-11-19 23:25:36,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:36,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:36,624 INFO L87 Difference]: Start difference. First operand 1317 states and 1638 transitions. Second operand 3 states. [2019-11-19 23:25:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:36,777 INFO L93 Difference]: Finished difference Result 3670 states and 4533 transitions. [2019-11-19 23:25:36,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:36,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-19 23:25:36,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:36,788 INFO L225 Difference]: With dead ends: 3670 [2019-11-19 23:25:36,788 INFO L226 Difference]: Without dead ends: 1847 [2019-11-19 23:25:36,791 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-11-19 23:25:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-11-19 23:25:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2019-11-19 23:25:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-11-19 23:25:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2255 transitions. [2019-11-19 23:25:36,897 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2255 transitions. Word has length 64 [2019-11-19 23:25:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:36,898 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 2255 transitions. [2019-11-19 23:25:36,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2255 transitions. [2019-11-19 23:25:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-19 23:25:36,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:36,901 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-11-19 23:25:36,902 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:36,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1159062640, now seen corresponding path program 1 times [2019-11-19 23:25:36,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:36,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130463457] [2019-11-19 23:25:36,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 23:25:36,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130463457] [2019-11-19 23:25:36,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:36,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:25:36,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530684764] [2019-11-19 23:25:36,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:36,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:36,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:36,950 INFO L87 Difference]: Start difference. First operand 1847 states and 2255 transitions. Second operand 3 states. [2019-11-19 23:25:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:37,095 INFO L93 Difference]: Finished difference Result 3621 states and 4413 transitions. [2019-11-19 23:25:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:37,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-19 23:25:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:37,105 INFO L225 Difference]: With dead ends: 3621 [2019-11-19 23:25:37,105 INFO L226 Difference]: Without dead ends: 1799 [2019-11-19 23:25:37,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-11-19 23:25:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2019-11-19 23:25:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2019-11-19 23:25:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2119 transitions. [2019-11-19 23:25:37,215 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2119 transitions. Word has length 93 [2019-11-19 23:25:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:37,215 INFO L462 AbstractCegarLoop]: Abstraction has 1799 states and 2119 transitions. [2019-11-19 23:25:37,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2119 transitions. [2019-11-19 23:25:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-19 23:25:37,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:37,218 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-11-19 23:25:37,218 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:37,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:37,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380816, now seen corresponding path program 1 times [2019-11-19 23:25:37,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:37,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431386128] [2019-11-19 23:25:37,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 23:25:37,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431386128] [2019-11-19 23:25:37,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:37,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:25:37,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886428035] [2019-11-19 23:25:37,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:37,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:37,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:37,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:37,257 INFO L87 Difference]: Start difference. First operand 1799 states and 2119 transitions. Second operand 3 states. [2019-11-19 23:25:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:37,368 INFO L93 Difference]: Finished difference Result 3078 states and 3607 transitions. [2019-11-19 23:25:37,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:37,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-19 23:25:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:37,373 INFO L225 Difference]: With dead ends: 3078 [2019-11-19 23:25:37,373 INFO L226 Difference]: Without dead ends: 724 [2019-11-19 23:25:37,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-19 23:25:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-11-19 23:25:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-19 23:25:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2019-11-19 23:25:37,420 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2019-11-19 23:25:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:37,421 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2019-11-19 23:25:37,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2019-11-19 23:25:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-19 23:25:37,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:37,422 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-11-19 23:25:37,423 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2019-11-19 23:25:37,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:37,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292056016] [2019-11-19 23:25:37,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:25:37,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292056016] [2019-11-19 23:25:37,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:37,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:25:37,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981550548] [2019-11-19 23:25:37,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:37,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:37,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:37,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:37,485 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2019-11-19 23:25:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:37,540 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2019-11-19 23:25:37,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:37,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-19 23:25:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:37,544 INFO L225 Difference]: With dead ends: 1048 [2019-11-19 23:25:37,544 INFO L226 Difference]: Without dead ends: 594 [2019-11-19 23:25:37,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-11-19 23:25:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-11-19 23:25:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-19 23:25:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2019-11-19 23:25:37,580 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2019-11-19 23:25:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:37,580 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2019-11-19 23:25:37,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2019-11-19 23:25:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:25:37,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:37,582 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-11-19 23:25:37,582 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2019-11-19 23:25:37,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:37,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625693812] [2019-11-19 23:25:37,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 23:25:37,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625693812] [2019-11-19 23:25:37,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:37,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:25:37,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938409656] [2019-11-19 23:25:37,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:25:37,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:25:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:25:37,676 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2019-11-19 23:25:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:37,719 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2019-11-19 23:25:37,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:25:37,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-19 23:25:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:37,723 INFO L225 Difference]: With dead ends: 598 [2019-11-19 23:25:37,723 INFO L226 Difference]: Without dead ends: 596 [2019-11-19 23:25:37,724 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-11-19 23:25:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-11-19 23:25:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2019-11-19 23:25:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-19 23:25:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2019-11-19 23:25:37,758 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2019-11-19 23:25:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:37,758 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2019-11-19 23:25:37,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:25:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2019-11-19 23:25:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 23:25:37,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:37,760 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-11-19 23:25:37,760 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2019-11-19 23:25:37,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:37,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948691400] [2019-11-19 23:25:37,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:25:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-19 23:25:37,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948691400] [2019-11-19 23:25:37,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:25:37,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:25:37,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083207130] [2019-11-19 23:25:37,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:25:37,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:25:37,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:25:37,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:37,796 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2019-11-19 23:25:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:25:37,874 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2019-11-19 23:25:37,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:25:37,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-19 23:25:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:25:37,879 INFO L225 Difference]: With dead ends: 1230 [2019-11-19 23:25:37,879 INFO L226 Difference]: Without dead ends: 900 [2019-11-19 23:25:37,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:25:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-11-19 23:25:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2019-11-19 23:25:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-19 23:25:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2019-11-19 23:25:37,918 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2019-11-19 23:25:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:25:37,918 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2019-11-19 23:25:37,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:25:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2019-11-19 23:25:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-19 23:25:37,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:25:37,920 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-11-19 23:25:37,920 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:25:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:25:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2019-11-19 23:25:37,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:25:37,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009397584] [2019-11-19 23:25:37,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:25:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:25:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:25:37,997 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:25:37,998 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 23:25:38,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:25:38 BoogieIcfgContainer [2019-11-19 23:25:38,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:25:38,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:25:38,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:25:38,112 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:25:38,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:25:34" (3/4) ... [2019-11-19 23:25:38,114 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 23:25:38,223 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2e0066a8-b7b5-4976-a8c0-d22e320b3638/bin/uautomizer/witness.graphml [2019-11-19 23:25:38,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:25:38,225 INFO L168 Benchmark]: Toolchain (without parser) took 4785.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 950.5 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:25:38,225 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:25:38,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 950.5 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:25:38,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.76 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:25:38,226 INFO L168 Benchmark]: Boogie Preprocessor took 36.24 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-11-19 23:25:38,227 INFO L168 Benchmark]: RCFGBuilder took 612.79 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2019-11-19 23:25:38,227 INFO L168 Benchmark]: TraceAbstraction took 3619.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:25:38,228 INFO L168 Benchmark]: Witness Printer took 111.88 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: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:25:38,229 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 950.5 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.76 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.24 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 612.79 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: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3619.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 111.88 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: 14.9 MB). Peak memory consumption was 14.9 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: 3.5s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3381 SDtfs, 2968 SDslu, 2280 SDs, 0 SdLazy, 233 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s 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...