./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6325feb12f40756470caf3b12878fd0ec9ad6f61 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:26:37,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:26:37,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:26:37,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:26:37,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:26:37,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:26:37,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:26:37,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:26:37,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:26:37,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:26:37,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:26:37,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:26:37,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:26:37,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:26:37,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:26:37,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:26:37,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:26:37,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:26:37,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:26:37,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:26:37,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:26:37,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:26:37,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:26:37,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:26:37,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:26:37,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:26:37,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:26:37,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:26:37,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:26:37,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:26:37,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:26:37,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:26:37,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:26:37,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:26:37,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:26:37,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:26:37,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:26:37,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:26:37,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:26:37,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:26:37,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:26:37,829 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:26:37,885 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:26:37,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:26:37,887 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:26:37,887 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:26:37,888 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:26:37,888 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:26:37,888 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:26:37,888 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:26:37,889 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:26:37,889 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:26:37,898 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:26:37,898 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:26:37,898 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:26:37,899 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:26:37,899 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:26:37,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:26:37,900 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:26:37,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:26:37,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:26:37,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:26:37,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:26:37,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:26:37,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:26:37,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:26:37,902 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:26:37,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:26:37,903 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:26:37,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:26:37,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:26:37,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:26:37,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:26:37,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:26:37,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:26:37,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:26:37,907 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:26:37,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:26:37,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:26:37,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:26:37,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:26:37,909 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 6325feb12f40756470caf3b12878fd0ec9ad6f61 [2021-10-11 02:26:38,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:26:38,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:26:38,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:26:38,350 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:26:38,351 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:26:38,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-11 02:26:38,464 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/data/600f99372/aff207c0a042404ba63d1eb8bf8eaa26/FLAG57ecde8bd [2021-10-11 02:26:39,108 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:26:39,109 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-11 02:26:39,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/data/600f99372/aff207c0a042404ba63d1eb8bf8eaa26/FLAG57ecde8bd [2021-10-11 02:26:39,440 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/data/600f99372/aff207c0a042404ba63d1eb8bf8eaa26 [2021-10-11 02:26:39,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:26:39,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:26:39,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:26:39,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:26:39,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:26:39,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a339e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39, skipping insertion in model container [2021-10-11 02:26:39,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:26:39,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:26:39,680 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-11 02:26:39,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:26:39,757 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:26:39,770 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-11 02:26:39,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:26:39,817 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:26:39,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39 WrapperNode [2021-10-11 02:26:39,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:26:39,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:26:39,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:26:39,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:26:39,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:26:39,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:26:39,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:26:39,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:26:39,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... [2021-10-11 02:26:39,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:26:39,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:26:39,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:26:39,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:26:39,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/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 [2021-10-11 02:26:40,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:26:40,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:26:40,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:26:40,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:26:41,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:26:41,387 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-10-11 02:26:41,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:41 BoogieIcfgContainer [2021-10-11 02:26:41,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:26:41,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:26:41,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:26:41,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:26:41,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:26:39" (1/3) ... [2021-10-11 02:26:41,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c878aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:26:41, skipping insertion in model container [2021-10-11 02:26:41,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:26:39" (2/3) ... [2021-10-11 02:26:41,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c878aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:26:41, skipping insertion in model container [2021-10-11 02:26:41,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:41" (3/3) ... [2021-10-11 02:26:41,400 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-10-11 02:26:41,415 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:26:41,419 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:26:41,431 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:26:41,471 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:26:41,471 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:26:41,471 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:26:41,472 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:26:41,472 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:26:41,472 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:26:41,472 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:26:41,472 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:26:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2021-10-11 02:26:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:26:41,499 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:41,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:41,500 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:41,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash 737731866, now seen corresponding path program 1 times [2021-10-11 02:26:41,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:41,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625690686] [2021-10-11 02:26:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:41,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625690686] [2021-10-11 02:26:41,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:41,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:26:41,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385535305] [2021-10-11 02:26:41,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:26:41,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:26:41,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:26:41,801 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 4 states. [2021-10-11 02:26:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:42,045 INFO L93 Difference]: Finished difference Result 204 states and 311 transitions. [2021-10-11 02:26:42,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:26:42,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 02:26:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:42,071 INFO L225 Difference]: With dead ends: 204 [2021-10-11 02:26:42,072 INFO L226 Difference]: Without dead ends: 137 [2021-10-11 02:26:42,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:26:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-11 02:26:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2021-10-11 02:26:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-10-11 02:26:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2021-10-11 02:26:42,167 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 16 [2021-10-11 02:26:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:42,168 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2021-10-11 02:26:42,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:26:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2021-10-11 02:26:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:26:42,171 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:42,171 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:42,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:26:42,172 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:42,176 INFO L82 PathProgramCache]: Analyzing trace with hash 233244576, now seen corresponding path program 1 times [2021-10-11 02:26:42,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:42,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724149063] [2021-10-11 02:26:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:42,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724149063] [2021-10-11 02:26:42,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:42,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:26:42,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658064718] [2021-10-11 02:26:42,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:26:42,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:26:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:26:42,268 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand 3 states. [2021-10-11 02:26:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:42,339 INFO L93 Difference]: Finished difference Result 279 states and 398 transitions. [2021-10-11 02:26:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:26:42,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-10-11 02:26:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:42,347 INFO L225 Difference]: With dead ends: 279 [2021-10-11 02:26:42,348 INFO L226 Difference]: Without dead ends: 162 [2021-10-11 02:26:42,351 INFO L677 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 [2021-10-11 02:26:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-10-11 02:26:42,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 144. [2021-10-11 02:26:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2021-10-11 02:26:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 205 transitions. [2021-10-11 02:26:42,377 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 205 transitions. Word has length 23 [2021-10-11 02:26:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:42,377 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 205 transitions. [2021-10-11 02:26:42,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:26:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 205 transitions. [2021-10-11 02:26:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:26:42,384 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:42,384 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:42,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:26:42,385 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash -178520705, now seen corresponding path program 1 times [2021-10-11 02:26:42,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:42,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344397277] [2021-10-11 02:26:42,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:26:42,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344397277] [2021-10-11 02:26:42,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:42,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:26:42,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828614844] [2021-10-11 02:26:42,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:26:42,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:42,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:26:42,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:26:42,536 INFO L87 Difference]: Start difference. First operand 144 states and 205 transitions. Second operand 3 states. [2021-10-11 02:26:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:42,601 INFO L93 Difference]: Finished difference Result 343 states and 496 transitions. [2021-10-11 02:26:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:26:42,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-10-11 02:26:42,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:42,605 INFO L225 Difference]: With dead ends: 343 [2021-10-11 02:26:42,605 INFO L226 Difference]: Without dead ends: 235 [2021-10-11 02:26:42,610 INFO L677 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 [2021-10-11 02:26:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-10-11 02:26:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 193. [2021-10-11 02:26:42,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2021-10-11 02:26:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2021-10-11 02:26:42,643 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 24 [2021-10-11 02:26:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:42,644 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2021-10-11 02:26:42,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:26:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2021-10-11 02:26:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-11 02:26:42,655 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:42,655 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:26:42,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:26:42,656 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:42,657 INFO L82 PathProgramCache]: Analyzing trace with hash -492670809, now seen corresponding path program 1 times [2021-10-11 02:26:42,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:42,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995219716] [2021-10-11 02:26:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:26:42,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995219716] [2021-10-11 02:26:42,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:42,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:26:42,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48524503] [2021-10-11 02:26:42,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:26:42,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:42,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:26:42,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:26:42,829 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 4 states. [2021-10-11 02:26:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:42,932 INFO L93 Difference]: Finished difference Result 628 states and 894 transitions. [2021-10-11 02:26:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:26:42,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2021-10-11 02:26:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:42,936 INFO L225 Difference]: With dead ends: 628 [2021-10-11 02:26:42,936 INFO L226 Difference]: Without dead ends: 442 [2021-10-11 02:26:42,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:26:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-10-11 02:26:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 334. [2021-10-11 02:26:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2021-10-11 02:26:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 463 transitions. [2021-10-11 02:26:42,961 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 463 transitions. Word has length 42 [2021-10-11 02:26:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:42,962 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 463 transitions. [2021-10-11 02:26:42,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:26:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 463 transitions. [2021-10-11 02:26:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-11 02:26:42,964 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:42,964 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:26:42,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:26:42,965 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:42,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1916836504, now seen corresponding path program 1 times [2021-10-11 02:26:42,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:42,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293379186] [2021-10-11 02:26:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:43,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293379186] [2021-10-11 02:26:43,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:43,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:26:43,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665417331] [2021-10-11 02:26:43,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:26:43,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:43,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:26:43,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:26:43,029 INFO L87 Difference]: Start difference. First operand 334 states and 463 transitions. Second operand 5 states. [2021-10-11 02:26:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:43,169 INFO L93 Difference]: Finished difference Result 615 states and 856 transitions. [2021-10-11 02:26:43,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:26:43,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2021-10-11 02:26:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:43,173 INFO L225 Difference]: With dead ends: 615 [2021-10-11 02:26:43,173 INFO L226 Difference]: Without dead ends: 288 [2021-10-11 02:26:43,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:26:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-11 02:26:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 259. [2021-10-11 02:26:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2021-10-11 02:26:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 360 transitions. [2021-10-11 02:26:43,191 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 360 transitions. Word has length 43 [2021-10-11 02:26:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:43,192 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 360 transitions. [2021-10-11 02:26:43,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:26:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 360 transitions. [2021-10-11 02:26:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-11 02:26:43,194 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:43,194 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:26:43,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:26:43,195 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:43,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:43,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1646902370, now seen corresponding path program 1 times [2021-10-11 02:26:43,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:43,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481276992] [2021-10-11 02:26:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:43,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481276992] [2021-10-11 02:26:43,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:43,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:26:43,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535220379] [2021-10-11 02:26:43,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:26:43,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:43,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:26:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:26:43,280 INFO L87 Difference]: Start difference. First operand 259 states and 360 transitions. Second operand 3 states. [2021-10-11 02:26:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:43,322 INFO L93 Difference]: Finished difference Result 429 states and 599 transitions. [2021-10-11 02:26:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:26:43,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-10-11 02:26:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:43,326 INFO L225 Difference]: With dead ends: 429 [2021-10-11 02:26:43,326 INFO L226 Difference]: Without dead ends: 178 [2021-10-11 02:26:43,327 INFO L677 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 [2021-10-11 02:26:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-10-11 02:26:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 173. [2021-10-11 02:26:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-10-11 02:26:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 226 transitions. [2021-10-11 02:26:43,338 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 226 transitions. Word has length 45 [2021-10-11 02:26:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:43,339 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 226 transitions. [2021-10-11 02:26:43,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:26:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2021-10-11 02:26:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-11 02:26:43,340 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:43,340 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:26:43,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:26:43,341 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1577641247, now seen corresponding path program 1 times [2021-10-11 02:26:43,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:43,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958330997] [2021-10-11 02:26:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:43,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958330997] [2021-10-11 02:26:43,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:43,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:26:43,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154691898] [2021-10-11 02:26:43,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:26:43,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:43,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:26:43,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:26:43,439 INFO L87 Difference]: Start difference. First operand 173 states and 226 transitions. Second operand 5 states. [2021-10-11 02:26:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:43,580 INFO L93 Difference]: Finished difference Result 338 states and 445 transitions. [2021-10-11 02:26:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:26:43,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2021-10-11 02:26:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:43,583 INFO L225 Difference]: With dead ends: 338 [2021-10-11 02:26:43,584 INFO L226 Difference]: Without dead ends: 205 [2021-10-11 02:26:43,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:26:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-10-11 02:26:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 173. [2021-10-11 02:26:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-10-11 02:26:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 220 transitions. [2021-10-11 02:26:43,597 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 220 transitions. Word has length 45 [2021-10-11 02:26:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:43,599 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 220 transitions. [2021-10-11 02:26:43,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:26:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 220 transitions. [2021-10-11 02:26:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-11 02:26:43,601 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:43,601 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:26:43,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:26:43,602 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1171353703, now seen corresponding path program 1 times [2021-10-11 02:26:43,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:43,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464964830] [2021-10-11 02:26:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:26:43,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464964830] [2021-10-11 02:26:43,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:43,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:26:43,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890123620] [2021-10-11 02:26:43,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:26:43,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:43,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:26:43,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:26:43,729 INFO L87 Difference]: Start difference. First operand 173 states and 220 transitions. Second operand 3 states. [2021-10-11 02:26:43,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:43,764 INFO L93 Difference]: Finished difference Result 255 states and 330 transitions. [2021-10-11 02:26:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:26:43,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2021-10-11 02:26:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:43,769 INFO L225 Difference]: With dead ends: 255 [2021-10-11 02:26:43,769 INFO L226 Difference]: Without dead ends: 173 [2021-10-11 02:26:43,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:26:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-11 02:26:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-10-11 02:26:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-10-11 02:26:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 216 transitions. [2021-10-11 02:26:43,784 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 216 transitions. Word has length 46 [2021-10-11 02:26:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:43,785 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 216 transitions. [2021-10-11 02:26:43,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:26:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 216 transitions. [2021-10-11 02:26:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-11 02:26:43,786 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:43,787 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:26:43,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:26:43,788 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:43,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:43,788 INFO L82 PathProgramCache]: Analyzing trace with hash -180189030, now seen corresponding path program 1 times [2021-10-11 02:26:43,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:43,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617578254] [2021-10-11 02:26:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:43,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617578254] [2021-10-11 02:26:43,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:43,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:26:43,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493736589] [2021-10-11 02:26:43,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:26:43,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:43,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:26:43,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:26:43,855 INFO L87 Difference]: Start difference. First operand 173 states and 216 transitions. Second operand 3 states. [2021-10-11 02:26:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:43,893 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2021-10-11 02:26:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:26:43,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2021-10-11 02:26:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:43,895 INFO L225 Difference]: With dead ends: 267 [2021-10-11 02:26:43,896 INFO L226 Difference]: Without dead ends: 185 [2021-10-11 02:26:43,897 INFO L677 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 [2021-10-11 02:26:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-11 02:26:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2021-10-11 02:26:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2021-10-11 02:26:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 207 transitions. [2021-10-11 02:26:43,920 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 207 transitions. Word has length 46 [2021-10-11 02:26:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:43,920 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 207 transitions. [2021-10-11 02:26:43,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:26:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 207 transitions. [2021-10-11 02:26:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-11 02:26:43,921 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:43,921 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-10-11 02:26:43,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:26:43,922 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash -121142408, now seen corresponding path program 1 times [2021-10-11 02:26:43,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:43,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903072345] [2021-10-11 02:26:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:43,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903072345] [2021-10-11 02:26:43,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168341155] [2021-10-11 02:26:43,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:26:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:44,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 02:26:44,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:26:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:44,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:26:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:26:44,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:26:44,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-11 02:26:44,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441529255] [2021-10-11 02:26:44,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:26:44,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:44,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:26:44,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:26:44,267 INFO L87 Difference]: Start difference. First operand 173 states and 207 transitions. Second operand 4 states. [2021-10-11 02:26:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:44,342 INFO L93 Difference]: Finished difference Result 359 states and 432 transitions. [2021-10-11 02:26:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:26:44,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2021-10-11 02:26:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:44,345 INFO L225 Difference]: With dead ends: 359 [2021-10-11 02:26:44,345 INFO L226 Difference]: Without dead ends: 226 [2021-10-11 02:26:44,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:26:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-11 02:26:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 191. [2021-10-11 02:26:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2021-10-11 02:26:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 233 transitions. [2021-10-11 02:26:44,364 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 233 transitions. Word has length 47 [2021-10-11 02:26:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:44,365 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 233 transitions. [2021-10-11 02:26:44,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:26:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 233 transitions. [2021-10-11 02:26:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-11 02:26:44,366 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:44,366 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2021-10-11 02:26:44,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 02:26:44,582 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:44,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:44,583 INFO L82 PathProgramCache]: Analyzing trace with hash 813103306, now seen corresponding path program 1 times [2021-10-11 02:26:44,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:44,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298551605] [2021-10-11 02:26:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:26:44,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298551605] [2021-10-11 02:26:44,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:44,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:26:44,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760433672] [2021-10-11 02:26:44,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:26:44,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:44,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:26:44,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:26:44,700 INFO L87 Difference]: Start difference. First operand 191 states and 233 transitions. Second operand 6 states. [2021-10-11 02:26:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:44,932 INFO L93 Difference]: Finished difference Result 342 states and 413 transitions. [2021-10-11 02:26:44,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:26:44,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2021-10-11 02:26:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:44,934 INFO L225 Difference]: With dead ends: 342 [2021-10-11 02:26:44,934 INFO L226 Difference]: Without dead ends: 130 [2021-10-11 02:26:44,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:26:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-10-11 02:26:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2021-10-11 02:26:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2021-10-11 02:26:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2021-10-11 02:26:44,946 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 47 [2021-10-11 02:26:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:44,946 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2021-10-11 02:26:44,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:26:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2021-10-11 02:26:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-11 02:26:44,947 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:44,947 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-10-11 02:26:44,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:26:44,947 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:44,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1205662608, now seen corresponding path program 1 times [2021-10-11 02:26:44,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:44,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746962312] [2021-10-11 02:26:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 02:26:45,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746962312] [2021-10-11 02:26:45,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:45,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:26:45,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982801162] [2021-10-11 02:26:45,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:26:45,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:45,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:26:45,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:26:45,035 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2021-10-11 02:26:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:45,074 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2021-10-11 02:26:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:26:45,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2021-10-11 02:26:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:45,076 INFO L225 Difference]: With dead ends: 208 [2021-10-11 02:26:45,076 INFO L226 Difference]: Without dead ends: 206 [2021-10-11 02:26:45,077 INFO L677 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 [2021-10-11 02:26:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-10-11 02:26:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 163. [2021-10-11 02:26:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-10-11 02:26:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2021-10-11 02:26:45,093 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 48 [2021-10-11 02:26:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:45,093 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2021-10-11 02:26:45,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:26:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2021-10-11 02:26:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-11 02:26:45,094 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:45,094 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:45,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:26:45,095 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:45,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash -906446050, now seen corresponding path program 1 times [2021-10-11 02:26:45,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:45,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700088215] [2021-10-11 02:26:45,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-11 02:26:45,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700088215] [2021-10-11 02:26:45,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:45,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:26:45,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782151001] [2021-10-11 02:26:45,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:26:45,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:45,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:26:45,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:26:45,176 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 6 states. [2021-10-11 02:26:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:45,382 INFO L93 Difference]: Finished difference Result 290 states and 334 transitions. [2021-10-11 02:26:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:26:45,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2021-10-11 02:26:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:45,384 INFO L225 Difference]: With dead ends: 290 [2021-10-11 02:26:45,385 INFO L226 Difference]: Without dead ends: 172 [2021-10-11 02:26:45,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:26:45,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-10-11 02:26:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2021-10-11 02:26:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-10-11 02:26:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2021-10-11 02:26:45,402 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 78 [2021-10-11 02:26:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:45,402 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2021-10-11 02:26:45,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:26:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2021-10-11 02:26:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-11 02:26:45,404 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:26:45,404 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:26:45,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 02:26:45,404 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:26:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:26:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1171754606, now seen corresponding path program 1 times [2021-10-11 02:26:45,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:26:45,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466972335] [2021-10-11 02:26:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:26:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:26:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-11 02:26:45,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466972335] [2021-10-11 02:26:45,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:26:45,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:26:45,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155391129] [2021-10-11 02:26:45,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:26:45,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:26:45,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:26:45,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:26:45,448 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 3 states. [2021-10-11 02:26:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:26:45,479 INFO L93 Difference]: Finished difference Result 220 states and 248 transitions. [2021-10-11 02:26:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:26:45,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-10-11 02:26:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:26:45,480 INFO L225 Difference]: With dead ends: 220 [2021-10-11 02:26:45,481 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:26:45,481 INFO L677 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 [2021-10-11 02:26:45,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:26:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:26:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:26:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:26:45,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2021-10-11 02:26:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:26:45,482 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:26:45,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:26:45,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:26:45,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:26:45,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 02:26:45,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:26:45,942 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2021-10-11 02:26:46,848 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-10-11 02:26:47,254 WARN L197 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-10-11 02:26:47,627 WARN L197 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-10-11 02:26:47,668 INFO L262 CegarLoopResult]: For program point L135(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,669 INFO L262 CegarLoopResult]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,669 INFO L262 CegarLoopResult]: For program point L36(lines 36 44) no Hoare annotation was computed. [2021-10-11 02:26:47,669 INFO L262 CegarLoopResult]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,669 INFO L262 CegarLoopResult]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,669 INFO L262 CegarLoopResult]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,669 INFO L262 CegarLoopResult]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,669 INFO L262 CegarLoopResult]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,670 INFO L262 CegarLoopResult]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,670 INFO L262 CegarLoopResult]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,670 INFO L262 CegarLoopResult]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2021-10-11 02:26:47,670 INFO L262 CegarLoopResult]: For program point L136(lines 136 141) no Hoare annotation was computed. [2021-10-11 02:26:47,670 INFO L262 CegarLoopResult]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2021-10-11 02:26:47,670 INFO L262 CegarLoopResult]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2021-10-11 02:26:47,670 INFO L262 CegarLoopResult]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2021-10-11 02:26:47,671 INFO L262 CegarLoopResult]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2021-10-11 02:26:47,671 INFO L262 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-10-11 02:26:47,671 INFO L258 CegarLoopResult]: At program point L40(lines 35 74) the Hoare annotation is: (and (<= ~token~0 (+ ~local~0 1)) (= ~t1_pc~0 1) (= ~m_pc~0 1) (= ~E_1~0 2) (<= 2 ~E_M~0) (not (= ULTIMATE.start_eval_~tmp~0 0)) (not (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (not (= ~m_st~0 0)) (< ~local~0 ~token~0)) [2021-10-11 02:26:47,671 INFO L262 CegarLoopResult]: For program point L207(lines 207 211) no Hoare annotation was computed. [2021-10-11 02:26:47,672 INFO L262 CegarLoopResult]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2021-10-11 02:26:47,673 INFO L258 CegarLoopResult]: At program point L439(lines 439 448) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,674 INFO L258 CegarLoopResult]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,674 INFO L258 CegarLoopResult]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~E_1~0 2)) (.cse3 (<= 2 ~E_M~0)) (.cse1 (not (= ~m_st~0 0)))) (or (and .cse0 (= ~m_pc~0 1) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse1 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,674 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-11 02:26:47,675 INFO L258 CegarLoopResult]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 0)) (.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse10)) (.cse6 (= ~m_pc~0 0)) (.cse1 (= ~t1_st~0 0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse3 (not .cse13)) (.cse9 (<= 2 ~t1_st~0)) (.cse12 (= ~m_pc~0 1)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse10 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse10 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse10 .cse12 .cse7 .cse8 .cse4 .cse3 .cse5 .cse2) (and .cse11 .cse1 (= ~m_st~0 ~E_1~0) .cse7 .cse12 .cse8 .cse2 .cse4 .cse5) (and .cse10 .cse11 .cse7 .cse12 .cse8 .cse4 .cse2 .cse3 .cse5) (and .cse9 (<= ~token~0 (+ ~local~0 1)) .cse10 .cse12 .cse13 .cse2 (not .cse11) .cse4 (< ~local~0 ~token~0) .cse5)))) [2021-10-11 02:26:47,683 INFO L258 CegarLoopResult]: At program point L146(lines 134 148) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~t1_st~0 0) (= ~m_pc~0 ~t1_pc~0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= 2 ~E_M~0) (= ~m_pc~0 0)) [2021-10-11 02:26:47,684 INFO L258 CegarLoopResult]: At program point L146-1(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= ~token~0 ~local~0)) (.cse2 (<= ~local~0 ~token~0)) (.cse5 (<= 2 ~E_M~0)) (.cse4 (not (= ~m_st~0 0))) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse0 (= ~t1_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0)) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse5 .cse4 .cse3))) [2021-10-11 02:26:47,684 INFO L262 CegarLoopResult]: For program point L80(lines 80 88) no Hoare annotation was computed. [2021-10-11 02:26:47,684 INFO L258 CegarLoopResult]: At program point L146-2(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (< 0 ~t1_st~0)) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~m_st~0 0)) (.cse5 (= ~E_1~0 2))) (or (and (<= ~token~0 (+ ~local~0 1)) .cse0 (= ~E_M~0 1) .cse1 (= ~m_pc~0 1) .cse2 .cse3 (not .cse4) .cse5 (< ~local~0 ~token~0)) (and .cse0 .cse4 .cse1 .cse3 (not .cse2) .cse5 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,684 INFO L258 CegarLoopResult]: At program point L146-3(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (= ~E_1~0 2)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)) (and .cse0 .cse1 (= ~m_pc~0 1) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4))) [2021-10-11 02:26:47,685 INFO L258 CegarLoopResult]: At program point L146-4(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,685 INFO L262 CegarLoopResult]: For program point L215(lines 215 222) no Hoare annotation was computed. [2021-10-11 02:26:47,685 INFO L262 CegarLoopResult]: For program point L116(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,685 INFO L258 CegarLoopResult]: At program point L83(lines 83 87) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse4 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse10 (not .cse0)) (.cse2 (< 0 ~t1_st~0)) (.cse3 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse9 (<= 2 ~E_M~0)) (.cse11 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse7 .cse8 .cse6 .cse9 .cse11) (and .cse1 (= ~m_st~0 ~E_1~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse8 .cse6 .cse9 .cse11) (and .cse10 .cse2 .cse3 .cse5 .cse7 .cse6 .cse9 .cse11)))) [2021-10-11 02:26:47,685 INFO L262 CegarLoopResult]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,685 INFO L262 CegarLoopResult]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,686 INFO L262 CegarLoopResult]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,686 INFO L262 CegarLoopResult]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,686 INFO L262 CegarLoopResult]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,686 INFO L262 CegarLoopResult]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,686 INFO L262 CegarLoopResult]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,687 INFO L262 CegarLoopResult]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,687 INFO L262 CegarLoopResult]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2021-10-11 02:26:47,687 INFO L262 CegarLoopResult]: For program point L117(lines 117 122) no Hoare annotation was computed. [2021-10-11 02:26:47,687 INFO L262 CegarLoopResult]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2021-10-11 02:26:47,687 INFO L262 CegarLoopResult]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2021-10-11 02:26:47,687 INFO L262 CegarLoopResult]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2021-10-11 02:26:47,688 INFO L262 CegarLoopResult]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2021-10-11 02:26:47,688 INFO L265 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-11 02:26:47,688 INFO L262 CegarLoopResult]: For program point L452(lines 452 456) no Hoare annotation was computed. [2021-10-11 02:26:47,688 INFO L258 CegarLoopResult]: At program point L420-1(lines 275 457) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 0))) (let ((.cse2 (<= ~token~0 ~local~0)) (.cse3 (<= ~local~0 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not .cse7)) (.cse5 (= ~E_1~0 2)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 1) .cse3 .cse4 .cse5 .cse6) (and (not .cse0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~t1_st~0 0) .cse2 .cse7 .cse3 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse8)))) [2021-10-11 02:26:47,688 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:26:47,689 INFO L258 CegarLoopResult]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse5 (= ~t1_pc~0 1)) (.cse2 (= ~m_pc~0 1)) (.cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (< 0 ~t1_st~0)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (not .cse10)) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0)) (.cse11 (= ~m_pc~0 0))) (or (and (or (and .cse0 (= ~m_st~0 ~E_1~0) .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse6 .cse3 .cse4)) .cse7 .cse8 .cse9) (and .cse7 .cse10 .cse8 .cse9 .cse3 .cse4 .cse11) (and .cse0 .cse9 .cse3 .cse4 .cse6 .cse11) (and (<= ~token~0 (+ ~local~0 1)) .cse5 .cse2 .cse10 .cse9 (not .cse0) .cse3 (< ~local~0 ~token~0) .cse4) (and .cse1 .cse9 .cse6 .cse3 .cse4 .cse11)))) [2021-10-11 02:26:47,689 INFO L258 CegarLoopResult]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse1 (= ~t1_pc~0 1))) (let ((.cse8 (not .cse1)) (.cse0 (<= 2 ~t1_st~0)) (.cse13 (not .cse3)) (.cse12 (= ~m_pc~0 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (<= ~token~0 ~local~0)) (.cse2 (= ~m_pc~0 1)) (.cse11 (<= ~local~0 ~token~0)) (.cse6 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_M~0))) (or (and .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) (< ~local~0 ~token~0)) (and .cse8 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12) (and .cse8 .cse9 .cse6 .cse13 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse6 .cse4 .cse13 .cse5) (and .cse0 .cse1 .cse10 .cse11 .cse6 .cse4 .cse5 .cse12) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse13 .cse4 .cse5 .cse12) (and .cse1 .cse7 .cse13 .cse4 .cse5 .cse12) (and .cse7 .cse9 (= ~m_st~0 ~E_1~0) .cse10 .cse2 .cse11 .cse6 .cse4 .cse5)))) [2021-10-11 02:26:47,689 INFO L258 CegarLoopResult]: At program point L127(lines 115 129) the Hoare annotation is: (and (= ~t1_st~0 0) (= ~m_pc~0 ~t1_pc~0) (<= ~token~0 ~local~0) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= 2 ~E_M~0) (= ~m_pc~0 0)) [2021-10-11 02:26:47,690 INFO L258 CegarLoopResult]: At program point L127-1(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (<= ~token~0 ~local~0)) (.cse2 (<= ~local~0 ~token~0)) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse4 (not (= ~m_st~0 0))) (.cse3 (<= 2 ~E_M~0))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ~t1_st~0 0) .cse1 .cse2 .cse5 .cse4 .cse3 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,690 INFO L258 CegarLoopResult]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse7 (= ~t1_pc~0 1)) (.cse0 (<= ~token~0 ~local~0)) (.cse1 (<= ~local~0 ~token~0)) (.cse4 (= ~E_1~0 2)) (.cse5 (<= 2 ~E_M~0)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse3 (not (= ~m_st~0 0))) (.cse6 (= ~m_pc~0 0))) (or (and (= ~t1_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= ~token~0 (+ ~local~0 1)) .cse7 (= ~m_pc~0 1) .cse4 .cse5 .cse2 (not (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) .cse3 (< ~local~0 ~token~0)) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse2 .cse3 .cse6))) [2021-10-11 02:26:47,690 INFO L258 CegarLoopResult]: At program point L127-2(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (< 0 ~t1_st~0)) (.cse3 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse5 (not (= ~m_st~0 0))) (.cse2 (= ~E_1~0 2))) (or (and (<= ~token~0 (+ ~local~0 1)) .cse0 (= ~E_M~0 1) .cse1 (= ~m_pc~0 1) .cse2 .cse3 (not .cse4) .cse5 (< ~local~0 ~token~0)) (and .cse0 .cse4 .cse1 .cse3 .cse5 .cse2 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,690 INFO L258 CegarLoopResult]: At program point L127-3(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0)) (.cse2 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse2 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,691 INFO L258 CegarLoopResult]: At program point L127-4(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ~E_1~0 2)) (.cse4 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 (<= ~token~0 ~local~0) (= ~m_pc~0 1) (<= ~local~0 ~token~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)))) [2021-10-11 02:26:47,691 INFO L265 CegarLoopResult]: At program point L458(lines 405 463) the Hoare annotation is: true [2021-10-11 02:26:47,691 INFO L262 CegarLoopResult]: For program point L229(lines 229 236) no Hoare annotation was computed. [2021-10-11 02:26:47,692 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-11 02:26:47,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:26:47 BoogieIcfgContainer [2021-10-11 02:26:47,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:26:47,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:26:47,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:26:47,771 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:26:47,772 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:26:41" (3/4) ... [2021-10-11 02:26:47,775 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:26:47,809 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 70 nodes and edges [2021-10-11 02:26:47,811 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-10-11 02:26:47,812 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 02:26:47,813 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:26:47,969 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd51d96b-3d47-4931-80ce-b4316d5e2c73/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:26:47,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:26:47,970 INFO L168 Benchmark]: Toolchain (without parser) took 8524.35 ms. Allocated memory was 113.2 MB in the beginning and 197.1 MB in the end (delta: 83.9 MB). Free memory was 75.1 MB in the beginning and 156.4 MB in the end (delta: -81.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:47,971 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 113.2 MB. Free memory is still 91.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:26:47,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.49 ms. Allocated memory is still 113.2 MB. Free memory was 74.9 MB in the beginning and 85.2 MB in the end (delta: -10.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:47,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.88 ms. Allocated memory is still 113.2 MB. Free memory was 85.2 MB in the beginning and 82.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:47,972 INFO L168 Benchmark]: Boogie Preprocessor took 39.54 ms. Allocated memory is still 113.2 MB. Free memory was 82.6 MB in the beginning and 80.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:47,973 INFO L168 Benchmark]: RCFGBuilder took 1477.66 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 80.5 MB in the beginning and 128.1 MB in the end (delta: -47.6 MB). Peak memory consumption was 55.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:47,973 INFO L168 Benchmark]: TraceAbstraction took 6379.48 ms. Allocated memory was 163.6 MB in the beginning and 197.1 MB in the end (delta: 33.6 MB). Free memory was 128.1 MB in the beginning and 165.9 MB in the end (delta: -37.7 MB). Peak memory consumption was 107.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:47,974 INFO L168 Benchmark]: Witness Printer took 198.17 ms. Allocated memory is still 197.1 MB. Free memory was 165.9 MB in the beginning and 156.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:26:47,976 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 113.2 MB. Free memory is still 91.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 370.49 ms. Allocated memory is still 113.2 MB. Free memory was 74.9 MB in the beginning and 85.2 MB in the end (delta: -10.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.88 ms. Allocated memory is still 113.2 MB. Free memory was 85.2 MB in the beginning and 82.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.54 ms. Allocated memory is still 113.2 MB. Free memory was 82.6 MB in the beginning and 80.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1477.66 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 80.5 MB in the beginning and 128.1 MB in the end (delta: -47.6 MB). Peak memory consumption was 55.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6379.48 ms. Allocated memory was 163.6 MB in the beginning and 197.1 MB in the end (delta: 33.6 MB). Free memory was 128.1 MB in the beginning and 165.9 MB in the end (delta: -37.7 MB). Peak memory consumption was 107.0 MB. Max. memory is 16.1 GB. * Witness Printer took 198.17 ms. Allocated memory is still 197.1 MB. Free memory was 165.9 MB in the beginning and 156.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && __retres1 == 0) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) || (((((((t1_pc == 1 && __retres1 == 0) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((((((__retres1 == 0 && m_st == E_1) && 0 < t1_st) && m_pc == 1) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && m_pc == 1) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M)) && token <= local) && local <= token) && !(tmp == 0)) || ((((((token <= local && m_st == 0) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((__retres1 == 0 && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((token <= local + 1 && t1_pc == 1) && m_pc == 1) && m_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && E_1 == 2) && local < token) && 2 <= E_M)) || (((((0 < t1_st && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((token <= local + 1 && t1_pc == 1) && E_M == 1) && 0 < t1_st) && m_pc == 1) && m_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && E_1 == 2) && local < token) || ((((((t1_pc == 1 && __retres1 == 0) && 0 < t1_st) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && m_pc == 0) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || ((((((((!(t1_pc == 1) && __retres1 == 0) && t1_st == 0) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && m_pc == 1) && token <= local) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || ((((t1_pc == 1 && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((__retres1 == 0 && __retres1 == 0) && t1_st == 0) && token <= local) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M) && m_pc == 0) || ((((((t1_pc == 1 && __retres1 == 0) && token <= local) && local <= token) && 2 <= E_M) && !(m_st == 0)) && !(tmp == 0)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && E_1 == 2) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((__retres1 == 0 && t1_st == 0) && m_pc == t1_pc) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && m_pc == 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((t1_st == 0 && token <= local) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) || ((((((((token <= local + 1 && t1_pc == 1) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && !(tmp == 0)) && !(__retres1 == 0)) && !(m_st == 0)) && local < token)) || (((((((t1_pc == 1 && token <= local) && local <= token) && E_1 == 2) && 2 <= E_M) && !(tmp == 0)) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((token <= local + 1 && t1_pc == 1) && E_M == 1) && 0 < t1_st) && m_pc == 1) && E_1 == 2) && !(tmp == 0)) && !(__retres1 == 0)) && !(m_st == 0)) && local < token) || ((((((t1_pc == 1 && __retres1 == 0) && 0 < t1_st) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && m_pc == 0) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((token <= local + 1 && t1_pc == 1) && m_pc == 1) && E_1 == 2) && 2 <= E_M) && !(tmp == 0)) && !(__retres1 == 0)) && !(m_st == 0)) && local < token - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && __retres1 == 0) && 0 < t1_st) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M) || ((((((!(t1_pc == 1) && 0 < t1_st) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((((__retres1 == 0 && m_st == E_1) && 0 < t1_st) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M)) || ((((((__retres1 == 0 && 0 < t1_st) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((((!(t1_pc == 1) && 0 < t1_st) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && __retres1 == 0) && token <= local) && local <= token) && 2 <= E_M) && !(m_st == 0)) && !(tmp == 0)) || (((((((__retres1 == 0 && t1_st == 0) && token <= local) && local <= token) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((!(t1_pc == 1) && t1_st == 0) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) || (((((((!(t1_pc == 1) && t1_st == 0) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((2 <= t1_st && t1_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((((2 <= t1_st && t1_pc == 1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((t1_pc == 1 && __retres1 == 0) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((((2 <= t1_st && t1_pc == 1) && m_pc == 1) && token <= local) && local <= token) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M) && !(tmp == 0))) || ((((((((__retres1 == 0 && t1_st == 0) && m_st == E_1) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M)) || ((((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && E_1 == 2) && !(tmp == 0)) && !(m_st == 0)) && 2 <= E_M)) || (((((((((2 <= t1_st && token <= local + 1) && t1_pc == 1) && m_pc == 1) && m_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && E_1 == 2) && local < token) && 2 <= E_M) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((t1_st == 0 && m_pc == t1_pc) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && m_pc == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= t1_st && token <= local + 1) && t1_pc == 1) && m_pc == 1) && m_st == 0) && E_1 == 2) && 2 <= E_M) && !(tmp == 0)) && !(__retres1 == 0)) && local < token) || (((((((!(t1_pc == 1) && t1_st == 0) && token <= local) && m_st == 0) && local <= token) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((!(t1_pc == 1) && t1_st == 0) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((((2 <= t1_st && t1_pc == 1) && m_pc == 1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && !(m_st == 0)) && 2 <= E_M)) || (((((((2 <= t1_st && t1_pc == 1) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((((t1_pc == 1 && __retres1 == 0) && m_pc == 1) && token <= local) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M)) || ((((((2 <= t1_st && t1_pc == 1) && !(tmp == 0)) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0)) || ((((((((__retres1 == 0 && t1_st == 0) && m_st == E_1) && token <= local) && m_pc == 1) && local <= token) && !(tmp == 0)) && E_1 == 2) && 2 <= E_M) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && __retres1 == 0) && token <= local) && m_pc == 1) && local <= token) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) || (((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && E_1 == 2) && 2 <= E_M) && m_pc == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1210 SDtfs, 1469 SDslu, 1243 SDs, 0 SdLazy, 455 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 366 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 93 NumberOfFragments, 1584 HoareAnnotationTreeSize, 22 FomulaSimplifications, 5002 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 49 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 59746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 240/241 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...